By Topic

Checkpoint processing in distributed systems software using synchronized clocks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Neogy, S. ; Dept. of Comput. Sci. Eng., Calcutta Univ., India ; Sinha, A. ; Das, P.K.

The method of taking checkpoints in a truly distributed manner, that is in the absence of a global checkpoint coordinator has been very tricky. This has been dealt with in a system that uses a loosely synchronized clock. The constituent processes take their checkpoints according to their own clocks at predetermined checkpoint instants. Since these checkpoints are asynchronous, in order to determine a global consistent set of such checkpoints there must be some sort of synchronization among them. Synchronization information is appended to clock synchronization messages that are used by the constituent processes for checkpoint-synchronization. Communication in this system is synchronous, so processes may be blocked for communication at the checkpointing instants. The blocked processes take their checkpoints after they unblock. It is shown that the set of such i-th checkpoints is consistent and hence the rollback required by the system in case failure occurs is only up to the last saved state

Published in:

Information Technology: Coding and Computing, 2001. Proceedings. International Conference on

Date of Conference:

Apr 2001