Adaptive progress: a gracefully-degrading liveness property

DOI10.1007/s00446-010-0106-4zbMath1231.68128OpenAlexW1991072415MaRDI QIDQ992505

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

livenessleader electionadaptive progress

Mathematics Subject Classification ID

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

Related Items (2)

A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ Partial synchrony based on set timeliness

Cites Work

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

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