Presentation 1997/4/25
A Distributed Consistent Global Checkpoint Algorithm with a Minimum Number of Checkpoints
Yoshifumi Manabe,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A distributed checkpoint algorithm for non-FIFO communication channel distributed systems is shown. A consistent global checkpoint is a set of states in which no message is recorded as received in one process but not yet sent in another process. This algorithm obtains a consistent global checkpoint for any checkpoint initiation by any process. Under the assumption that one consistent global checkpoint is obtained for a set of concurrent checkpoint initiations, the number of checkpoints is minimized by suppressing to take a checkpoint in a process which has no dependency from a initiator process since the last consistent global checkpoint.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) distributed system / distributed algorithm / checkpoint / snapshot / rollback
Paper # COMP97-6
Date of Issue

Conference Information
Committee COMP
Conference Date 1997/4/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Distributed Consistent Global Checkpoint Algorithm with a Minimum Number of Checkpoints
Sub Title (in English)
Keyword(1) distributed system
Keyword(2) distributed algorithm
Keyword(3) checkpoint
Keyword(4) snapshot
Keyword(5) rollback
1st Author's Name Yoshifumi Manabe
1st Author's Affiliation NTT Basic Research Laboratories()
Date 1997/4/25
Paper # COMP97-6
Volume (vol) vol.97
Number (no) 32
Page pp.pp.-
#Pages 8
Date of Issue