Skip to main content
SpringerLink
Log in

Solutions for the distributed termination problem

  • Communications
  • Conference paper
  • First Online:
Parallel Algorithms and Architectures

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

  • 130 Accesses

Abstract

Considering a network of communicating finite state machines which exchange messages over Channels, we discuss the distributed termination problem in the more general context of asynchronous environment. We first whow that this problem is undecidable. Then we discuss the possibility of superimposing algorithms that detect termination. At least we examine the case of faulty processors.

The 2 authors are also affilied to L.I.T.P., 2 place Jussieu, 75221 PARIS cedex 05 France.

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.

Bibliographie

  1. K.R. APT. — Correctness proofs of distributed termination algorithms. — Tech. Report. 84-51; L.I.T.P. — Université Paris VI, 1984.

    Google Scholar 

  2. K. APT, J.L. RICHIER. — Real time clocks versus virtual clocks. — T.R. 84-34, L.I.T.P. Université Paris VI, 1984.

    Google Scholar 

  3. L. BOUGE. — Symetric election in CSP. — T.R. 84-31. — L.I.T.P., Université Paris VI.

    Google Scholar 

  4. K.M. CHANDY, J. MISRA. — A paradigm for detecting quiescent properties in distributed computations. — In: Apt K.R. (ed.) Logics and Models of concurrent systems. Springer Verlag Berlin, 11: 325–341, 1985.

    Google Scholar 

  5. D. DOLEV, C. DWORK, L. STOCKMEYER. — On the minimal synchronism needed for distributed consensus. — Proc. 24th. IEEE 1983. — Symp. on found of Comput. Sc.: 393–402.

    Google Scholar 

  6. E.W. DIJKSTRA, W.H. FEIJEN, A.J.M. Van GASTEREN. — Derivation of a termination detection algorithm for distributed computations. — Inf. Proc. Letters 16,5 (1983): 217–219.

    Article  Google Scholar 

  7. E.W. DIJKSTRA, C.S. SCHOLTEN. — Termination detection for diffusing computations. — Inf. Proc. Letters 11, 1 (1980), 1–4.

    Article  Google Scholar 

  8. D. FERMENT. — Finite and not finite solutions for the distributed termination problem. — T.R. 86.11 — LITP, Université Paris, 1986.

    Google Scholar 

  9. N. FRANCEZ. — Distributed termination. — ACM, Toplas, 2, 1, pp. 42–45, 1980.

    Google Scholar 

  10. D. FERMENT, B. ROZOY. — Possibility and impossibility of solutions for the distributed termination problem. — TR 86-8. — LITP, University Paris, 1986.

    Google Scholar 

  11. N FRANCEZ, M. RODEH. — Achieving distributed termination without freezing. — IEEE — Trans. on software Engeniring, SE — 8, 3, pp. 287–292, 1982.

    Google Scholar 

  12. P. GASTIN. — Synchronisation d'un système asynchrone d'automates. — 1985. — T.R. LITP, Université Paris VII.

    Google Scholar 

  13. M. GOUDA. — Distributed state exploration for protocol validation. — T.R. 185. — Dpt. of Comput. Sc. Univ. of Texas at Austin. — 1981.

    Google Scholar 

  14. M.G. GOUDA, L.E. ROSIER. — Priority networks of communicating finite state machines. — T.R. 83-10 — University of Texas at Austin OR SIAM Journal Computer, 14.3, 1985, pp. 569–584.

    Google Scholar 

  15. M.G. GOUDA, E.M. GURARI, T.H. LAI, L.E. ROSIER. — Deadlock detection in systems of communicating finite state machines.

    Google Scholar 

  16. C.W. LERMEN, F.B. SCHNEIDER. — Detecting distributed termination when processors can fail. — T.R. 80-449 — Cornell. University — NY.

    Google Scholar 

  17. F. MATTERN. — New algorithms for distributed termination detection in asynchronous message passing systems. — T.R. 42/85, SFB 124, University of Kaiserslautern, 1985.

    Google Scholar 

  18. J. MISRA. — Detecting termination of distributed computations using markers. — Proc. 2 annual Symp. on Princ. of dist. Comp. QUEBEC, p. 290–294, 1983.

    Google Scholar 

  19. S.P. RANA. — A distributed solution of the distributed termination problem. — Inf. Process letters, 17.1, 1983, pp. 43–46.

    Google Scholar 

  20. J.L. RICHIER. — Distributed termination in CSP. — Symetric solutions with minimal storage. — TR 84-49, LITP, Université Paris VII.

    Google Scholar 

  21. B. ROZOY. — (1) Model and complexity of termination detection for distributed computations. — Lect. Notes in Comput. Sc. 233, 1986, p. 564–572.

    Google Scholar 

  22. (2) Termination for distributed systems: model and cost. — To be published in: Computer and Artificial Intelligence, Slovak academy of Science, 1987.

    Google Scholar 

  23. R. TOPOR. — Detecting termination for distributed computation. — Inf. Proc. Lett. 18 (1984), 33–36.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U.F.R. Maths & Informatique, Université de Picardie, 33, rue St Leu, 80039, Amiens

    Didier Ferment

  2. Labo. Informatique — Université — Esplanade de la Paix, 14032, Caen

    Brigitte Rozoy

Authors
  1. Didier Ferment
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brigitte Rozoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Albrecht Hermann Jung Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferment, D., Rozoy, B. (1987). Solutions for the distributed termination problem. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-18099-0_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18099-9

  • Online ISBN: 978-3-540-47760-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation