Skip to main content

Brief Announcement: Many Slices Are Better Than One

  • Conference paper
Distributed Computing (DISC 2006)

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

Included in the following conference series:

  • 836 Accesses

Abstract

In this paper, we present a new technique called multislicing to efficiently verify whether a distributed program has executed correctly. Our algorithm supports a class of temporal predicates (Multislicing Temporal Logic or MTL [1]) which allows properties based on local predicates and arbitrarily placed negations, disjunctions and conjunctions along with the possibly (⋄ , EF) temporal operator. We show that multislicing makes it possible to detect any MTL predicate in polynomial time with respect to the number of processes (n) in the system and the number of events (|E|) in the distributed computation (though, as expected, it is not polynomial with respect to the size of the predicate) [1]. We do not know of any other algorithm that allows detection of a similar class of predicates in polynomial time in n (or |E|).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

References

  1. Ogale, V.A., Garg, V.K.: Multislicing a computation. Technical Report TR-PDS-2006-002, University of Texas at Austin (2006), Available as: http://maple.ece.utexas.edu/TechReports/2006/TR-PDS-2006-02.ps

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

  3. Mittal, N., Garg, V.K.: Slicing a distributed computation: Techniques and theory. In: 5th International Symposium on DIStributed Computing (DISC 2001), pp. 78 – 92 (2001)

    Google Scholar 

  4. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  5. Sen, A., Garg, V.K.: Detecting temporal logic predicates in distributed programs using computation slicing. In: 7th International Conference on Principles of Distributed Systems (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ogale, V.A., Garg, V.K. (2006). Brief Announcement: Many Slices Are Better Than One. In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_41

Download citation

  • DOI: https://doi.org/10.1007/11864219_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44624-8

  • Online ISBN: 978-3-540-44627-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics