Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Ensuring Fault Tolerance of Phase-Locked Clocks
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Synchronization and Matching in Redundant Systems
IEEE Transactions on Computers
Two Designs of a Fault-Tolerant Clocking System
IEEE Transactions on Computers
Synchronization of Fault-Tolerant Clocks in the Presence of Malicious Failures
IEEE Transactions on Computers - Fault-Tolerant Computing
Transmission Delays in Hardware Clock Synchronization
IEEE Transactions on Computers
IEEE Transactions on Computers
A Hybrid Monitor for Behavior and Performance Analysis of Distributed Systems
IEEE Transactions on Software Engineering
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
IEEE Transactions on Computers
ACM SIGCOMM Computer Communication Review
Use of Common Time Base for Checkpointing and Rollback Recovery in a Distributed System
IEEE Transactions on Software Engineering
Precision synchronization of computer network clocks
ACM SIGCOMM Computer Communication Review
Improved algorithms for synchronizing computer network clocks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
IEEE Transactions on Parallel and Distributed Systems
Probabilistic Clock Synchronization in Large Distributed Systems
IEEE Transactions on Computers
Synchronizing Hypercube Networks in the Presence of Faults
IEEE Transactions on Computers
Timing Constraint Remapping to Achieve Time Equi-Continuity in Distributed Real-Time Systems
IEEE Transactions on Computers
Fault-Tolerant Clock Synchronization in Large Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
IEEE Transactions on Dependable and Secure Computing
Hi-index | 15.00 |
Clock synchronization in the presence of malicious faults is one of the main problems associated with the design of a multiprocessor system. Although over the past few years many different algorithms have been proposed for overcoming this problem, they are not suitable for a large real-time multiprocessor system due to their excessive time overhead, asymmetric structure, and/or large number of interconnections. To remedy this problem, we propose a new method in this paper that i) requires little time overhead by using phase-locked clock synchronization, ii) needs a clock network very similar to the processor network, and iii) uses only 20-30 percent of the total number of interconnections required by a fully connected network for almost no loss in the synchronizing capabilities. Both ii) and iii) are made possible by grouping the various clocks in the system into many different clusters and then treating the clusters themselves as single clock units as far as the network is concerned. The method is significant in that regardless of their size multiprocessor systems can be built at an inexpensive cost without sacrificing both the synchronization and fault tolerance capabilities. To show the feasibility of our method, an example hardware implementation is presented. This implementation turns out to be much simpler than the other existing methods and also retains the symmetry and synchronizing capabilities of the network.