The asynchronous bounded-cycle model
From MaRDI portal
Publication:719298
DOI10.1016/j.tcs.2010.08.001zbMath1223.68021OpenAlexW2010784157WikidataQ38681705 ScholiaQ38681705MaRDI QIDQ719298
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.001
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A formal approach to designing delay-insensitive circuits
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
- Defining liveness
- On the possibility and impossibility of achieving clock synchronization
- A necessary and sufficient condition for transforming limited accuracy failure detectors
- The Theta-Model: achieving synchrony without clocks
- On implementing omega in systems with weak reliability and synchrony assumptions
- The message classification model
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Time, clocks, and the ordering of events in a distributed system
- Bounds on the time to reach agreement in the presence of timing uncertainty
- Unreliable failure detectors for reliable distributed systems
- An introduction to oracles for asynchronous distributed systems
- Distributed Computing
- Communication-efficient leader election and consensus with limited link synchrony
This page was built for publication: The asynchronous bounded-cycle model