Arbitration-free synchronization

DOI10.1007/S00446-002-0076-2MaRDI QIDQ5138492zbMATH OpenOpenAlexFDO

Authors Leslie Lamport

Publication date 4 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-002-0076-2

zbMATH Keywords

arbitermarked graphsmultiprocess synchronization

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Ideal Arbiters: Analysis and Design
• Rankers: A classification of synchronization problems
• On the inherent weakness of conditional synchronization primitives
• Newtonian arbiters cannot be proven correct
• Synchronization costs on multiprocessors

Cited in

(9)

• Newtonian arbiters cannot be proven correct
• Rankers: A classification of synchronization problems
• Synthesis and reengineering of persistent systems
• An extension of the taxonomy of persistent and nonviolent steps
• Flat arbiters
• Ideal Arbiters: Analysis and Design
• On Synchronous and Asynchronous Interaction in Distributed Systems
• Distributed Control of Discrete-Event Systems: A First Step
• Symmetric and asymmetric asynchronous interaction

This page was built for publication: Arbitration-free synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138492)