Skip to main content

Building a global time on parallel machines

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 392))

Abstract

This paper presents a pragmatic algorithm to build a global time on any distributed system, which is optimal for homogeneous parallel machines. After some discution on time, clocks and distributed systems, we survey and criticize the classical approaches based on clock synchronisation techniques. Satisfying better our purposes, a statistical method is chosen as a building block to derive an original algorithm valid for any topology. This algorithm is particularly well suited for distributed algorithm experimentation purposes because, after an acquisition phasis, it induces neither CPU nor message overhead. We provide in the conclusion some data about its behavior and performances on some parallel machines.

This work has been partially supported by the French program on parallelism of the CNRS/C 3, and within the ADP research team of the IRISA laboratory.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. T. Cheung. Graph traversal techniques and the maximum flow problem in distributed computing. IEEE Trans. on SE, SE-9(4):504–512, 1983.

    Google Scholar 

  2. F. Cristian, H. Aghili, and R. Strong. Clock synchronization in the presence of omission and performance faults, and processors joins. In Proc. of 16th IEEE Symposium on Fault-Tolerant Computing Systems, Vienna, pages 218–223, July 1986.

    Google Scholar 

  3. D. Dolev, J.Y. Halpern, and R. Strong. On the possibility and impossibility of achieving clock synchronization. In Proc. of 16th ACM Symposium on Theory of Computing, pages 504–511, April 1984.

    Google Scholar 

  4. A. Duda, G. Harrus, Y. Haddad, and G. Bernard. Estimating global time in distributed system. In Proc. 7th Int. Conf. on Distributed Computing Systems, Berlin, 1987.

    Google Scholar 

  5. C.E Ellingson and R.J. Kulpinski. Dissemination of system time. IEEE Transactions on Communications, COM-21(5):605–623, May 1973.

    Google Scholar 

  6. R. Gusella and S. Zatti. A network time controler for a distributed berkeley UNIX system. IEEE Distr. Proc. Tech. Comm. Newsletter, SI-2(6):7–15, June 1984.

    Google Scholar 

  7. Y. Haddad. Performance dans les systèmes répartis: des outils pour les mesures. Thèse de Doctorat, Univ. Paris-Sud, Centre Orsay, PARIS, Septembre 1988.

    Google Scholar 

  8. J.Y. Halpern, B. Simons, R. Strong, and D. Dolev. Fault-tolerant clock synchronization. In Proc. of the Third ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, pages 89–102, August 1984.

    Google Scholar 

  9. C. Jard and J.-M. Jézéquel. A multi-processor Estelle to C compiler to experiment distributed algorithms on parallel machines. In Proc. of the 9th IFIP International Workshop on Protocol Specification, Testing, and Verification, University of Twente, The Netherlands, North Holland, 1989.

    Google Scholar 

  10. H. Kopetz. Accuracy of time measurement in distributed real time systems. In 5th Symposium on Reliability in Distributed Software and Database Systems, pages 35–41, IEEE Comp. Society, 1986.

    Google Scholar 

  11. H. Kopetz and W. Ochsenreiter. Clock synchronization in distributed real time systems. In IEEE Transaction on Computers, Special issue on Real Time Systems, pages 933–940, August 1987.

    Google Scholar 

  12. C.M. Krishna and K.G. Shin. Synchronization and fault-masking in redundant real time systems. In Proc. of the FTCS 14, IEEE Press, pages 151–157, 1984.

    Google Scholar 

  13. L. Lamport, Time, clocks and the ordering of events in a distributed system. Communications. of the ACM, 21(7):558–565, July 1978.

    Google Scholar 

  14. L. Lamport and P.M. Melliar-Smith. Synchronizing clocks in the presence of faults. Journal of the ACM, 32(1):52–78, Juanary 1985.

    Article  Google Scholar 

  15. J. Lundelius and N. Lynch. A new fault-tolerant algorithm for clock synchronization. In Proc. of the Third ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, pages 75–88, August 1984.

    Google Scholar 

  16. K. Marzullo and S. Owiki. Maintaining time in a distributed system. In ACM Operating Systems Rev., pages 44–54, 1983.

    Google Scholar 

  17. F.B. Schneider. A paradigm for reliable clock synchronization. In Proc. Advanced Seminar Real Time Local Area Network, pages 85–104, April 1986.

    Google Scholar 

  18. B. Simons, J. Lundelius, and N. Lynch. An Overview of Clock Synchronization. Technical Report, IBM Research Division, October 1988.

    Google Scholar 

  19. T.K. Srikanth and S. Toueg. Optimal clock synchronization. In 4th Annual ACM Symposium on Principles of Distributed Computing, pages 71–86, August 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jean-Claude Bermond Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jezequel, JM. (1989). Building a global time on parallel machines. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-51687-5_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51687-3

  • Online ISBN: 978-3-540-46750-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics