(Enter summary)
Abstract: Implementing traditional forms of multiprocess synchronization requires a
hardware arbiter. Here, we consider what kind of synchronization is achievable
without arbitration. Several kinds of simple arbiter-free registers are
de
ned and shown to have equal power, and the class of synchronization
problems solvable with such registers is characterized. More powerful forms
of arbiter-free communication primitives are described. However, the problem
of characterizing the most general form of... (Update)
Cited by: More
ACM SIGACT News Distributed Computing Column 13 - Sergio Rajsba Um
(Correct)
Active bibliography (related documents): More All
0.3: A Glitch in the Theory of Delay-Insensitive Circuits - Kuszmaul
(Correct)
0.3: A Hundred Impossibility Proofs for Distributed Computing - Lynch (1989)
(Correct)
0.2: Supporting Increment and Decrement Operations in.. - Aiello, Busch.. (2000)
(Correct)
Similar documents based on text: More All
0.1: Fairness and Hyperfairness - Lamport (1998)
(Correct)
0.1: The Distributed Computing Column - Sergio Rajsbaum November
(Correct)
0.1: Some perspectives on PODC - Lynch (2003)
(Correct)
BibTeX entry: (Update)
Leslie Lamport, \Arbitration-free synchronization," Distributed Computing Volume 16, Numbers 2-3, September 2003, pp. 219-237. http://citeseer.ist.psu.edu/lamport02arbitrationfree.html More
@misc{ lamport03arbitrationfree,
author = "L. Lamport",
title = "Arbitration-free synchronization",
text = "Leslie Lamport, \Arbitration-free synchronization, Distributed Computing
Volume 16, Numbers 2-3, September 2003, pp. 219-237.",
year = "2003",
url = "citeseer.ist.psu.edu/lamport02arbitrationfree.html" }
Citations (may not include all citations):
1180
The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1991
322
volume 92 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
221
Introduction to VLSI Systems (context) - Mead, Conway - 1980
181
ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
83
Hierarchical ordering of sequential processes (context) - Dijkstra - 1971
83
Communications of the ACM (context) - Sutherland - 1989
75
On interprocess communication
- Lamport - 1986
64
Marked directed graphs (context) - Commoner, Holt et al. - 1971
54
and the ordering of events in a distributed system (context) - Lamport, clocks - 1978
44
The mutual exclusion problem|part i: A theory of interproces..
- Lamport - 1986
44
Anomalous behavior of synchronizer and arbiter circuits (context) - Chaney, Molnar - 1973
43
part i: Basic formalism (context) - Lamport, communication - 1986
33
part ii: Algorithms (context) - Lamport, communication - 1986
23
General theory of metastable operation (context) - Marino - 1981
21
garbage collection: an exercise in cooperation (context) - Dijkstra, Lamport et al. - 1978
19
Elements of Distributed Algorithms: Modeling and Analysis wi.. (context) - Reisig - 1998
9
A Theory of Delay-Insensitive Systems (context) - Verhoe - 1994
4
and \writers (context) - Courtois, Heymans et al. - 1971
3
A new explanation of the glitch phenomenon
- Anderson, Gouda - 1991
1
Currently available from http: //research (context) - Lamport - 1986
1
Analyzing speci cations for delay-insensitive circuits (context) - Verhoe - 1989
Documents on the same site (http://research.microsoft.com/users/lamport/pubs/pubs.html#time-clocks): More
Lower Bounds on Consensus - Lamport (2000)
(Correct)
High-Level Specifications: Lessons from Industry - Batson, Lamport (2003)
(Correct)
Formal Specification of a Web Services Protocol - Johnson (2004)
(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