Tight bounds for \(k\)-set agreement with limited-scope failure detectors

DOI10.1007/s00446-005-0141-8zbMath1264.68086OpenAlexW2077963177MaRDI QIDQ1953644

Lucia Draque Penso, Maurice P. Herlihy

Publication date: 7 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-005-0141-8

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (6)

On the computability power and the robustness of set agreement-oriented failure detector classes ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement ⋮ From adaptive renaming to set agreement ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound

Cites Work

• Unifying synchronous and asynchronous message-passing models
• Round-by-round fault detectors (extended abstract)
• Structured derivations of consensus algorithms for failure detectors
• Tight bounds for k -set agreement
• The topological structure of asynchronous computability
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Algebraic spans
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• k-set agreement with limited accuracy failure detectors
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tight bounds for \(k\)-set agreement with limited-scope failure detectors