Synchronized Distributed Termination

Authors:
Boleslaw Szymanski;Yuan Shi;Noah S. Prywes
Affiliations:
Rensselaer Polytechnic Institute, Troy, NY;Temple Univ., Philadelphia, PA;Univ. of Pennsylvania, Philadelphia, PA
Venue:
IEEE Transactions on Software Engineering
Year:
1985

Citing 0
Cited 10

On Fault-Tolerant Structure, Distributed Fault-Diagnosis, Reconfiguration, and Recovery of the Array Processors

IEEE Transactions on Computers
Notes on termination of OCCAM processes

ACM SIGPLAN Notices
Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Genesis: a scalable distributed system for large-scale parallel network simulation

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
About the Termination Detection in the Asynchronous Message Passing Model

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Distributed termination of concurrent processes in Occam

Computer Languages
On snapshots and stable properties detection in anonymous fully distributed systems (extended abstract)

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Tuple switching network-When slower may be better

Journal of Parallel and Distributed Computing
Efficient distributed snapshots in an anonymous asynchronous message-passing system

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

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).