Skip to main content
Springer Nature Link
Log in

Experience with a new distributed termination detection algorithm

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1987)

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

Included in the following conference series:

Abstract

A termination detection algorithm for a general model of distributed computations where processes communicate over asynchronous non-FIFO channels is presented. It has O(mn) message complexity if the control network is a ring, a (spanning) tree, or a general undirected graph and O(m) message complexity on star networks and complete networks. Several variants of the basic principle are discussed, one of which is a symmetric version where any process can start the algorithm independently from the other processes. Preliminary experimental results show that far less control messages than indicated by the worst case behavior are usually generated. In a distributed puzzle-solving system used as a test application only about √m control messages have been counted. The constraint based puzzle-solving method is explained and several test cases are reported.

This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the INCAS project (SFB124-D1). Electronic mail address: mattern@incas.UUCP or mattern%uklirb.uucp@Germany.csnet

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beilken C., Mattern F. (1986) Verteiltes Problemlősen am Beispiel von Zahlenrätseln — Ein Experiment mit CSSA. Technical Report SFB124-29/86, Department of Computer Science, University of Kaiserslautern, West-Germany

    Google Scholar 

  2. Beilken C., Mattern F., Reinfrank M. (1985) Verteïlte Terminierung — ein wesentlicher Aspekt der Kontrolle in verteilten Systemen. Technical Report SFB124-41/85, Department of Computer Science, University of Kaiserslautern, West-Germany

    Google Scholar 

  3. Chang E.J.H. (1982) Echo Algorithms: Depth Parallel Operations on General Graphs. IEEE Transactions on Software Engineering SE-8:4, pp. 391–401

    Google Scholar 

  4. Chandy K.M., Misra J. (1981) Asynchronous Distributed Simulation via a Sequence of Parallel Computations. Comm. of the ACM 24:4, pp. 198–205

    Article  Google Scholar 

  5. Chandy K.M., Misra J. (1986) How Processes Learn. Distributed Computing 1, pp. 40–52

    Article  Google Scholar 

  6. Dijkstra E.W., Scholten C.S. (1980) Termination Detection for Diffusing Computations. Information Processing Letters 11:1, pp. 1–4

    Article  Google Scholar 

  7. Eppstein D. (1987) On the NP-Completeness of Cryptarithms. ACM SIGACT News 18:3, pp. 38–40

    Article  Google Scholar 

  8. Francez N. (1980) Distributed Termination. ACM Trans. on Prog. Lang. and Sys. 2:1, pp. 42–55

    Article  Google Scholar 

  9. Francez N., Rodeh M. (1982) Achieving Distributed Termination without Freezing. IEEE Transactions on Software Engineering SE-8:3, pp. 287–292

    Google Scholar 

  10. Gafni E., Afek Y. (1984) Election and Traversal in Unidirectional Networks. Proc. of the 3rd Annual ACM Symposium on PODC, pp. 190–198

    Google Scholar 

  11. Hewitt C. (1977) Viewing Control Structures as Patterns of Passing Messages. Art. Intell. 8, pp. 323–364

    Article  Google Scholar 

  12. Helary J.-M., Maddi A., Plouzeau N., Raynal M. (1987) Parcours et apprentissage dans un reseau de processus communicants. Technique et Science Informatiques 6:2, pp. 127–139

    Google Scholar 

  13. Helary J.-M., Maddi A., Raynal M. (1986) Calcul distribue d'un extremum et du routage associe dans un reseau quelconque. Technical Report 516, INRIA, France

    Google Scholar 

  14. Kornfeld W.A. (1981) The Use of Parallelism to Implement a Heuristic Search. Proc. of the International Joint Conference on Artificial Intelligence, pp. 575–580

    Google Scholar 

  15. Kumar D. (1985) A Class of Termination Detection Algorithms for Distributed Computations. In: Maheshwari N. (ed) Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag, LNCS 206, pp. 73–100

    Google Scholar 

  16. Kutten S. (1987) Stepwise Construction of an Efficient Distributed Traversing Algorithm for General Strongly Connected Directed Graphs. Technical Report 431 (draft), Technion — Israel Institute of Technology, Computer Science Department, Haifa, Israel

    Google Scholar 

  17. Lai T.-H. (1986) Termination Detection for Dynamic Distributed Systems with Non-first-in-first-out Communication. Journal of Parallel and Distributed Computing 3, pp. 577–599

    Article  Google Scholar 

  18. Mattern F., Beilken C. (1985) The Distributed Programming Language CSSA — a Very Short Introduction. Technical Report 123/85, Department of Computer Science, University of Kaiserslautern, West-Germany

    Google Scholar 

  19. Mattern F. (1987) Algorithms for Distributed Termination Detection. Distributed Computing 2:4 (to appear)

    Google Scholar 

  20. Mattern F. (1987) Asynchronous Distributed Termination — Parallel and Symmetric Solutions with Echo Algorithms. Technical Report SFB124-21/87, Department of Computer Science, University of Kaiserslautern, West-Germany

    Google Scholar 

  21. Nehmer J., Haban D., Mattern F., Rombach D., Wybranietz D. (1987) Key Concepts of the INCAS Multicomputer Project. IEEE Transactions on Software Engineering SE-13:8, pp. 913–923

    Google Scholar 

  22. Segal A. (1983) Distributed Network Protocols. IEEE Transactions on Inforamtion Theory IT-29:1, pp. 23–35

    Article  Google Scholar 

  23. Shavit N., Francez N. (1986) A New Approach to Detection of Locally Indicative Stability. Technical Report RC 11925, IBM Th. J. Watson Research Center, Yorktown Heights, USA

    Google Scholar 

  24. Tan R.B., Van Leeuwen J. (1986) General Symmetric Distributed Termination Detection. Technical Report RUU-CS-86-2, Computer Science Department, University of Utrecht, Utrecht, The Netherlands

    Google Scholar 

  25. Tel G. (1987) Directed Network Protocols. In: Gafni E., Raynal M., Santoro N., van Leeuwen J., Zaks S. (eds) Proc. 2nd Int. Workshop on Distributed Algorithms, Springer-Verlag, LNCS

    Google Scholar 

  26. Topor R.W. (1984) Termination Detection for Distributed Computations. Information Processing Letters 18:1, pp. 33–36

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SFB124, University of Kaiserslautern, P.O. Box 3049, D 6750, Kaiserslautern, Federal Republic of Germany

    Friedemann Mattern

Authors
  1. Friedemann Mattern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mattern, F. (1988). Experience with a new distributed termination detection algorithm. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019800

Download citation

  • DOI: https://doi.org/10.1007/BFb0019800

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics