A D Kshemkalyani et al 1995 Distrib. Syst. Engng. 2 224 doi:10.1088/0967-1846/2/4/005
A D Kshemkalyani, M Raynal and M Singhal
Show affiliationsRecording on-the-fly global states of distributed executions is an important paradigm when one is interested in analysing, testing, or verifying properties associated with these executions. Since Chandy and Lamport`s (1985) seminal paper on this topic, this problem is called the snapshot problem. Unfortunately, the lack of both a globally shared memory and a global clock in a distributed system, added to the fact that transfer delays in these systems are finite but unpredictable, makes this problem non-trivial. This paper first discusses issues which have to be addressed to compute distributed snapshots in a consistent way. Then several algorithms which determine on-the-fly such snapshots are presented for several types of networks (according to the properties of their communication channels, namely, FIFO, non-FIFO, and causal delivery).
07.05.Bx Computer systems: hardware, operating systems, computer languages, and utilities
07.05.Kf Data analysis: algorithms and implementation; data management
84.40.Ua Telecommunications: signal transmission and processing; communication satellites
Issue 4 (December 1995)
A D Kshemkalyani et al 1995 Distrib. Syst. Engng. 2 224
Alexander Stukowski and Karsten Albe 2010 Modelling Simul. Mater. Sci. Eng. 18 085001
V R Coffman et al 2008 Modelling Simul. Mater. Sci. Eng. 16 065008
Ann E Mattsson et al 2005 Modelling Simul. Mater. Sci. Eng. 13 R1
Z Idris et al 2004 Modelling Simul. Mater. Sci. Eng. 12 995
J B Parse and J A Wert 1993 Modelling Simul. Mater. Sci. Eng. 1 275
Lorena Pardo et al 2010 Smart Mater. Struct. 19 115007
Antonia B Kesel et al 2004 Smart Mater. Struct. 13 512
Iain T McKinnie and Matthew J Davis 1997 Pure Appl. Opt. 6 759
J W Bradley 1998 Plasma Sources Sci. Technol. 7 572