Ayru L. Oliveira Filho, Valmir C. Barbosa  Home/Search
Context Related
| cos.ufrj.br/~valmir/pdf/es53100.pdf cos.ufrj.br/~valmir/ps/es53100r.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cos.ufrj.br/~valmir/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Legality is a key concept for the definition of many shared-memory consistency conditions. As originally defined, a sequence of operations on a given object is legal if it is in the set of valid sequences specified for that object. Because legality is defined on totally ordered sets of operations, the actual derivation of algorithms and protocols to implement the consistency models that rely on some form of legalitymay tend to "exaggerate" the amount of synchronization that they eventually... (Update)
Context of citations to this paper: More
.... for the remainder of the paper by demonstrating properties of W that can be used to characterize deadlocks under AND OR requests [2, 10]. In particular, we give a tighter necessary condition for deadlocks to occur than simply the existence of directed cycles in W . If p...
Cited by: More
A Priority Dynamics for Generalized Drinking Philosophers - Barbosa, Benevides, al. (2001) (Correct)
Similar documents (at the sentence level):
52.2%: A Graph-Theoretic Model of Shared-Memory Legality - Filho, Barbosa (2000) (Correct)
Active bibliography (related documents): More All
0.3: Evaluating the Scalability of Distributed Systems - Jogalekar (1998) (Correct)
0.3: A Delay-Optimal Quorum-Based Mutual - Exclusion Algorithm For (Correct)
0.2: Respectful Type Converters - Jeannette Wing And (2000) (Correct)
Similar documents based on text: More All
0.4: Finding Approximate Palindromes in Strings - Porto, Barbosa (2002) (Correct)
0.4: The Interleaved Multichromatic Number of a Graph - Barbosa (Correct)
0.4: The Combinatorics of Resource Sharing - Barbosa (1999) (Correct)
Related documents from co-citation: More All
2: Concurrency in heavily loaded neighborhood-constrained systems (context) - Barbosa, Gafni - 1989
2: Deadlock Models and General Algorithm for Distributed Deadlock Detection (context) - Brzezinski, Helary et al. - 1992
2: An Introduction to Distributed Algorithms (context) - Barbosa - 1996
BibTeX entry: (Update)
Ayru L. Oliveira Filho and V. C. Barbosa, #A graph-theoretic model of shared-memory legality, " UFRJ technical report COPPE-ES-531#00, Rio de Janeiro, Brazil, April 2000. http://citeseer.ist.psu.edu/oliveirafilho00graphtheoretic.html More
@misc{ filho00graphtheoretic,
author = "A. Filho and V. Barbosa",
title = "A graph-theoretic model of shared-memory legality",
text = "Ayru L. Oliveira Filho and V. C. Barbosa, "A graph-theoretic model of shared-memory
legality, UFRJ technical report COPPE-ES-531#00, Rio de Janeiro, Brazil,
April 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/oliveirafilho00graphtheoretic.html" }
Citations (may not include all citations):53 Springer Verlag (context) - Science - 1995
5 volume 1026 of Lecture Notes in Computer Science (context) - Science - 1995
4 on Programming Languages and Systems (context) - Trans - 1990
1 Rio de Janeiro (context) - ES-, UFRJ - 1998
1 on Computer Architecture #ISCA (context) - Int - 1990
Documents on the same site (http://www.cos.ufrj.br/~valmir/papers.html): More
A Graph-Theoretic Characterization of AND-OR Deadlocks - Barbosa, Benevides (1998) (Correct)
The Combinatorics of Resource Sharing - Barbosa (1999) (Correct)
The Combinatorics of Resource Sharing - Barbosa (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC