A new approach to detection of locally indicative stability

  • Nir Shavit
  • Nissim Francez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


A new approach to derivation of detection algorithms for stable properties in distributed systems, in cases where local indicators may be found, is presented. A local indicator is a local predicate, which, when holding, indicates that the current local state is a potential component of a stable global state. "Joint" local stability implies the global one. The approach is based on a new way of viewing the computation of a distributed program and yields a solution having several important advantages over known detection algorithms for locally indicative stable properties. Unlike the case in previous algorithms, symmetry of the solution is a natural byproduct of the derivation, and the price paid for it (in terms of message complexity, restrictions on the underlaying computation, need of global knowledge ...) is very low.


Detection Algorithm Global State Initiator Process Communication Graph Message Complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [AR 84]
    Apt, K.R. and Richier, J-L., Real time clocks versus virtual clocks, Tech. Rep. 83-84, L.I.T.P., Universite Paris 7, Paris, 1984.Google Scholar
  2. [B 84]
    Bouge, L. Repeated Synchronous Snapshots and their implementation in CSP, Tech. Rep. No. 84, L.I.T.P., Universite Paris 7, Paris, 1984.Google Scholar
  3. [B 85]
    Bouge, L. Symmetry and Genericity for CSP in distributed systems, Tech. Rep. No. 85-32, L.I.T.P., Universite Paris 7, Paris, May 1985.Google Scholar
  4. [CL 85]
    Chandy, K.M. and Lamport, L., Distributed Snapshots: Determining the global states of distributed systems, ACM Transactions on Computer Systems, vol. 4, no. 1, pp.63–75, February 1985.Google Scholar
  5. [CM 82]
    Chandy, K.M. and Misra, J., Termination Detection of Diffusing computations in Communicating sequential processes, ACM TOPLAS 4, pp. 37–42, 1982.Google Scholar
  6. [CM 85]
    Chandy, K.M. and Misra, J., A paradigm for detecting quiescent properties in distributed computations, Tech. Rep. 85-02, Dept. of Comp. Sci., Univ. of Texas, Austin, Jan 1985.Google Scholar
  7. [CLh 82]
    Cohen, S. and Lehmann, D. Dynamic systems and their distributed termination, Proc. Symp. on Principals of distributed Comp., Ottawa, pp. 29–33, 1982.Google Scholar
  8. [DFG 83]
    Dijkstra, E.W., Feijen, W.H. and van Gasteren, A.J.M., Derivation of a termination detection algorithm for distributed computations, Inform. Processing Letters 16, pp. 217–219, 1983.Google Scholar
  9. [DS 80]
    Dijkstra, E.W., and Scholten, C.S., Termination Detection for Diffusing Computations, Infor. Processing Letters 11, pp. 217–219, 1980.Google Scholar
  10. [ES 84]
    Eriksen O., Skyum S., Symmetric Distributed Termination, Computer Science Dept., Arhus Univ., Ny Munkegade, DK-8000, Aarhus C, Denmark, 1984.Google Scholar
  11. [F 80]
    Francez, N., Distributed Termination, ACM-TOPLAS, Vol. 2, No. 1, pp. 42–55, 1980.Google Scholar
  12. [FR 82]
    Francez, N. and Rodeh, M., Achieving Distributed Termination without Freezing, IEEE Trans. soft. Eng. SE-8, pp. 287–292, 1982.Google Scholar
  13. [FRS 81]
    Francez, N., Rodeh, M. and Sintzoff, M., Distributed Termination with Interval Assertions, Proc. Int. Colloc. Formalization of programming concepts, Peniscola, Spain, April 1981, Lecture Notes in Comp. Sci., Vol. 107, 1981.Google Scholar
  14. [H 78]
    Hoare, C.A.R., Communicating Sequential Processes, CACM 21, 8, pp. 666–677, 1978.Google Scholar
  15. [M 83]
    Misra, J., Detecting termination of distributed computations using markers, Proc. 2nd Ann. Symp. on principals of Distributed computing, Montreal, Quebec, Canada, pp. 290–294, 1983.Google Scholar
  16. [Mo 85]
    Morgan, C., Global and logical time in distributed systems, Infor. Processing Letters 20, pp. 189–194, 1985.Google Scholar
  17. [R 83]
    Rana, S.P., A distributed solution to the distributed termination problem, Infor. Processing Letters 17, pp. 43–46, 1983.Google Scholar
  18. [Ric 84]
    Richier, J-L., Distributed Termination In CSP — Symmetric solution with minimal storage., TR. 84-49, L.I.T.P., Universite Paris 7, Paris, 1984Google Scholar
  19. [SF 86]
    N. Shavit, N. Francez, A New Approach to Detection of Locally Indicative stability, Technion, Haifa, Israel, 1986.Google Scholar
  20. [SSP 85]
    Szymanski, B., Shi, Y., Prywes, N., Synchronized Distributed Termination, Preliminary version presented in Proc. Symp. on Principals of distributed Comp., Minacki, Canada, pp. 29–33, 1985.Google Scholar
  21. [T 84]
    Topor, R.W., Termination Detection for Distributed Computations, Infor. Processing Letters 18, pp. 33–36, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Nir Shavit
    • 1
  • Nissim Francez
    • 1
  1. 1.computer science departmentThe TechnionHaifaIsrael

Personalised recommendations