On distributed snapshot algorithms

Snapshot algorithms are fundamental for many distributed applications and must often be executed repeatedly. We present three snapshot algorithms. The first one is based on the assumption of global time, it computes channel states using several schemes. Taking consistent cut for global time instant,...

Full description

Saved in:
Bibliographic Details
Published in:Advances in parallel and distributed computing : March 19-21, 1997, Shanghai, China : proceedings pp. 291 - 297
Main Authors: Letian He, Yongqiang Sun
Format: Conference Proceeding
Language:English
Published: IEEE 1997
Subjects:
Application software
Computer science
Control system synthesis
Control systems
Delay
Distributed computing
Helium
Message passing
Sun
System recovery
ISBN:9780818678769, 0818678763
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Snapshot algorithms are fundamental for many distributed applications and must often be executed repeatedly. We present three snapshot algorithms. The first one is based on the assumption of global time, it computes channel states using several schemes. Taking consistent cut for global time instant, we show that the algorithm is applicable for existing snapshot algorithms. The second one is a real token passing based algorithm for non-FIFO asynchronous distributed systems. Its message complexity of control messages is O(n). The last algorithm is the repeated version of the second one. Using this algorithm, processes can get consistent global states at their convenience concurrently.
ISBN:9780818678769
0818678763
DOI:10.1109/APDC.1997.574046