Abstract

Abstract. This paper presents snapshot algorithms for determining a consistent global state of a distributed system without significantly affecting the underlying computation. These algorithms do not require channels to be FIFO or messages to be acknowledged. Only a small amount of storage is needed. An important application of a snapshot algorithm is Global Virtual Time determination for distributed simulations. The paper proposes new and efficient Global Virtual Time approximation schemes based on snapshot algorithms and distributed termination detection principles. 1

Citations

929	Distributed snapshots: determining global states of distributed systems - Chandy, Lamport - 1985
790	Virtual time - Jefferson
725	the Ordering of Events in a Distributed System - Time - 1978
633	Parallel discrete event simulation - Fujimoto - 1990
577	Virtual Time and Global States in Distributed Systems - Mattern - 1988
282	Introduction to Distributed Algorithms - Tel - 1994
281	Checkpointing and rollback-recovery for distributed systems - Koo, Toueg - 1987
223	Asynchronous distributed simulation via a sequence of parallel computations - Chandy, Misra - 1981
221	Distributed Discrete-Event Simulation - Misra - 1986
156	Timestamps in message-passing systems that preserve the partial ordering - Fidge - 1988
102	Algorithms for distributed termination detection - Mattern - 1987
84	Distributed deadlock detection - CHANDY, MISRA, et al. - 1983
67	Echo algorithms: depth parallel operations on general graphs - Chang - 1982
62	Global virtual time algorithms - Bellenot - 1990
62	On distributed snapshots - Lai, Yang - 1987
51	Determining the global virtual time in a distributed simulation - Lin, Lazowska - 1990
24	Flush Primitives for Asynchronous Distributed Systems - Ahuja - 1990
20	Discarding obsolete information in a replicated database system - Sarin, Lynch - 1987
17	Observing Global States of Asynchronous Distributed Applications - H'elary - 1989
12	G.: Global virtual time approximation with distributed termination detection algorithms - Mattern, Mehl, et al. - 1991
11	On Distributed Logic Simulation using Time Warp - Bauer, Sporrer, et al. - 1991
9	The role of inhibition in asynchronous consistent-cut protocols - Taylor - 1989
8	Overlapping window algorithm for computing GVT - Baldwin, Chung, et al. - 1991
8	Distributed network protocols - Segal - 1983
7	The inhibition Spectrum and the Achievement of Causal Consistency - Critchlow, Taylor - 1990
5	Experience with a new distributed termination detection algorithm - Mattern - 1988
3	A distributed algorithm to detect a global state of a distributed simulation system - Samadi, Muntz, et al. - 1987
2	Observing global states of asynchronous distributed applications - Hlary - 1989