Abstract
Detecting termination of a program is an important task in distributed computing systems. Wedescribe a method for detecting distributed termination, called SP - termination, whichhas certain advantages over the known methods: shorter time delays, better distribution of control messages over the communication network, suitability for concurrent job processing, higher reliability. This approach provides also an improvement for dynamic distributed systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., 1986, Corectness proofs of distributed termination algorithms, ACM TOPLAS 8: 388–405.
Cohen S., and Lehmann, D., 1982, Dynamic systems and their distributed termination, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, Ottawa, 29–33.
Dijkstra, E.W., Feijen, W.H.J., and van Gasteren, A.J.M., 1983, Derivation of a termination detection algorithm for distributed computations, Information Processing Letters 16: 217–219.
Francez, N., 1980, Distributed termination, ACM TOPLAS 2:42–55.
Francez N., and Rodeh, M., 1982, Achieving distributed termination without freezing, IEEE Trans, on Software Engineering, SE-8: 287–292.
Gallaire H., Minker J., and Nicolas, J.-M., 1984, Logic and databases: a deductive approach, ACM Computing Surveys, 16: 153–186.
Hoare, C.A.R., 1978, Communicating sequential processes, Comm. ACM 21: 666–677.
Lozinskii, E.L., 1986, A problem-oriented inferential database system, ACM TODS 11: 323–356.
Misra, J., 1983, Detecting termination of distributed computations using markers, Proc. 2nd Annual ACM Symp. on Principles of Distributed Computing, Montreal, 290–294.
Rana, S.R, 1983, A distributed solution of the distributed termination problem, Information Processing Letters 17: 43–46.
Richier, J.L., 1984, Distributed termination in CSP: symmetric solutions with minimal storage, TR 84-49, Universite P. et M. Curie, Paris.
Topor, R.W., 1984, Termination detection for distributed computations, Information Processing Letters, 18: 33–36.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lozinskii, E.L. (1992). An Efficient Distributed Termination. In: Baeza-Yates, R., Manber, U. (eds) Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3422-8_28
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3422-8_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6513-6
Online ISBN: 978-1-4615-3422-8
eBook Packages: Springer Book Archive