Issue No. 10 - October (1985 vol. 11)
B. Szymanski , Department of Computer Science, Rensselear Polytechnic Institute
An efficient decentralized algorithm for synchronized termination of a distributed computation is presented. It is assumed that distributed processes are connected via unidirectional channels into a strongly connected network, in which no central controller exists. The number of processes and the network configuration are not known a priori. The number of steps required to terminate distributed computation after all processes met their local termination conditions is proportional to the diameter D of the network (D + 1 steps).
termination detection, Decentralized algorithms, distributed programming, distributed systems, networks
N. Prywes, B. Szymanski and n. Yuan Shi, "Synchronized Distributed Termination," in IEEE Transactions on Software Engineering, vol. 11, no. , pp. 1136-1140, 1985.