On deterministic abortable objects

DOI10.1145/2484239.2484241MaRDI QIDQ5176077zbMATH OpenOpenAlexFDO

Authors 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

consensusfault toleranceshared memoryshared objectssynchronizationwait freedom

Mathematics Subject Classification ID

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

Recommendations

• Abortable and query-abortable objects and their efficient implementation
• scientific article; zbMATH DE number 7561269
• On the viability of the deterministic consensus hierarchy
• N-Consensus is the Second Strongest Object for N + 1 Processes
• Determining Consensus Numbers

Cited in

(5)

• On the uncontended complexity of anonymous agreement
• Life beyond set agreement
• 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
• Abortable and query-abortable objects and their efficient implementation

This page was built for publication: On deterministic abortable objects

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