Renaming and the weakest family of failure detectors
From MaRDI portal
Publication:1938384
DOI10.1007/s00446-012-0177-5zbMath1272.68061OpenAlexW2060829579MaRDI QIDQ1938384
Israel Nir, Yehuda Afek, Petr Kuznetsov
Publication date: 4 February 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-012-0177-5
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On set consensus numbers
- New combinatorial topology bounds for renaming: the lower bound
- Anti-\(\Omega \): the weakest failure detector for set agreement
- From adaptive renaming to set agreement
- On the ratio of optimal integral and fractional covers
- On coverings
- Failure detectors in loosely named systems
- Every problem has a weakest failure detector
- New combinatorial topology upper and lower bounds for renaming
- The Combinatorial Structure of Wait-Free Solvable Tasks
- The topological structure of asynchronous computability
- Renaming in an asynchronous environment
- Automatic Classification of Eventual Failure Detectors
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- Impossibility of distributed consensus with one faulty process
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- New constructions for covering designs
- Algebraic spans
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- The asynchronous computability theorem for t-resilient tasks
- Randomized wait-free concurrent objects (extended abstract)
- New combinatorial topology bounds for renaming
This page was built for publication: Renaming and the weakest family of failure detectors
