A taxonomy of distributed termination detection algorithms

Journal of Systems and Software

Volumn 43, Issue 3, 1998, Pages 207-221

  Matocha, Jeff ^a   Camp, Tracy ^a  

^a Department of Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; TOPOLOGY;

DISTRIBUTED TERMINATION DETECTION ALGORITHMS; PROCESS KNOWLEDGE; TAXONOMY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032204577     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(98)10034-1     Document Type: Article

References (45)

1. Arora, R.K., Sharma, N.K., 1983. A methodology to solve the distributed termination problem. Inform. Systems 8 (1), 37-39.
2. Chandrasekaran, S., Venkatesan, S., 1990. A message-optimal algorithm for distributed termination detection. Journal of Parallel and Distributed Computing 8, 245-252.
3. Chandy, K.M., Lamport, L., 1985. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Systems 3 (1), 63-75.
4. Chandy, K.M., Misra, J., 1985. A paradigm for detecting quiescent properties in distributed computations. In: Apt, K.R. (Ed.), Logics and Models of Concurrent Systems. Springer, New York.
5. Chandy, K.M., Misra, J., 1986a. An example of stepwise refinement of distributed programs: Quiescence detection. ACM Trans. Programming Languages and Systems 8 (3), 326-343.
6. Chandy, K.M., Misra, J., 1986b. How processes learn. Distributed Computing 1 (1), 40-52.
7. Cohen, S., Lehmann, D., 1983. Dynamic systems and their distributed termination. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 29-33.
8. Cormen, T.H., Leiserson, C.E., Rivest, R.L., 1990. Introduction to Algorithms. McGraw-Hill, New York.
9. Dijkstra, E.W., Feijen, W.H.J., van Gasteren, A.J.M., 1983. Derivation of a termination detection algorithm for distributed computations. Inform. Process. Lett. 16 (5), 217-219.
10. Dijkstra, E.W., Scholten, C.S., 1980. Termination detection for diffusing computations. Inform. Process. Lett. 11 (1), 1-4.
11. Fischer, M.J., Lynch, N.A., Paterson, M.S., 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32 (2), 374.
12. Francez, N., 1980. Distributed termination. ACM Trans. Programming Languages and Systems 2 (1), 42-55.
13. Francez, N., Rodeh, M., 1982. Achieving distributed termination without freezing. IEEE Trans. Software Eng. 8 (3), 287-292.
14. Francez, N., Rodeh, M., Sintzoff, M., 1981. Distributed termination with interval assertions. In: Formalization of Programming Concepts, Lecture Notes in Computer Science, vol. 107. Springer, New York.
15. Haldar, S., Subramanian, D.K., 1988. Ring based termination detection algorithm for distributed computations. Inform. Process. Lett. 29 (3), 149-153.
16. Hazari, C., Zedan, H., 1987. A distributed algorithm for distributed termination. Inform. Process. Lett. 25 (5), 293-297.
17. Hoare, C.A.R., 1978. Communicating sequential processes. Commun. ACM 21 (8), 666-677.
18. Huang, S., 1988. A fully distributed termination detection scheme. Inform. Process. Lett. 29 (1), 13-18.
19. Huang, S., 1989. Detecting termination of distributed computations by external agents. In: IEEE Nineth International Conference on Distributed Computer Systems, pp. 79-84.
20. Koo, R., Toueg, S., 1988. Effects of message loss on the termination of distributed protocols. Inform. Process. Lett. 27 (4), 181-188.
21. Kumar, D., 1985. A class of termination detection algorithms for distributed computations. In: Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 73-100.
22. Lai, T., 1986. Termination detection for dynamically distributed systems with non-first-in-first-out communication. Journal of Parallel and Distributed Computing 3, 577-599.
23. Lai, T., Tseng, Y., and Dong, X., 1992. A more efficient message-optimal algorithm for distributed termination detection. In: Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, pp. 274-281.
24. Lai, T., Wu, L., 1995. An (n - 1)-resilient algorithm for distributed termination detection. IEEE Trans. Parallel and Distributed Systems 6 (1), 63-78.
25. Lamport, L., 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21 (7), 558-565.
26. Lamport, L., Shostak, R., Pease, M., 1982. The Byzantine generals problem. ACM Trans. Programming Languages and Systems 4 (3), 382-401.
27. Mattern, F., 1987a. Algorithms for distributed temination detection. Distributed Computing 2 (4), 161-175.
28. Mattern, F., 1987b. Experience with a new distributed termination detection algorithm. In: Proceedings of the Second International Workshop on Distributed Algorithms, pp. 127-143.
29. Mattern, F., 1989. Global quiescence detection based on credit distribution and recovery. Inform. Process. Lett. 30 (4), 195-200.
30. Mayo, J., Kearns, P., 1994. Distributed termination detection with roughly synchronized clocks. Inform. Process. Lett. 52 (2), 105-108.
31. Misra, J., 1983. Detecting termination of distributed computations using markers. In: Proceedings of The Second Annual ACM Symposium on Principles of Distributed Computing, pp. 290-294.
32. Misra, J., Chandy, K.M., 1982. Termination detection of diffusing computations in communicating sequential processes. ACM Trans. Programming Languages and Systems 4 (1), 37-43.
33. Muller, H., 1987. High level petri nets and distributed termination. In: Concurrency and Nets: Advances in Petri Nets. Springer, New York.
34. Rana, S.P., 1983. A distributed solution to the distributed termination problem. Inform. Process. Lett. 17 (1), 43-46.
35. Rokusawa, K., Iciyoshi, N., Chikayama, T., Nakashima, H., 1988. An efficient termination detection and abortion algorithm for distributed processing systems. In: Proceedings of the International Conference on Parallel Processing, pp. 18-22.
36. Sanders, B.A., 1987. A method for the construction of probe-based termination detection algorithms. In: Proceedings of IFIP Conference on Distributed Processing, 1987, pp. 249-257.
37. Shavit, N., Francez, N., 1986. A new approach to the detection of locally indicative stability. In: Kott, L. (Ed.), International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 226. Springer, New York, pp. 344-358.
38. Skyum, S., Eriksen, O., 1986. Symmetric distributed termination. In: The Book of L. Springer, New York.
39. Szymanski, B., Shi, Y., Prywes, N.S., 1985a. Terminating iterative solution of simultaneous equations in distributed message passing systems. In: Proceedings of the Fourth Annual ACM Symposium on the Principles of Distributed Computing, pp. 287-292.
40. Szymanski, B., Shi, Y., Prywes, N.S., 1985b. Synchronized distributed termination. IEEE Trans. Software Eng. 11 (10), 1136-1140.
41. Tel, G., 1994. Introduction to Distributed Algorithms. Cambridge Univ. Press, Cambridge, pp. 264-302.
42. Topor, R.W., 1984. Termination detection for distributed computations. Inform. Process. Lett. 18 (1), 33-36.
43. Tseng, Y., 1995. Detecting termination by weight-throwing in a faulty distributed system. Journal of Parallel and Distributed Computing 25, 7-15.
44. Venkatesan, S., 1989. Reliable protocols for distributed termination detection. IEEE Trans. Reliability 38 (1), 103-110.
45. Ye, X., Keane, J.A., 1991. A distributed termination detection scheme, Tech. Rep. UMCS-91-3-1, University of Manchester, Manchester, England.