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

DOI10.1016/J.TCS.2022.01.029MaRDI QIDQ2078617zbMATH OpenOpenAlexFDO

Authors Anaïs Durand, Michel Raynal, Gadi Taubenfeld

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

agreement algorithmasynchronous systemconcurrencycontentionprocess crash

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Reaching agreement in the presence of contention-related crash failures
• Reaching consensus in the presence of contention-related crash failures
• Set agreement and renaming in the presence of contention-related crash failures
• Time and Communication Efficient Consensus for Crash Failures
• Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
• Failure detection and consensus in the crash-recovery model
• Fast scalable deterministic consensus for crash failures
• A crash-tolerant consensus algorithm in presence of probabilistic message omission
• scientific article; zbMATH DE number 2080904
• Impossibility Results and Lower Bounds for Consensus under Link Failures

Cites work

• A closer look at fault tolerance
• Atomic snapshots of shared memory
• Concurrent programming: algorithms, principles, and foundations.
• Distributed universality
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Generalized Universality
• scientific article; zbMATH DE number 6905187 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Indulgent algorithms (preliminary version)
• Initial failures in distributed computations
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• On interprocess communication. I: Basic formalism
• Reaching Agreement in the Presence of Faults
• Set agreement and renaming in the presence of contention-related crash failures
• The disagreement power of an adversary
• The topological structure of asynchronous computability
• The weakest failure detector for solving consensus
• Unreliable failure detectors for reliable distributed systems
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

Cited in

(2)

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

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

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