The asynchronous bounded-cycle model

DOI10.1016/J.TCS.2010.08.001MaRDI QIDQ719298zbMATH OpenOpenAlexWikidataFDO

Authors Peter Robinson, Ulrich Schmid

Publication date 10 October 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.tcs.2010.08.001

zbMATH Keywords

clock synchronizationfault-tolerant distributed algorithmspartially synchronous modelsVLSI

Mathematics Subject Classification ID

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

Recommendations

• The Theta-Model: achieving synchrony without clocks
• Efficiency of semisynchronous versus asynchronous networks
• Clock construction in fully asynchronous parallel systems and PRAM simulation
• scientific article; zbMATH DE number 4055012
• The perfectly synchronized round-based model of distributed computing

Cites work

• A formal approach to designing delay-insensitive circuits
• A necessary and sufficient condition for transforming limited accuracy failure detectors
• An introduction to oracles for asynchronous distributed systems
• Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Communication-efficient leader election and consensus with limited link synchrony
• Defining liveness
• Distributed Computing
• Graph theory
• scientific article; zbMATH DE number 4058844 (Why is no real title available?)
• scientific article; zbMATH DE number 2006647 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• On implementing omega in systems with weak reliability and synchrony assumptions
• On the minimal synchronism needed for distributed consensus
• On the possibility and impossibility of achieving clock synchronization
• The message classification model
• The Theta-Model: achieving synchrony without clocks
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems

Cited in

(7)

• Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
• Characterizing asynchronous message-passing models through rounds
• A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems
• Fire!
• Topological characterization of consensus in distributed systems
• A logic for repair and state recovery in Byzantine fault-tolerant multi-agent systems
• The perfectly synchronized round-based model of distributed computing

This page was built for publication: The asynchronous bounded-cycle model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719298)