Synchronized Distributed Termination
IEEE Transactions on Software Engineering
A distributed algorithm for distributed termination
Information Processing Letters
Termination detection for dynamically distributed systems with non-first-in-first-out communication
Journal of Parallel and Distributed Computing
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
A message-optimal algorithm for distributed termination detection
Journal of Parallel and Distributed Computing
A bridging model for parallel computation
Communications of the ACM
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Distributed termination detection with counters
Information Processing Letters
The generalized dimension exchange method for load balancing in k-ary n-cubes and variants
Journal of Parallel and Distributed Computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Network Communication in Edge-Colored Graphs: Gossiping
IEEE Transactions on Parallel and Distributed Systems
Termination detection in data-driven parallel computations/applications
Journal of Parallel and Distributed Computing
Tiered Algorithm for Distributed Process Quiescence and Termination Detection
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
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.