Distributed infimum approximation

  • Gerard Tel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Distributed Infimum Approximation (DIA) is defined as an abstraction of several interesting problems in the field of distributed computing. Global Virtual Time approximation as well as Distributed Termination Detection are special cases of DIA, as will be argued. Three solutions to the DIA problem are given for synchronous, for bidirectional and for FIFO communication.

Keywords and phrases

Distributed algorithms wave algorithms Distributed Termination Global Virtual Time 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [BMR85]
    Beilken, C., F. Mattern, and M. Reinfrank, Verteilte Terminierung — ein Wesentlicher Aspekt der Kontrolle in verteilten Systemen, Bericht nr 41/85, Fachbereich Informatik SFB 124, University of Kaiserslauten, Kaiserslauten, West Germany, 1985.Google Scholar
  2. [CM85]
    Chandy, K.M., and J. Misra, A paradigm for detecting quiescent properties in distributed computations, Report TR-85-02, University of Texas at Austin, Austin, Texas.Google Scholar
  3. [Fr80]
    Francez, N., Distributed termination, ACM ToPLaS 2 (1980), 42–55Google Scholar
  4. [HMR86]
    Helary, J-M, A. Maddi, M. Raynal, Controlling knowledge transfers in distributed algorithms, application to deadlock detection, Publication Interne 278, IRISA, Rennes, France.Google Scholar
  5. [Hu85]
    Hughes, J., A distributed garbage collection algorithm, in: J.P. Jouannoud (ed), Functional programming languages and computer architecture, Lecture Notes in Computer Science vol. 201, Springer Verlag, Heidelberg, 1985, pp. 256–272.Google Scholar
  6. [Je85]
    Jefferson, D., Virtual Time, ACM ToPLaS 7 (1985), 404–425.Google Scholar
  7. [Ra83]
    Rana, S.P., A distributed solution to the distributed termination problem, Inf. Proc. Lett. 17 (1983), 43–46.Google Scholar
  8. [Te86]
    Tel, G., Distributed infimum approximation, Techn. Rep. RUU-CS-86-12, Dept. of Comp. Sc., Univ. of Utrecht, Utrecht, the Netherlands, 1986.Google Scholar
  9. [Te87]
    Tel, G., Fail-safe directed network protocols, unpublished notes.Google Scholar
  10. [TL86]
    Tan, R.B., and J. van Leeuwen, General Symmetric Distributed Termination Detection, Report RUU-CS-86-2, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands (submitted to Computers and Artificial Intelligence).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Gerard Tel
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtThe Netherlands

Personalised recommendations