Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Ensuring Fault Tolerance of Phase-Locked Clocks
IEEE Transactions on Computers
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Clock synchronization of a large multiprocessor system in the presence of malicious faults
IEEE Transactions on Computers
Journal of the ACM (JACM)
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
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
IEEE Transactions on Computers
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Effective distributed scheduling of parallel workloads
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Parallel and Distributed Systems
Causality and the spatial-temporal ordering in mobile systems
Mobile Networks and Applications
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
IEEE Transactions on Dependable and Secure Computing
TinySeRSync: secure and resilient time synchronization in wireless sensor networks
Proceedings of the 13th ACM conference on Computer and communications security
| Hi-index | 0.00 |
The cost of synchronizing a multicomputer increases with system size. For largemulticomputers, the time and resources spent to enable each node to estimate the clockvalue of every other node in the system can be prohibitive. We show how to reduce thecost of synchronization by assigning each node to one or more groups, then having eachnode estimate the clock values of only those nodes with which it shares a group. Sinceeach node estimates the clock value of only a subset of the nodes, the cost ofsynchronization can be significantly reduced. We also provide a method for computing the maximum skew between any two nodes in the multicomputer, and a method for computing the maximum time between synchronizations. We also show how the fault tolerance of the synchronization algorithm may be determined.