Abortable and query-abortable objects and their efficient implementation

DOI10.1145/1281100.1281107MaRDI QIDQ5401389zbMATH OpenOpenAlexFDO

Authors Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg, Marcos Kawazoe Aguilera

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

memory contentionshared memoryobstruction-freedomuniversal constructionsnon-trivialityabortable types

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• On deterministic abortable objects
• Distributed Computing
• The complexity of obstruction-free implementations
• Fault-tolerant wait-free shared objects
• The weakest failure detectors to boost obstruction-freedom

Cited in

(7)

• Adaptive progress: a gracefully-degrading liveness property
• Verifying the consistency of remote untrusted services with conflict-free operations
• On deterministic abortable objects
• In the search for optimal concurrency
• An almost tight RMR lower bound for abortable test-and-set
• 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

This page was built for publication: Abortable and query-abortable objects and their efficient implementation

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