Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)

DOI10.1145/197917.198121zbMath1374.68065OpenAlexW1999968914MaRDI QIDQ5361425

Vassos Hadzilacos, Prasad Jayanti, Sam Toueg, Tushar Deepak Chandra

Publication date: 29 September 2017

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

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

Mathematics Subject Classification ID

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

Related Items (8)

Wait-free computing ⋮ On the use of registers in achieving wait-free consensus ⋮ On the power of shared object types to implement one-resilient Consensus ⋮ The BG distributed simulation algorithm ⋮ Hundreds of impossibility results for distributed computing ⋮ Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures ⋮ Unnamed Item ⋮ A classification of wait-free loop agreement tasks

This page was built for publication: Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)