论文信息 - An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering

An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering

We present an optimal distributed algorithm to record a global state of a distributed system with causally ordered message delivery. The message complexity of our algorithm is O(n) bits where n is the number of processes in the system.

Subbarayan Venkatesan | Sridhar Alagar

[1] André Schiper,et al. A New Algorithm to Implement Causal Ordering , 1989, WDAG.

[2] Leslie Lamport,et al. Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[3] LamportLeslie. Time, clocks, and the ordering of events in a distributed system , 1978 .

[4] André Schiper,et al. Lightweight causal and atomic group multicast , 1991, TOCS.

[5] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[6] Mohan Ahuja. Flush Primitives for Asynchronous Distributed Systems , 1990, Inf. Process. Lett..

[7] André Schiper,et al. The Causal Ordering Abstraction and a Simple Way to Implement it , 1991, Inf. Process. Lett..

[8] Ten-Hwang Lai,et al. On Distributed Snapshots , 1987, Inf. Process. Lett..

[9] B. R. Badrinath,et al. Recording Distributed Snapshots Based on Causal Order of Message Delivery , 1992, Inf. Process. Lett..

[10] Hon Fung Li,et al. Global State Detection in Non-FIFO Networks , 1987, ICDCS.