Observing global states of asynchronous distributed applications

  • Jean-Michel Helary
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 392)


Observing global states of an asynchronous distributed application is a difficult task due to arbitrary messages transfer delays. Notion of global states and some of their properties — consistency, being transitless — are precisely stated, and the problem, in both FIFO and non FIFO communication models, is solved in a progressive way : local synchronization allows neighbour processes to record mutually consistent local states, then a sequence of consistent global states is obtained by composition with global wave synchronization; computing some functions over consistent global states becomes easier and an example is displayed (number of messages in transit). Solution generalizes and improves known results, both in FIFO (relaxation of synchronization constraints) and non FIFO (absence of message storing) situations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CL85]
    K. M. Chandy and L. Lamport. Distributed snapshots: determining global states of distributed systems. ACM TOCS, 63–75, February 1985.Google Scholar
  2. [CM86]
    K. M. Chandy and J. Misra. An example of stepwise refinement of distributed programs: quiescence detection. ACM TOPLAS, 8(3), July 1986.Google Scholar
  3. [CM88]
    K. M. Chandy and J. Misra. Parallel program design: a foundation. Addison-Wesley, 1988.Google Scholar
  4. [FGL82]
    M. J. Fischer, N. D. Griffeth, and N. Lynch. Global states of a distributed system. IEEE trans. on soft. eng., SE-8:3:198–202, may 1982.Google Scholar
  5. [HJPR87]
    J.-M. Hélary, C. Jard, N. Plouzeau, and M. Raynal. Detection of stable properties in distributed applications. 6th ACM SIGACT-SIGOPS, Symp. Principles of Distributed Computing, Vancouver, Canada, 125–136, August 1987.Google Scholar
  6. [HPR89]
    J.M. Hélary, N. Plouzeau, and M. Raynal. A characterization of a particular class of distributed snapshots. In Submitted to International Conference on Computing and Information (ICCI'89), Toronto, may 23–27 1989.Google Scholar
  7. [HR88a]
    J.M. Hélary and M. Raynal. Les parcours distribués de réseaux: un outil pour la conception de protocoles. In R. Castanet et O. Rafiq, editor, CFIP'88 Ingénierie des protocoles, pages 159–170, Eyrolles, 1988.Google Scholar
  8. [HR88b]
    J.-M. Hélary and M. Raynal. Synchronisation et contrôle des systèmes et des programmes répartis. Eyrolles, Septembre 1988. English translation to appear, Wiley, 1990.Google Scholar
  9. [HR89]
    J.-M. Hélary and M. Raynal. An abstract distributed iteration scheme: application to the computation of weighted shortest paths. Technology and Science of Informatics, Vol. 7, No. 3, May 1989. (In French).Google Scholar
  10. [Lam78]
    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
  11. [LY87]
    T.H. Lai and T.H. Yang. On distributed snapshots. Inf. Proc. Letters, 25:153–158, 1987.MathSciNetGoogle Scholar
  12. [Mat89]
    F. Mattern. Virtual time and global states of distributed systems. In Cosnard, Quinton, Raynal, and Robert, editors, Proc. Int. Workshop on Parallel and Distributed Algorithms, Bonas, France, oct. 1988, North Holland, 1989.Google Scholar
  13. [Mor85]
    C. Morgan. Global and logical time in distributed algorithms. Inf. Proc. Letters, 20:290–294, 1985.Google Scholar
  14. [Sch85]
    F. B. Schneider. Paradigms for distributed programs. In Distributed Systems, pages 431–480, Springer Verlag, 1985. LNCS 190.Google Scholar
  15. [Tay89]
    K. Taylor. The role of inhibition in asynchronous consistent-cut protocols. these proceedings.Google Scholar
  16. [Tel86]
    G. Tel. Distributed Infimum Approximation. Tech. report RUU-CS-86-12, University of Utrecht, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Jean-Michel Helary
    • 1
  1. 1.IRISA-IFSIC - Campus de BeaulieuRennes Cedex

Personalised recommendations