Advertisement

Detecting global predicates in distributed systems with clocks

  • Scott D. Stoller
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1320)

Abstract

This paper proposes a framework for predicate detection in systems of processes with approximately-synchronized real-time clocks. Timestamps from these clocks are used to define two orderings on events: “definitely occurred before” and “possibly occurred before”. These orderings lead naturally to definitions of 3 distinct detection modalities, i.e., 3 meanings of “predicate Ф held during a computation”, namely: POSST Ф (“Ф possibly held”), DefTФ (“Ф definitely held”), and Inst (“Ф definitely held at a specific instant”). This paper defines these modalities and gives efficient algorithms for detecting them, the algorithms are based on algorithms of Cooper and Marzullo, Garg and Waldecker, and Fromentin and Raynal.

Keywords

global predicate detection consistent global states partially-synchronous systems distributed debugging real-time monitoring 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BM93]
    Ö. Babaoglu and K. Marzullo. Consistent global states of distributed systems: Fundamental concepts and mechanisms. In Sape Mullender, editor, Distributed Systems, ch. 5, pages 97–145. Addison Wesley, 2nd ed., 1993.Google Scholar
  2. [CBDGF95]
    B. Charron-Bost, C. Delporte-Gallet, and H. Fauconnier. Local and temporal predicates in distributed systems. ACM Trans. on Programming Languages and Systems, 17(1):157–179, January 1995.CrossRefGoogle Scholar
  3. [CLR90]
    T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill, 1990.Google Scholar
  4. [CM91]
    R. Cooper and K. Marzullo. Consistent detection of global predicates. In Proc. ACMIONR Workshop on Parallel and Distributed Debugging, 1991. Appeared as ACM SIGPLAN Notices 26(12):167–174, December 1991.Google Scholar
  5. [DJR93]
    C. Diehl, C. Jard, and J.-X. Rampon. Reachability analysis on distributed executions. In J.-P. Jouannaud and M.-C. Gaudel, editors, TAPSOFT '93: Theory and Practice of Software Development, vol. 668 of Lecture Notes in Computer Science, pages 629–643. Springer, 1993.Google Scholar
  6. [FR94]
    E. Fromentin and M. Raynal. Inevitable global states: a concept to detect unstable properties of distributed computations in an observer independent way. In Proc. 6th IEEE Symposium on Parallel and Distributed Processing, 1994.Google Scholar
  7. [FR95]
    E. Fromentin and M. Raynal. Characterizing and detecting the set of global states seen by all observers of a distributed computation. In Proc. IEEE 15th Int'l. Conference on Distributed Computing Systems, 1995.Google Scholar
  8. [GW94]
    V. K. Garg and B. Waldecker. Detection of weak unstable predicates in distributed programs. IEEE Trans. on Parallel and Distributed Systems, 5(3):299–307, 1994.CrossRefGoogle Scholar
  9. [GW96]
    V. K. Garg and B. Waldecker. Detection of strong unstable predicates in distributed programs. IEEE Trans. on Parallel and Distributed Systems, 7(12):1323–1333, 1996.CrossRefGoogle Scholar
  10. [JMN95]
    R. Jegou, R. Medina, and L. Nourine. Linear space algorithm for on-line detection of global predicates. In J. Desel, editor, Proc. Int'l. Workshop on Structures in Concurrency Theory (STRICT '95). Springer, 1995.Google Scholar
  11. [Lam78]
    L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–564, 1978.CrossRefGoogle Scholar
  12. [Mil91]
    D. L. Mills. Internet time synchronization: the Network Time Protocol. IEEE Trans. Communications, 39(10):1482–1493, October 1991.CrossRefGoogle Scholar
  13. [Mil95]
    D. L. Mills. Improved algorithms for synchronizing computer network clocks. IEEE/ACM Transactions on Networking, 3(3):245–254, June 1995.CrossRefGoogle Scholar
  14. [MN91]
    K. Marzullo and G. Neiger. Detection of global state predicates. In Proc. 5th Int'l. Workshop on Distributed Algorithms (WDAG '91), vol. 579 of Lecture Notes in Computer Science, pages 254–272. Springer, 1991.Google Scholar
  15. [SM94]
    R. Schwarz and F. Mattern. Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing, 7(3):149–174, 1994.Google Scholar
  16. [SS95]
    S. D. Stoller and F. B. Schneider. Faster possibility detection by combining two approaches. In J.-M. Hélary and M. Raynal, editors, Proc. 9th Int'l. Workshop on Distributed Algorithms (WDAG '95), vol. 972 of Lecture Notes in Computer Science, pages 318–332. Springer, 1995.Google Scholar
  17. [Tan95]
    A. S. Tanenbaum. Distributed Operating Systems. Prentice-Hall, 1995.Google Scholar
  18. [Ver93]
    P. Veríssimo. Real-time communication. In Sape Mullender, editor, Distributed Systems, ch. 17, pages 447–490. Addison Wesley, 2nd ed., 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Scott D. Stoller
    • 1
  1. 1.Dept. of Computer ScienceIndiana UniversityBloomingtonUSA

Personalised recommendations