Contention-related crash failures: definitions, agreement algorithms, and impossibility results

DOI10.1016/J.TCS.2022.01.029OpenAlexW4206087759MaRDI QIDQ2078617

Gadi Taubenfeld, Michel Raynal, Anaïs Durand

Publication date: 1 March 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.029

zbMATH Keywords

concurrencyasynchronous systemprocess crashcontentionagreement algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Reaching agreement in the presence of contention-related crash failures ⋮ Reaching consensus in the presence of contention-related crash failures

Cites Work

• Unnamed Item
• Distributed universality
• The disagreement power of an adversary
• Initial failures in distributed computations
• On interprocess communication. I: Basic formalism
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Generalized Universality
• The topological structure of asynchronous computability
• Concurrent Programming: Algorithms, Principles, and Foundations
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Atomic snapshots of shared memory
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Indulgent algorithms (preliminary version)
• Fault-Tolerant Message-Passing Distributed Systems
• Generalized FLP impossibility result for t-resilient asynchronous computations
• A closer look at fault tolerance
• Set agreement and renaming in the presence of contention-related crash failures

This page was built for publication: Contention-related crash failures: definitions, agreement algorithms, and impossibility results