Optimal checkpointing intervals for a double modular redundancy with signatures

✍ Scribed by S. Nakagawa; S. Fukumoto; N. Ishii

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 336 KB
• Volume: 46
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/s0898-1221(03)90123-4

✦ Synopsis

This

paper considers checkpointing intervals for a double modular redundancy (DMR) with signatures: a signature is a mapping of the original space into a much smaller spsce and represents the state of each processor. An execution time of a task is divided equally into n intervals, and at the end of each interval, a compare-and-store-checkpoint (CSCP) is always placed. Further, each CSCP interval is also divided equally into m intervals, and at the end of each interval, two processors calculate signatures and compare them. If signatures are different, it is judged that an error has occurred. Then, two processors are rolled back to the previous Keywords-Signature, Checkpointing interval, DMR, Mean time.