Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers

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]  Heikki Saikkonen,et al.  Distributed Termination Detection with Counters , 1990, Inf. Process. Lett..

[2]  J DallyWilliam,et al.  Performance Analysis of k-ary n-cube Interconnection Networks , 1990 .

[3]  Rodney W. Topor,et al.  Termination Detection for Distributed Computations , 1984, Inf. Process. Lett..

[4]  Michael Rodeh,et al.  Achieving Distributed Termination without Freezing , 1982, IEEE Transactions on Software Engineering.

[5]  Boleslaw K. Szymanski,et al.  Synchronized Distributed Termination , 1985, IEEE Transactions on Software Engineering.

[6]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[7]  Nissim Francez,et al.  Distributed Termination , 1980, TOPL.

[8]  F.C.M. Lau,et al.  Decentralized remapping of data parallel computations with the generalized dimension exchange method , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[9]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[10]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[11]  Subbarayan Venkatesan,et al.  A Message-Optimal Algorithm for Distributed Termination Detection , 1990, J. Parallel Distributed Comput..

[12]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[13]  S. P. Rana,et al.  A Distributed Solution of the Distributed Termination Problem , 1983, Inf. Process. Lett..

[14]  Francis C. M. Lau,et al.  Distributed termination detection of loosely synchronized computations , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[15]  Francis C. M. Lau,et al.  The Generalized Dimension Exchange Method for Load Balancing in k-ary n Cubes and Variants , 1995, J. Parallel Distributed Comput..

[16]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[17]  Dana S. Richards,et al.  Network Communication in Edge-Colored Graphs: Gossiping , 1993, IEEE Trans. Parallel Distributed Syst..

[18]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[19]  Sven Skyum,et al.  Symmetric Distributed Termination , 1985 .

[20]  Hussein Zedan,et al.  A Distributed Algorithm for Distributed Termination , 1987, Inf. Process. Lett..

[21]  Ten-Hwang Lai,et al.  Termination Detection for Dynamically Distributed Systems with Non-first-in-first-out Communication , 1986, J. Parallel Distributed Comput..

[22]  Francis C. M. Lau,et al.  Nearest-neighbor algorithms for load-balancing in parallel computers , 1995, Concurr. Pract. Exp..