Booting clock synchronization in partially synchronous systems with hybrid process and link failures

DOI10.1007/s00446-007-0026-0zbMath1266.68124OpenAlexW2014098920MaRDI QIDQ1954236

Ulrich Schmid, Josef Widder

Publication date: 20 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-007-0026-0

zbMATH Keywords

link failuresfault-tolerant distributed algorithmshybrid failure modelspartially synchronous systemsinitial clock synchronizationsystem start-up

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (9)

The Theta-Model: achieving synchrony without clocks ⋮ Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip ⋮ Synthesis of distributed algorithms with parameterized threshold guards ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ Of choices, failures and asynchrony: the many faces of set agreement ⋮ On the impact of link faults on Byzantine agreement ⋮ Reconciling fault-tolerant distributed algorithms and real-time computing ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Temporal prophecy for proving temporal properties of infinite-state systems

Cites Work

• Unnamed Item
• On the possibility and impossibility of achieving clock synchronization
• A new fault-tolerant algorithm for clock synchronization
• Operating systems. An advanced course
• Practical uses of synchronized clocks in distributed systems
• Interval-based clock synchronization with optimal precision.
• The customizable fault/error model for dependable distributed systems.
• The Theta-Model: achieving synchrony without clocks
• The Heard-Of model: computing in distributed systems with benign faults
• Round-by-round fault detectors (extended abstract)
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Exploiting omissive faults in synchronous approximate agreement
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• An upper and lower bound for clock synchronization
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Timeliness, failure-detectors, and consensus performance
• On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
• A formally verified algorithm for clock synchronization under a hybrid fault model
• Lower bounds for convergence function based clock synchronization
• Principles of Distributed Systems
• Distributed Computing

This page was built for publication: Booting clock synchronization in partially synchronous systems with hybrid process and link failures