Wait-free synchronization in multiprogrammed systems

DOI10.1145/301308.301341MaRDI QIDQ2942756zbMATH OpenOpenAlexFDO

Authors James H. Anderson, Mark Moir

Publication date 11 September 2015

Published in Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301308.301341

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Distributed algorithms (68W15)

Cited in

(4)

• A simple proof technique for priority-scheduled systems
• A modular approach to shared-memory consensus, with applications to the probabilistic-write model
• Randomized protocols for asynchronous consensus
• Switched PIOA: parallel composition via distributed scheduling

This page was built for publication: Wait-free synchronization in multiprogrammed systems

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