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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Acharya, A., Badrinath, B.R.: Recording Distributed Snapshots Based on Causal Order of Message Delivery. Inf. Process. Lett.Ā 44(6), 317ā321 (1992)
Alagar, S., Venkatesan, S.: An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering. Inf. Process. Lett.Ā 50(6), 311ā316 (1994)
Chandy, K.M., Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. Comput. Syst.Ā 3(1), 63ā75 (1985)
Critchlow, C., Taylor, K.: The Inhibition Spectrum and the Achievement of Causal Consistency. Distributed ComputingĀ 10(1), 11ā27 (1996)
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)
Ho, G.S., Ramamoorthy, C.V.: Protocols for Deadlock Detection in Distributed Database Systems. IEEE Trans. Software Eng.Ā 8(6), 554ā557 (1982)
Kshemkalyani, A., Wu, B.: Detecting Arbitrary Stable Properties Using Efficient Nonintrusive Snapshots. Univ. of Illinois at Chicago, Tech. Report UIC-CS-03-05 (2005)
Kshemkalyani, A., Raynal, M., Singhal, M.: An Introduction to Snapshot Algorithms in Distributed Computing. Distributed Systems EngineeringĀ 2(4), 224ā233 (1995)
Kshemkalyani, A., Singhal, M.: Correct Two-Phase and One-Phase Deadlock Detection Algorithms for Distributed Systems. In: IEEE SPDP 1990, pp. 126ā129 (1990)
Lai, T.-H., Yang, T.: On Distributed Snapshots. Inf. Process. Lett.Ā 25(3), 153ā158 (1987)
Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACMĀ 21(7), 558ā565 (1978)
Li, H.F., Radhakrishnan, T., Venkatesh, K.: Global State Detection in Non-FIFO Networks. In: IEEE ICDCS 1987, pp. 364ā370 (1987)
Marzullo, K., Sabel, L.S.: Efficient Detection of a Class of Stable Properties. Distributed ComputingĀ 8(2), 81ā91 (1994)
Mattern, F.: Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation. J. Parallel Distrib. Comput.Ā 18(4), 423ā434 (1993)
Schiper, A., Sandoz, A.: Strong Stable Properties in Distributed Systems. Distributed ComputingĀ 8(2), 93ā103 (1994)
Spezialetti, M., Kearns, P.: Efficient Distributed Snapshots. In: IEEE ICDCS 1986, pp. 382ā388 (1986)
Venkatesan, S.: Message-Optimal Incremental Snapshots. In: IEEE ICDCS 1989, pp. 53ā60 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)