Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation

F. Mattern
1993 Journal of Parallel and Distributed Computing  
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
more » ... hot algorithms and distributed termination detection principles.
doi:10.1006/jpdc.1993.1075 fatcat:g6hgwd6635cuhlatlycecrah4y