An efficient algorithm for quiescence detection in a distributed system
Part of the Lecture Notes in Computer Science book series (LNCS, volume 497)
Distributed Computing And Systems
A message-efficient quiescence detection algorithm is presented that does not employ a pre-defined ring or tree structure among processes.
Keywordsquiescence detection distributed algorithms asynchronous communication
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1991