Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Clock synchronization of a large multiprocessor system in the presence of malicious faults
IEEE Transactions on Computers
Journal of the ACM (JACM)
Clock synchronization in distributed real-time systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Synchronization of Fault-Tolerant Clocks in the Presence of Malicious Failures
IEEE Transactions on Computers - Fault-Tolerant Computing
A new fault-tolerant algorithm for clock synchronization
Information and Computation
Topological Properties of Hypercubes
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
IEEE Transactions on Computers
Continuous clock amortization need not affect the precision of a clock synchronization algorithm
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Diagnosing Arbitrarily Connected Parallel Computers with High Probability
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Adaptive fault-tolerant multicast in hypercube multicomputers
Journal of Parallel and Distributed Computing
Fault-tolerant multicasting on hypercubes
Journal of Parallel and Distributed Computing
Dynamic fault-tolerant clock synchronization
Journal of the ACM (JACM)
A new and improved algorithm for fault-tolerant clock synchronization
Journal of Parallel and Distributed Computing
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Reaching Approximate Agreement with Mixed-Mode Faults
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Clock Synchronization in Large Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
Mechanical Verification of a Generalized Protocol for Byzantine Fault Tolerant Clock Synchronization
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Consensus service: a modular approach for building agreement protocols in distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Practical uses of synchronized clocks in distributed systems
Distributed Computing
Self-adaptive clock synchronization based on clock precision difference
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Self-adaptive clock synchronization for computational grid
Journal of Computer Science and Technology - Grid computing
Hi-index | 0.00 |
We present a new approach for fault-tolerant internal clock synchronization in multicomputer systems employing not-completely connected networks (NCCNs). The approach is referred to as multistep interactive convergence and is locally implemented in each multicomputer node by a time server process (TSP). We describe a specific algorithm that uses multistep interactive convergence and bases its operation on a logical mapping of the system's TSPs into an m-dimensional array. A TSP executes m steps per round of synchronization, with each step including a call to an interactive convergence procedure. For any TSP, clock readings in step i are gathered only from TSPs with which it shares a row along dimension i of the array. Hence, a TSP reads clocks only from a small subset of the TSPs in the system, which reduces the number of messages by orders of magnitude over a conventional interactive convergence algorithm in which reliable all-to-all broadcast of clock values is done. The algorithm can be used in systems of arbitrary topology and provides the added benefit of increased locality of communication in regular NCCNs such as hypercubes and tori. These advantages can be combined with a variety of message staggering mechanisms to maintain network contention at a minimum. We present expressions for the maximum clock skew, maximum clock drift, maximum clock discontinuity, and number of messages produced by the algorithm, and show that it tolerates arbitrary faults. A comparison with other algorithms that elucidates the advantages of multistep interactive convergence is also provided.