Synchronization
The problem of synchronizing clocks of processes in a fully connected network is considered. It is proved that, even if the clocks all run at the same rate as real time and there are no failures, an uncertainty of epsilon in the message delivery time makes it impossible to synchronize the clocks of n processes any more closely than epsilon(1 - 1/n). (Jennifer Lundelius and Nancy Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2/3):190-204, August/September 1984)
RTIME has received protection for its unique global timebase that keeps disparate users synchronized within milliseconds to overcome high and varying network latency. (Press release January 26, 1999 - company info http://www.rtimeinc.com)
