Clock Synchronization in High-end Computing Environments: A Strategy for Minimizing Clock Variance at Runtime
Journal Article
·
· Concurrency and Computation. Practice and Experience
- ORNL
We present a new software-based clock synchronization scheme that provides high precision time agreement among distributed memory nodes. The technique is designed to minimize variance from a reference chimer during runtime and with minimal time-request latency. Our scheme permits initial unbounded variations in time and corrects both slow and fast chimers (clock skew). An implementation developed within the context of the MPI message passing interface is described, and time coordination measurements are presented. Among our results, the mean time variance for a set of nodes improved from 20.0 milliseconds under standard Network Time Protocol (NTP) down to 2.29 secs under our scheme.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States). Oak Ridge Leadership Computing Facility (OLCF)
- Sponsoring Organization:
- DOE Office of Science; SC USDOE - Office of Science (SC)
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1105917
- Journal Information:
- Concurrency and Computation. Practice and Experience, Journal Name: Concurrency and Computation. Practice and Experience Journal Issue: 6 Vol. 25; ISSN 1532-0626
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Clock Synchronization Strategy for Minimizing Clock Variance at Runtime in High-end Computing Environments
Providing Runtime Clock Synchronization With Minimal Node-to-Node Time Deviation on XT4s and XT5s
Automatic Halo Management for the Uintah GPU-Heterogeneous Asynchronous Many-Task Runtime
Conference
·
Thu Dec 31 23:00:00 EST 2009
·
OSTI ID:1056896
Providing Runtime Clock Synchronization With Minimal Node-to-Node Time Deviation on XT4s and XT5s
Conference
·
Fri Dec 31 23:00:00 EST 2010
·
OSTI ID:1016620
Automatic Halo Management for the Uintah GPU-Heterogeneous Asynchronous Many-Task Runtime
Journal Article
·
Thu Dec 06 23:00:00 EST 2018
· International Journal of Parallel Programming
·
OSTI ID:1567537