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 defined 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 arbiter-free synchronization remains unsolved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 2001, Accepted: July 2002,
Rights and permissions
About this article
Cite this article
Lamport, L. Arbitration-free synchronization. Distrib. Comput. 16, 219–237 (2003). https://doi.org/10.1007/s00446-002-0076-2
Issue Date:
DOI: https://doi.org/10.1007/s00446-002-0076-2