A completeness theorem for a class of synchronization objects

DOI10.1145/164051.164071zbMath1373.68068OpenAlexW2082497009MaRDI QIDQ5361376

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

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

Related Items (13)

Extending the wait-free hierarchy to multi-threaded systems ⋮ On the viability of the deterministic consensus hierarchy ⋮ Bounded disagreement ⋮ Solving the at-most-once problem with nearly optimal effectiveness ⋮ Power and limits of distributed computing shared memory models ⋮ Life beyond set agreement ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ Common2 extended to stacks and unbounded concurrency ⋮ On the use of registers in achieving wait-free consensus ⋮ A closer look at fault tolerance ⋮ Unnamed Item ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ The power of multiobjects.

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