Reaching agreement in the presence of contention-related crash failures

DOI10.1016/j.tcs.2023.113982OpenAlexW4378649182MaRDI QIDQ6100185

Anaïs Durand, Gadi Taubenfeld, Michel Raynal

Publication date: 21 June 2023

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

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

zbMATH Keywords

algorithmconcurrencyconsensusasynchronous system\(k\)-set agreementatomic registerconsensus numberprocess crash failureimpossibilitycontentionparticipating processread/write register\( \lambda \)-constrained failure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Initial failures in distributed computations
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results
• Round-by-round fault detectors (extended abstract)
• 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
• 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

This page was built for publication: Reaching agreement in the presence of contention-related crash failures