A Two-Level Checkpoint Algorithm in a Highly-Available Parallel Single Level Store System - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

A Two-Level Checkpoint Algorithm in a Highly-Available Parallel Single Level Store System

Abstract

A Parallel Single Level Store systems (PSLS) integrates a shared virtual memory and a parallel file system. Managing globally the data, they provide programmers of scientific applications with the attractive shared memory programming model combined with a large and efficient file system in a cluster. In this paper, we present a cheap and efficient two-level checkpointi- ng approach enabling a PSLS to tolerate failures. The first level checkpointing algorithm is very efficient and saves data in memory but requires a large amount of memory space. When memories are saturated, an alternative algorithm, saving a checkpoint on disks is implemented. Performance results present the impact of different variants of the checkpointing algorithms.
Fichier principal
Vignette du fichier
RR-4086.pdf (124.82 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072547 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072547 , version 1

Cite

Christine Morin, Renaud Lottiaux, Anne-Marie Kermarrec. A Two-Level Checkpoint Algorithm in a Highly-Available Parallel Single Level Store System. [Research Report] RR-4086, INRIA. 2000. ⟨inria-00072547⟩
149 View
17215 Download

Share

Gmail Facebook Twitter LinkedIn More