Skip to main content
Springer Nature Link
Log in

Stable Predicate Detection in Dynamic Systems

  • Conference paper
Principles of Distributed Systems (OPODIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3974))

Included in the following conference series:

  • 654 Accesses

Abstract

Detection of stable predicates is fundamental to distributed application development and control. Stable predicates are distinguished by the fact that once they are true in some consistent global state, they remain true indefinitely. We present a protocol for the detection of stable predicates within dynamic systems (in which process membership may not be static). Unlike existing protocols, the presented protocol is not restricted to the detection of distributed termination and is based upon the use of approximately synchronized clocks. When clocks are approximately synchronized, the difference between the readings of any two clocks at an instant of time is kept within some known bound. Although clocks are assumed to be synchronized, temporary loss of synchronization is tolerated. The use of a global time base facilitates detection of predicates that remain true only after becoming true at some instant of time, while correctly detecting predicates that remain true upon becoming true in some consistent global state.

This material is based upon work supported by the National Science Foundation under Grant No. CCR-9984862.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Lai, T.-H.: Termination detection for dynamically distributed systems with non-first-in-first-out communication. Journal of Parallel and Distributed Computing 3(4), 577–599 (1986)

    Article  Google Scholar 

  2. Dhamdhere, D.M., Iyer, S.R., Reddy, E.K.K.: Distributed termination detection for dynamic systems. Parallel Computing 22(14), 2025–2045 (1997)

    Article  MATH  Google Scholar 

  3. Wang, X., Mayo, J.: A general model for detecting distributed termination in dynamic systems. In: Proceedings of 18th International Parallel and Distributed Symposium, pp. 84–90. IEEE Press, Los Alamitos (2004)

    Google Scholar 

  4. Welch, B.S.J., Lynch, N.: An overview of clock synchronization. In: Simons, B., Spector, A.Z. (eds.) Fault-Tolerant Distributed Computing. LNCS, vol. 448, pp. 84–96. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  5. Ramanathan, P., Shin, K.G., Butler, R.W.: Fault-tolerant clock synchronization in distributed systems. IEEE Computer 23(10), 33–44 (1990)

    Article  Google Scholar 

  6. Birman, K.: Building Secure and Reliable Network Applications. Manning Publications Co. (1996)

    Google Scholar 

  7. Marzullo, K., Neiger, G.: Detection of global state predicates. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol. 579, pp. 254–272. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  8. Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems 3(1), 63–75 (1985)

    Article  Google Scholar 

  9. Lai, T.H., Yang, H.T.: On distributed snapshots. Information Processing Letters 25(3), 153–158 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mattern, F.: Efficient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing 18(4), 423–434 (1993)

    Article  Google Scholar 

  11. Spezialetti, M., Kearns, J.: Efficient distributed snapshots. In: Proceedings of the Sixth International Conference on Distributed Computing Systems, pp. 382–388 (1986)

    Google Scholar 

  12. Matocha, J., Camp, T.: A taxonomy of distributed termination detection algorithms. J. Syst. Softw. 43(3), 207–221 (1998)

    Article  Google Scholar 

  13. Knapp, E.: Deadlock detection in distributed databases. ACM Computing Surveys 19(4), 303–328 (1987)

    Article  Google Scholar 

  14. Rana, S.P.: A distributed solution of the distributed termination problem. Information Processing Letters 17(1), 43–46 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mayo, J., Kearns, P.: Distributed termination detection with roughly synchronized clocks. Information Processing Letters 52(2), 105–108 (1994)

    Article  Google Scholar 

  16. Darling Jr., D., Mayo, J.: Stable predicate detection with probabilistically synchronized clocks. In: Proceedings of the ISCA 13th International Conference on Parallel and Distributed Computing Systems, pp. 574–579 (2000)

    Google Scholar 

  17. Mayo, J., Kearns, P.: Global predicates in rough real time. In: Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, pp. 17–24 (1995)

    Google Scholar 

  18. Stoller, S.D.: Detecting global predicates in distributed systems with clocks. In: Mavronicolas, M. (ed.) WDAG 1997. LNCS, vol. 1320, pp. 185–199. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  19. Stoller, S.D.: Detecting global predicates in distributed systems with clocks. Distributed Computing 13, 85–98 (2000)

    Article  Google Scholar 

  20. Bansod, S., Mayo, J.: A distributed algorithm for unstable global predicate evaluation with approximately synchronized clocks. Stud. Inform. Univ. 3(2), 151–168 (2004)

    Google Scholar 

  21. Cristian, F.: Probabilistic clock synchronization. Distributed Computing 3(3), 146–158 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  22. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Texas Instruments, 12203 Southwest Freeway, Stafford, TX, 77477, USA

    Donald Darling

  2. Michigan Technological University, Houghton, MI, 49931, USA

    Jean Mayo & Xinli Wang

Authors
  1. Donald Darling
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean Mayo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xinli Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of North Carolina at Chapel Hill, USA

    James H. Anderson

  2. Università di Pisa, Italy

    Giuseppe Prencipe

  3. ETH Zurich, 8092, Zurich, Switzerland

    Roger Wattenhofer

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Darling, D., Mayo, J., Wang, X. (2006). Stable Predicate Detection in Dynamic Systems. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds) Principles of Distributed Systems. OPODIS 2005. Lecture Notes in Computer Science, vol 3974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795490_14

Download citation

  • DOI: https://doi.org/10.1007/11795490_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36321-7

  • Online ISBN: 978-3-540-36322-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics