The Theta-Model: achieving synchrony without clocks

DOI10.1007/S00446-009-0080-XMaRDI QIDQ2377129zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A framework for synchronization theory
• A minimal model of self-consistent partial synchrony
• A theory of clock synchronization (extended abstract)
• Synchronization hypothesis in the Winfree model
• Stochastic time synchronization models based on agreement algorithms
• On the double sphere model of synchronization
• Asymptotic behaviour in the time synchronization model
• Synchronization in Temporal Simplicial Complexes
• Phase Transitions in the Time Synchronization Model
• scientific article; zbMATH DE number 4035161

Cites work

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

Cited in

(10)

• Characterizing Consensus in the Heard-Of Model
• Reconciling fault-tolerant distributed computing and systems-on-chip
• The asynchronous bounded-cycle model
• Accuracy of message counting abstraction in fault-tolerant distributed algorithms
• The perfectly synchronized round-based model of distributed computing
• Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
• Fire!
• Round-Oblivious Stabilizing Consensus in Dynamic Networks
• Booting clock synchronization in partially synchronous systems with hybrid process and link failures
• A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems

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

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