A completeness theorem for a class of synchronization objects

DOI10.1145/164051.164071MaRDI QIDQ5361376zbMATH OpenOpenAlexFDO

Authors Yehuda Afek, Eytan Weisberger, Hanan Weisman

Publication date 29 September 2017

Published in Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cited in

(16)

• Solving the at-most-once problem with nearly optimal effectiveness
• Power and limits of distributed computing shared memory models
• The power of multiobjects.
• scientific article; zbMATH DE number 7561269 (Why is no real title available?)
• Strong linearizability using primitives with consensus number 2
• Untangling partial agreement: iterated \(x\)-consensus simulations
• Relaxed queues and stacks from read/write operations
• Extending the wait-free hierarchy to multi-threaded systems
• On the use of registers in achieving wait-free consensus
• Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
• Common2 extended to stacks and unbounded concurrency
• A closer look at fault tolerance
• Bounded disagreement
• Life beyond set agreement
• On the viability of the deterministic consensus hierarchy
• Preserving hyperproperties of programs using primitives with consensus number 2

This page was built for publication: A completeness theorem for a class of synchronization objects

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