Abstract
The termination detection problem of a distributed computation has gained considerable interest recently. In this paper two symmetric solutions to this problem are presented in the special case, where the distributed computation is performed by a ring of processes. We shall discuss the problem in terms of processes communicating via shared variables instead of messages.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. R. Apt and J. L. Richier,Real time clocks versus virtual clocks, in Proc. of the NAT→Advanced Study Institute on Control Flow and Data Flow:Concepts of Distributed Programming, ed. Broy, pp. 475–502, Springer-Verlag, 1985.
K. M. Chandy and L. Lamport,Distributed snaphots: determining global states of distributed systems, ACM TOCS, Vol. 3, No. 1, pp. 63–75, Feb. 1985.
E. W. Dijkstra,A Discipline of Programming. Prentice-Hall, 1976.
E. W. Dijkstra and C. S. Scholten,Termination detection for diffusing computations. Inf. Proc. Lett., vol. 11, pp. 1–4, Aug. 1980.
E. W. Dijkstra, F. W. J. Feijen and A. J. M. van Gasteren,Derivation of a termination detection algorithm for distributed computations. Inf. Proc. Lett., vol. 16, 217–219, June 1983.
N. Franzec and M. Rodeh,Achieving distributed termination without freezing. IEEE Trans. Soft. Eng., vol. 8, pp. 287–292, May 1982.
L. Lamport,An assertional correctness proof of a distributed algorithm. Science of Computer Programming, vol. 2, pp. 175–206, Dec. 1982.
S. Owicki and D. Gries,An axiomatic proof technique for parallel programs I. Acta Informatica, vol. 6, pp. 319–340, 1976.
J. Winkowski,Protocols of accessing overlapping sets of resources. Inf. Proc. Lett., vol. 12, pp. 239–243, Oct. 1981.