NPSI adaptive synchronization algorithms for PDES
WSC '95 Proceedings of the 27th conference on Winter simulation
Implementing a Probabilistic Clock Synchronization Algorithm
Real-Time Systems
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A scaled version of the elastic time algorithm
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Wireless sensor networks: a new regime for time synchronization
ACM SIGCOMM Computer Communication Review
An Election Algorithm for a Distributed Clock Synchronization Program
An Election Algorithm for a Distributed Clock Synchronization Program
NIST Net: a Linux-based network emulation tool
ACM SIGCOMM Computer Communication Review
Time-diffusion synchronization protocol for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In many distributed applications, identifying the sequence of event occurrence is useful. Doing so requires local clocks to be properly synchronized with each other. This paper presents a method of pseudo-synchronization of clocks by making use of the occurrence time of events included in direct "happened-before" relations. The basic idea is to approximate the actual clock shift between two clocks using the minimum transmission delay of messages between a pair of hosts. Evaluation results suggest that non-base clocks are closely synchronized with a base clock without violating the direct "happened-before" relations.