On deterministic abortable objects

DOI10.1145/2484239.2484241zbMath1323.68044OpenAlexW1979684554MaRDI QIDQ5176077

Vassos Hadzilacos, Sam Toueg

Publication date: 2 March 2015

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

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

zbMATH Keywords

synchronizationfault toleranceshared memoryconsensusshared objectswait freedom

Mathematics Subject Classification ID

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

Related Items (4)

Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ On the uncontended complexity of anonymous agreement ⋮ Life beyond set agreement

This page was built for publication: On deterministic abortable objects