Timeliness-based wait-freedom, a gracefully degrading progress condition

DOI10.1145/1400751.1400792MaRDI QIDQ2934355zbMATH OpenOpenAlexFDO

Authors Sam Toueg, Marcos Kawazoe Aguilera

Publication date 12 December 2014

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

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

zbMATH Keywords

memory contentionshared memoryobstruction-freedomwait-freedomuniversal constructionsgraceful degradationabortable registersdynamic leader election

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Adaptive progress: a gracefully-degrading liveness property
• On asymmetric progress conditions
• Partial synchrony based on set timeliness
• Fault-tolerant wait-free shared objects
• Partial synchrony based on set timeliness

Cited in

(4)

• The computational structure of progress conditions and shared objects
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• Contention-sensitive data structures and algorithms
• Adaptive progress: a gracefully-degrading liveness property

This page was built for publication: Timeliness-based wait-freedom, a gracefully degrading progress condition

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