Wait-freedom with advice
From MaRDI portal
Publication:5918242
DOI10.1007/s00446-014-0231-6zbMath1322.68024arXiv1109.3056OpenAlexW2023399775MaRDI QIDQ5918242
Hugues Fauconnier, Carole Delporte-Gallet, Petr Kuznetsov, Eli Gafni
Publication date: 25 March 2015
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3056
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Unnamed Item
- Unnamed Item
- The disagreement power of an adversary
- On set consensus numbers
- New combinatorial topology bounds for renaming: the lower bound
- Anti-\(\Omega \): the weakest failure detector for set agreement
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Partial synchrony based on set timeliness
- Renaming and the weakest family of failure detectors
- Failure detectors as type boosters
- Mutual exclusion in asynchronous systems with failure detectors
- Round-by-round fault detectors (extended abstract)
- Every problem has a weakest failure detector
- Generalized Universality
- The topological structure of asynchronous computability
- Algorithms adapting to point contention
- Renaming in an asynchronous environment
- Tight failure detection bounds on atomic object implementations
- Impossibility of distributed consensus with one faulty process
- Time, clocks, and the ordering of events in a distributed system
- Atomic snapshots of shared memory
- Sharing memory robustly in message-passing systems
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- The BG distributed simulation algorithm
- The extended BG-simulation and the characterization of t-resiliency
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Immediate atomic snapshots and fast renaming
- The weakest failure detectors to solve certain fundamental problems in distributed computing
- Wait-freedom with advice
This page was built for publication: Wait-freedom with advice
