Title :
A general repeated snapshot algorithm
Author :
He, Letian ; Sun, Yongqiang
Author_Institution :
Dept. of Comput. Sci., Shanghai Jiaotong Univ., China
Abstract :
Snapshot algorithms are fundamental for many distributed applications. This paper presents a repeated snapshot algorithm for non-FIFO asynchronous distributed systems. The algorithm attaches numbers of snapshot to messages, uses token passing and needs little space on each process. Its message complexity of control messages for one snapshot is O(n). Using this algorithm, processes can get consistent global states at their convenience concurrently. The algorithm is proved. The availability of the algorithm is discussed
Keywords :
communication complexity; distributed algorithms; protocols; control messages; general repeated snapshot algorithm; message complexity; non-FIFO asynchronous distributed systems; token passing; Application software; Clocks; Computer crashes; Computer science; Database systems; Debugging; Discrete event simulation; Helium; Sun; System recovery;
Conference_Titel :
Performance, Computing, and Communications Conference, 1997. IPCCC 1997., IEEE International
Conference_Location :
Phoenix, Tempe, AZ
Print_ISBN :
0-7803-3873-1
DOI :
10.1109/PCCC.1997.581499
