An efficient algorithm for quiescence detection in a distributed system

  • Satyendra P. Rana
Distributed Computing And Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 497)


A message-efficient quiescence detection algorithm is presented that does not employ a pre-defined ring or tree structure among processes.


quiescence detection distributed algorithms asynchronous communication 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1].
    Mattern, F., “Algorithms for distributed termination detection”, Distributed Computing, 2, pp. 161–175 (1987).CrossRefGoogle Scholar
  2. [2].
    Sharma, M. B., Iyengar, S. S., and Mandyam, N.K., “An efficient distributed depth first search algorithm”, Information Processing Letters, 32, pp. 183–186 (1989).MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Satyendra P. Rana
    • 1
  1. 1.Department of Computer ScienceWayne State UniversityDetroit

Personalised recommendations