Abstract: 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).
Publication Year: 1985
Publication Date: 1985-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 33
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot