The Theta-Model: achieving synchrony without clocks

DOI10.1007/s00446-009-0080-xzbMath1267.68159OpenAlexW2037762696MaRDI QIDQ2377129

Josef Widder, Ulrich Schmid

Publication date: 28 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-009-0080-x

zbMATH Keywords

computing modelsfault-tolerant distributed algorithmspartially synchronous systemsclocks and time

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (7)

A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ Reconciling fault-tolerant distributed computing and systems-on-chip ⋮ Booting clock synchronization in partially synchronous systems with hybrid process and link failures ⋮ The asynchronous bounded-cycle model ⋮ Characterizing Consensus in the Heard-Of Model ⋮ Fault-tolerant algorithms for tick-generation in asynchronous logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A formal approach to designing delay-insensitive circuits
• Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit
• A new fault-tolerant algorithm for clock synchronization
• A necessary and sufficient condition for transforming limited accuracy failure detectors
• Booting clock synchronization in partially synchronous systems with hybrid process and link failures
• On implementing omega in systems with weak reliability and synchrony assumptions
• Round-by-round fault detectors (extended abstract)
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• The Byzantine Generals Problem
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Unreliable failure detectors for reliable distributed systems
• Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors
• An introduction to oracles for asynchronous distributed systems
• Consensus in the presence of timing uncertainty
• On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
• Distributed Computing
• Communication-efficient leader election and consensus with limited link synchrony
• Distributed Computing

This page was built for publication: The Theta-Model: achieving synchrony without clocks