Abortable and query-abortable objects and their efficient implementation

DOI10.1145/1281100.1281107zbMath1283.68072OpenAlexW2095950283MaRDI QIDQ5401389

Sam Toueg, Svend Frølund, Stephanie Lorraine Horn, Vassos Hadzilacos, 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

shared memorymemory contentionobstruction-freedomuniversal constructionsnon-trivialityabortable types

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Verifying the consistency of remote untrusted services with conflict-free operations ⋮ Unnamed Item ⋮ Adaptive progress: a gracefully-degrading liveness property ⋮ In the Search for Optimal Concurrency

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