Abstract
We define a model to describe the global running of a network of processes, as well as termination detection. We find algorithms required to be super-imposed on the system without disturbing the underlying computation. In the case of asynchronous protocols, we prove that the complexity of termination detection is equal to the number of messages of the initial computation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
K.R. APT Correctness proofs of distributed termination algorithms. Tech. Report. 84-51. LITP — Université Paris VII, 1984.
K. APT — J.L. RICHIER Real time clocks versus virtual clocks. T.R. 84-34. LITP — Université Paris.
L. BOUGE Symetric election in CSP. T.R. 84-31. LITP — Université Paris.
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.
E.W. DIJKSTRA — C.S. SCHOLTEN Termination detection for diffusing computations. Inf. Proc. Letters 11,1 (1980) 1–4.
D. DOLEV — C. DWORK — L. STOCKMEYER On the minimal synchronism needed for distributed consensus. Proc. 24th IEEE 1983 — Symp. on found of Comput. Sc. p. 393–402.
D. FERMENT — B. ROZOY Possibility and impossibility of solutions for the distributed termination problem. TR 86-8 — LITP — Université Paris VII.
N. FRANCEZ Distributed termination. ACM — Toplas, 2,1 — pp. 42–45, 1980.
N. FRANCEZ — M. RODEH Achieving distributed termination without freezing. IEEE — Trans. on software Engeneering, SE — 8,3 pp. 287–292, 1982.
P. GASTIN Synchronisation d'un système asynchrone d'automates. T.R. 1986 — LITP — Université Paris VII.
M. GOUDA Distributed state exploration for protocol validation. T.R. 185 — Dpt of Comput. Sc. Univ. of Texas at Austin — 1981.
M.G. GOUDA — L.E. ROSIER Priority networks of communicating finite state machines. TR 83-10. University of Texas at Austin or ICALP 1984 — Lect. Notes in Comp. Sc. 172, pp. 209–221.
M.G. GOUDA — E.M. GURARI T.H. LAI — L.E. ROSIER Deadlock detection in systems of communicating finite state machines. TR — University of Texas at Austin.
C.W. LERMEN — F.B. SCHNEIDER Detecting distributed termination when processors can fail. T.R. 80–449 — Cornell. University — New York.
J. MISRA Detecting termination of distributed computations using markers. Proc. 2 Annual Symp. on Princ. of distr. Comput. Quebec, pp. 290–294, 1983.
S.P. RANA A distributed solution of the distributed termination problem. Inf. Process. Letters, 17.1, 1983, pp. 43–46.
J.L. RICHIER Distributed termination in CSP. Symetric solutions with minimal storage. TR. 84–89 — LITP — Univ. Paris VII.
B. ROZOY Detection de la terminiaison dans les réseaux distribués. TR. 1986 — Université de Paris VII — LITP —
R. TOPOR Detecting termination for distributed computation. Inf. Proc. Lett. 18, 1984 — pp. 33–36.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rozoy, B. (1986). Model and complexity of termination for distributed computations. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016283
Download citation
DOI: https://doi.org/10.1007/BFb0016283
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive