๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

MultiStage Approaches for Optimal Offline Checkpointing

โœ Scribed by Stumm, Philipp; Walther, Andrea

Book ID
118191061
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
383 KB
Volume
31
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New Algorithms for Optimal Online Checkp
New Algorithms for Optimal Online Checkpointing
โœ Stumm, Philipp; Walther, Andrea ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 316 KB
Optimal checkpointing interval for two-l
Optimal checkpointing interval for two-level recovery schemes
โœ Kenichiro Naruse; Shizuka Umemura; Sayori Nakagawa ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 294 KB

It is important to design computer systems to tolerate some failures. This paper proposes two-level recovery schemes, soft checkpoint (SC) and hard checkpoint (HC), which are useful to recover from failures. Soft checkpoint is less reliable and less overhead than those of HC, and is set up between H

Checkpoint scheduling model for optimali
Checkpoint scheduling model for optimality
โœ Zhenpeng Xu; Chaoguang Men; Weiwei Li; Xiang Li ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB
Optimal checkpointing intervals for a do
Optimal checkpointing intervals for a double modular redundancy with signatures
โœ S. Nakagawa; S. Fukumoto; N. Ishii ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 336 KB

## 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 en