Skip to main content

Global Predicate Detection under Fine-Grained Modalities

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2896))

Abstract

Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global predicates can be specified. For a conjunctive predicate φ, we show how to detect the traditional Possibly(φ) and Definitely(φ) modalities along with the added information of the exact interaction type between each pair of intervals (one interval at each process). The polynomial time, space, and message complexities of the proposed on-line detection algorithms to detect Possibly andDefinitely in terms of the fine-grained interaction types per pair of processes, are the same as those of the earlier on-line algorithms that can detect only whether thePossibly andDefinitely modalities hold.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandra, P., Kshemkalyani, A.D.: Algorithms for Detecting Global Predicates under Fine-grained Modalities, Technical Report UIC-ECE-02-05, University of Illinois at Chicago (April 2002)

    Google Scholar 

  2. Chandra, P., Kshemkalyani, A.D.: Distributed Algorithm to Detect Strong Conjunctive Predicates. Information Processing Letters 87(5), 243–249 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chandra, P., Kshemkalyani, A.D.: Detection of Orthogonal Interval Relations. In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol. 2552, pp. 323–333. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Cooper, R., Marzullo, K.: Consistent Detection of Global Predicates. In: Proc. ACM/ONR Workshop on Parallel & Distributed Debugging, May 1991, pp. 163–173 (1991)

    Google Scholar 

  5. Coulouris, G., Dollimore, J., Kindberg, T.: Distributed Systems Concepts and Design, 3rd edn. Addison-Wesley, Reading (2001)

    Google Scholar 

  6. Garg, V.K., Waldecker, B.: Detection of Weak Unstable Predicates in Distributed Programs. IEEE Trans. Parallel & Distributed Systems 5(3), 299–307 (1994)

    Article  Google Scholar 

  7. Garg, V.K., Waldecker, B.: Detection of Strong Unstable Predicates in Distributed Programs. IEEE Trans. Parallel & Distributed Systems 7(12), 1323–1333 (1996)

    Article  Google Scholar 

  8. Hurfin, M., Mizuno, M., Raynal, M., Singhal, M.: Efficient Distributed Detection of Conjunctions of Local Predicates. IEEE Trans. Software Engg. 24(8), 664–677 (1998)

    Article  Google Scholar 

  9. Kshemkalyani, A.D.: Temporal Interactions of Intervals in Distributed Systems. Journal of Computer and System Sciences 52(2), 287–298 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kshemkalyani, A.D.: A Fine-Grained Modality Classification for Global Predicates. IEEE Trans. Parallel & Distributed Systems 14(8), 807–816 (2003)

    Article  Google Scholar 

  11. Kshemkalyani, A.D.: A Note on Fine-grained Modalities for Nonconjunctive Predicates. In: 5th Workshop on Distributed Computing, December 2003. LNCS, Springer, Heidelberg (2003)

    Google Scholar 

  12. Kshemkalyani, A.D.: A Framework for Viewing Atomic Events in Distributed Computations. Theoretical Computer Science 196(1-2), 45–70 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  14. 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 

  15. Mullender, S.: Distributed Systems, 2nd edn. ACM Press, New York (1994)

    Google Scholar 

  16. Stoller, S., Schneider, F.: Faster Possibility Detection by Combining Two Approaches. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 318–332. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  17. Venkatesan, S., Dathan, B.: Testing and Debugging Distributed Programs Using Global Predicates. IEEE Trans. Software Engg. 21(2), 163–177 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chandra, P., Kshemkalyani, A.D. (2003). Global Predicate Detection under Fine-Grained Modalities. In: Saraswat, V.A. (eds) Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation. ASIAN 2003. Lecture Notes in Computer Science, vol 2896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40965-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40965-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20632-3

  • Online ISBN: 978-3-540-40965-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics