The computational structure of progress conditions and shared objects

DOI10.1007/s00446-019-00356-0zbMath1434.68050OpenAlexW2949658900WikidataQ127678358 ScholiaQ127678358MaRDI QIDQ1988520

Gadi Taubenfeld

Publication date: 23 April 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-019-00356-0

zbMATH Keywords

synchronizationuniversalityconsensusshared objectswait-freedomwait-free hierarchy\(k\)-obstruction-freedom\(S\)-freedompower hierarchyprogress conditions

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Distributed universality
• The topology of distributed adversaries
• Contention-sensitive data structures and algorithms
• The disagreement power of an adversary
• On the nonexistence of resilient consensus protocols
• Failure detectors as type boosters
• The weakest failure detectors to boost obstruction-freedom
• Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
• The concurrency hierarchy, and algorithms for unbounded concurrency
• Safety-Liveness Exclusion in Distributed Computing
• Timeliness-based wait-freedom
• The Computational Structure of Progress Conditions
• Contention-Sensitive Data Structures and Algorithms
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Robust wait-free hierarchies
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• Hundreds of impossibility results for distributed computing
• On asymmetric progress conditions
• Toward a theory of transactional contention managers
• Deterministic Objects
• Coordination Without Prior Agreement
• Distributed Computing
• Distributed Computing
• Distributed Computing
• Distributed Computing