Narrowing Power vs. Efficiency in Synchronous Set Agreement

DOI10.1007/978-3-540-77444-0_8zbMath1131.68342OpenAlexW1537780864MaRDI QIDQ5445741

Michel Raynal, Achour Mostefaoui, Corentin Travers

Publication date: 6 March 2008

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

Full work available at URL: https://hal.inria.fr/inria-00139286/file/PI-1836.pdf

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Narrowing Power vs. Efficiency in Synchronous Set Agreement, From adaptive renaming to set agreement

Cites Work

• Unnamed Item
• A lower bound for the time to assure interactive consistency
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• Synchronous condition-based consensus
• Round-by-round fault detectors (extended abstract)
• Tight bounds for k -set agreement
• The topological structure of asynchronous computability
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Early stopping in Byzantine agreement
• From a static impossibility to an adaptive lower bound
• Impossibility of distributed consensus with one faulty process
• Algebraic spans
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• k-set agreement with limited accuracy failure detectors
• The combined power of conditions and failure detectors to solve asynchronous set agreement
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Narrowing Power vs. Efficiency in Synchronous Set Agreement