Probabilistic Clock Synchronization in Distributed Systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 5, Issue 5, 1994, Pages 474-487

  Arvind, K ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

Clock synchronization; deterministic algorithm; distributed systems; master slave scheme; probabilistic algorithm; probability of invalidity; time transmission protocol

Indexed keywords

CLOCKS; DISTRIBUTED COMPUTER SYSTEMS; ERRORS; ESTIMATION; NETWORK PROTOCOLS; PROBABILITY; QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS); SYNCHRONIZATION;

CLOCK SKEW; CLOCK SYNCHRONIZATION; DETERMINISTIC ALGORITHM; MASTER SLAVE SCHEME; PROBABILISTIC ALGORITHM; PROBABILITY OF INVALIDITY; TIME TRANSMISSION PROTOCOL;

ALGORITHMS;

EID: 0028433699     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.282558     Document Type: Article

References (19)

1. K. Arvind, “A new probabilistic algorithm for clock synchronization,” Proc. Real-Time Syst. Symp., 1989, 330–339.
2. K. Arvind “A new probabilistic algorithm for clock synchronization,” COINS Tech. Rep. 89–86, Dept, of Comput. and Inform. Sci., Univ. of Mass, at Amherst, MA, 1989.
3. F. Cristian, “A probabilistic approach to distributed clock synchronization,” Distrib. Computing, vol. 3, 146–158, 1989.
4. F. Cristian, priv. commun., Dec. 1989.
5. F. Cristian, “Questions to ask when designing or attempting to understand a fault-tolerant distributed system,” keynote address, Proc. 3rd Brazilian Conf Fault-Tolerant Computing, Rio de Janeiro, 1989.
6. F. Cristian, H. Aghili, and R. Strong, “Clock synchronization in the presence of omission and performance faults, and processor joins,” Proc. Int. Conf. Fault-Tolerant Computing, pp. 218–223, 1986
7. D. Dolev, J. Y. Halpem and H. R. Strong, “On the possibility and impossibility of achieving clock synchronization,” J. Comput. Syst. Sci., vol. 32, no. 2, pp. 230–250, 1986.
8. J. Halpem, B. Simons, and R. Strong, “Fault-tolerant clock synchro-nization,” Proc. 3rd Ann. ACM Symp. Principles of Distrib. Computing, 1984, pp. 89–102.
9. H. Kopetz and W. Ochsenreiter, “Clock synchronization in distributed real-time systems,” IEEE Trans. Comput., vol. 36, no. 8, pp. 933–940, Aug. 1987.
10. H. Kopetz, A. Damm, C. Koza, M. Mulazzani, W. Schwabl, C. Senft, and R. Zainlinger, “Distributed fault-tolerant real-time systems: The MARS approach,” MARS Rep. 4188, Institut fur Technische Inforrnatik, Technische Universitat Wien, Austria, 1988.
11. L. Lamport, “Time, clocks and the ordering of events in a distributed system,” Commun ACM, vol. 21, no. 7, pp. 558–565, 1978.
12. L. Lamport and P. M. Melliar-Smith, “Synchronizing clocks in the presence of faults,” J. ACM, vol. 32, no. 1, pp. 52–78, 1985.
13. L. Lamport and P. M. Melliar-Smith, “Byzantine clock synchronization,” Proc. 3rd Ann. ACM Symp. Principles of Distrib. Computing, 1984, pp. 68–74.
14. J. Lundelius and N. Lynch, “A new fault-tolerant algorithm for clock synchronization,” Proc. 3rd Ann. ACM Symp. Principles of Distrib. Computing, 1984, pp. 75–88.
15. L. Lundelius and N. Lynch, “An upper and lower bound for clock synchronization,” Inform. Control, vol. 62, pp. 190–204, 1984.
16. J.A. Stankovic and K. Ramamritham, “Design of the Spring kernel,” COINS Tech. Rep. 88–85, Dept, of Comput. and Inform. Sci., Univ. of Mass., Amherst, 1988.
17. C. J. Walter, R. M. Kieckhafer, and A. M. Finn, “MAFL A multicomputer architecture for fault-tolerance in real-time control systems,” Proc. Real-Time Sysi. Symp., 1985, pp. 133-140.
18. J. W. Wensley, L. Lamport, J. Goldberg, M. Green, K.N. Levitt, P. M. Melliar-Smith, R. E. Shostak, and C. B. Weinstock, “SIFT: Design and analysis of a fault-tolerant computer for aircraft control,” Proc. IEEE, vol. 66, no. 11, pp. 12W1255, Nov. 1978.
19. J.M. Wozencraft and I.M. Jacobs, Principles of Communication Engineering. New York Wiley, 1987.