This Article 
 Bibliographic References 
 Add to: 
Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers
May 1996 (vol. 7 no. 5)
pp. 537-544

Abstract—We propose a simple algorithm which is based on edge-coloring of system graphs for termination detection of loosely synchronous computations. The proposed algorithm is fully symmetric in that all processors run syntactically identical code and can detect global termination at the same time. Under the 1-port communication model, the algorithm is optimal in terms of termination delay, the difference between the time when a global termination occurs and the time it is detected, in a number of structures—chain, ring of even number of nodes, k-ary n-cube and k-ary n-mesh of low degree, where k is even; and near-optimal for other cases. The optimality analysis is based on results from a related problem, periodic gossiping in edge-colored graphs. This algorithm has been applied to some practical cases in which the overhead due to its execution is found to be insignificant.

[1] S. Chandrasekaran and S. Venkatesan, "A Message-Optimal Algorithm for Distributed Termination Detection," J. Parallel and Distributed Computing, vol. 8, pp. 245-252, 1990.
[2] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[3] A.M. Farley and A. Proskurowski, "Gossiping in Grid Graphs," J. Combinatorics, Information, and System Sciences, vol. 5, no. 2, pp. 161-172, 1980.
[4] S. Fiorini and R.J. Wilson, "Edge-Coloring of Graphs," Selected Topics in Graph Theory, L.W. Beineke and R.J. Wilson, eds., Academic Press, 1978.
[5] G. Fox,M. Johnson,G. Lyzenga,S. Otto,J. Salmon,, and D. Walker,Solving Problems on Concurrent Processors, Vol. I: General Techniques andRegular Problems.Englewood Cliffs, N.J.: Prentice Hall 1988.
[6] N. Francez, "Distributed Termination," ACM Trans. Programming Languages and Systems, vol. 2, pp. 42-45, Jan. 1980.
[7] N. Francez and M. Rodeh, "Achieving Distributed Termination without Freezing," IEEE Trans. Software Engineering, vol. 8, no. 3, pp. 287-292, 1982.
[8] C. Hazari and H. Zedan, "A Distributed Algorithm for Distributed Termination," Information Processing Letters, vol. 24, pp. 293-297, 1987.
[9] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319-349, 1988.
[10] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[11] T.-H. Lai, "Termination Detection for Dynamic Distributed Systems with Non-First-In-First-Out Communications," J. Parallel and Distributed Computing, vol. 3, pp. 577-599, 1986.
[12] A. Liestman and D. Richards, "Network Communication in Edge-Colored Graphs: Gossiping," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 438-445, Apr. 1993.
[13] F. Mattern, "Asynchronous Distributed Termination: Parallel and Symmetric Solutions with Echo Algorithms," Algorithmica, pp. 325-340, May 1990.
[14] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[15] S.P. Rana, "A Distributed Solution of the Distribution Termination Problem," Information Processing Letters, vol. 17, pp. 43-46, 1983.
[16] S. Rönn and H. Saikkonen, "Distributed Termination Detection with Counters," Information Processing Letters, vol. 34, pp. 223-227, 1990.
[17] S. Skyum and O. Eriksen, "Symmetric Distributed Termination," The Book of L, G. Rozenberg and A. Salomaa, eds., pp. 427-430, Springer-Verlag, 1986.
[18] B. Szymanski, Y. Shi, and S. Prywes, "Synchronized Distributed Termination," IEEE Trans. Software Engineering, vol. 11, no. 10, pp. 1,136-1,140, Oct. 1985.
[19] R.W. Topor, "Termination Detection for Distributed Computations," Information Processing Letters, vol. 18, no. 1, pp. 33-36, 1984.
[20] L.G. Valiant, “A Bridging Model for Parallel Computation,” Comm. ACM, vol. 33, no. 8, pp. 103-111, Aug. 1990.
[21] C.-Z. Xu and F.C.M. Lau, "Distributed Termination Detection of Loosely Synchronized Computations," Proc. Fourth IEEE Symp. Parallel and Distributed Processing, pp. 196-203, Dec. 1992.
[22] C.-Z. Xu and F.C.M. Lau, "Decentralized Remapping of Data Parallel Computations with the Generalized Dimension Exchange Method," Proc. 1994 Scalable High Performance Computing Conf., pp. 414-421, May 1994.
[23] C.-Z. Xu and F.C.M. Lau, "The Generalized Dimension Exchange Method for Load Balancing in k-ary n-cubes and Variants," J. Parallel and Distributed Computing, vol. 24, no. 1, pp. 72-85, Jan. 1995.
[24] C.-Z. Xu, B. Monien, R. Lüling, and F.C.M. Lau, "Nearest-Neighbor Algorithms for Load-balancing in Parallel Computers," Concurrency: Practice and Experience, vol. 7, no. 7, pp. 707-736, Oct. 1995.

Index Terms:
Data parallelism, distributed algorithms, interconnection networks, multicomputers, parallel and distributed systems, synchronous computations, termination detection.
Chengzhong Xu, Francis C.M. Lau, "Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 5, pp. 537-544, May 1996, doi:10.1109/71.503778
Usage of this product signifies your acceptance of the Terms of Use.