Adaptive progress: a gracefully-degrading liveness property

DOI10.1007/S00446-010-0106-4MaRDI QIDQ992505zbMATH OpenOpenAlexFDO

Authors Sam Toueg, Marcos Kawazoe Aguilera

Publication date 9 September 2010

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-010-0106-4

zbMATH Keywords

leader electionlivenessadaptive progress

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Recommendations

• Timeliness-based wait-freedom, a gracefully degrading progress condition
• On asymmetric progress conditions
• Fault-tolerant wait-free shared objects
• Progress under bounded fairness
• An adaptive collect algorithm with applications

Cites work

• Abortable and query-abortable objects and their efficient implementation
• Distributed Computing
• Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms
• On implementing omega in systems with weak reliability and synchrony assumptions
• On interprocess communication. I: Basic formalism
• On interprocess communication. II: Algorithms
• Randomized wait-free concurrent objects (extended abstract)
• The weakest failure detector for solving consensus
• Timeliness-based wait-freedom, a gracefully degrading progress condition
• Toward a theory of transactional contention managers
• Unreliable failure detectors for reliable distributed systems

Cited in

(3)

• Timeliness-based wait-freedom, a gracefully degrading progress condition
• A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
• Partial synchrony based on set timeliness

This page was built for publication: Adaptive progress: a gracefully-degrading liveness property

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