Skip to main content
SpringerLink
Log in

Nonintrusive Snapshots Using Thin Slices

  • Conference paper
Embedded and Ubiquitous Computing – EUC 2005 (EUC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3824))

Included in the following conference series:

Abstract

This paper gives an efficient algorithm for recording consistent snapshots of an asynchronous distributed system execution. The nonintrusive algorithm requires 6(n–1) control messages, where n is the number of processes. The algorithm has the following properties. (P1) The application messages do not require any changes, not even the use of timestamps. (P2) The application program requires no changes, and in particular, no inhibition is required. (P3) Any process can initiate the snapshot. (P4) The algorithm does not use the message history. A simple and elegant three-phase strategy of uncoordinated observation of local states is used to give a consistent distributed snapshot. Two versions of the algorithm are presented. The first version records consistent process states without requiring FIFO channels. The second version records process states and channel states consistently but requires FIFO channels. The algorithm also gives an efficient way to detect any stable property, which was an unsolved problem under assumptions (P1)-(P4).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acharya, A., Badrinath, B.R.: Recording Distributed Snapshots Based on Causal Order of Message Delivery. Inf. Process. Lett. 44(6), 317–321 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alagar, S., Venkatesan, S.: An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering. Inf. Process. Lett. 50(6), 311–316 (1994)

    Article  MATH  Google Scholar 

  3. Chandy, K.M., Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. Comput. Syst. 3(1), 63–75 (1985)

    Article  Google Scholar 

  4. Critchlow, C., Taylor, K.: The Inhibition Spectrum and the Achievement of Causal Consistency. Distributed Computing 10(1), 11–27 (1996)

    Article  MathSciNet  Google Scholar 

  5. Helary, J.-M.: Observing Global States of Asynchronous Distributed Applications. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 124–135. Springer, Heidelberg (1989)

    Google Scholar 

  6. Ho, G.S., Ramamoorthy, C.V.: Protocols for Deadlock Detection in Distributed Database Systems. IEEE Trans. Software Eng. 8(6), 554–557 (1982)

    Article  Google Scholar 

  7. Kshemkalyani, A., Wu, B.: Detecting Arbitrary Stable Properties Using Efficient Nonintrusive Snapshots. Univ. of Illinois at Chicago, Tech. Report UIC-CS-03-05 (2005)

    Google Scholar 

  8. Kshemkalyani, A., Raynal, M., Singhal, M.: An Introduction to Snapshot Algorithms in Distributed Computing. Distributed Systems Engineering 2(4), 224–233 (1995)

    Article  Google Scholar 

  9. Kshemkalyani, A., Singhal, M.: Correct Two-Phase and One-Phase Deadlock Detection Algorithms for Distributed Systems. In: IEEE SPDP 1990, pp. 126–129 (1990)

    Google Scholar 

  10. Lai, T.-H., Yang, T.: On Distributed Snapshots. Inf. Process. Lett. 25(3), 153–158 (1987)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  12. Li, H.F., Radhakrishnan, T., Venkatesh, K.: Global State Detection in Non-FIFO Networks. In: IEEE ICDCS 1987, pp. 364–370 (1987)

    Google Scholar 

  13. Marzullo, K., Sabel, L.S.: Efficient Detection of a Class of Stable Properties. Distributed Computing 8(2), 81–91 (1994)

    Article  Google Scholar 

  14. Mattern, F.: Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation. J. Parallel Distrib. Comput. 18(4), 423–434 (1993)

    Article  Google Scholar 

  15. Schiper, A., Sandoz, A.: Strong Stable Properties in Distributed Systems. Distributed Computing 8(2), 93–103 (1994)

    Article  Google Scholar 

  16. Spezialetti, M., Kearns, P.: Efficient Distributed Snapshots. In: IEEE ICDCS 1986, pp. 382–388 (1986)

    Google Scholar 

  17. Venkatesan, S.: Message-Optimal Incremental Snapshots. In: IEEE ICDCS 1989, pp. 53–60 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Univ. of Illinois at Chicago, Chicago, IL, 60607, USA

    Ajay D. Kshemkalyani & Bin Wu

Authors
  1. Ajay D. Kshemkalyani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bin Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  2. Faculty of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishi-ku, 819-0395, Fukuoka, Japan

    Makoto Amamiya

  3. IBM T.J. Watson Research Center, Hawthorne, NY, USA

    Zhen Liu

  4. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  5. Heinz Nixdorf Institute, University of Paderborn, Fuerstenallee 11, 33102, Paderborn, Germany

    Franz J. Rammig

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kshemkalyani, A.D., Wu, B. (2005). Nonintrusive Snapshots Using Thin Slices. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds) Embedded and Ubiquitous Computing – EUC 2005. EUC 2005. Lecture Notes in Computer Science, vol 3824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596356_58

Download citation

  • DOI: https://doi.org/10.1007/11596356_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30807-2

  • Online ISBN: 978-3-540-32295-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation