A Caltech Library Service

Analysis of checkpointing schemes with task duplication

Ziv, Avi and Bruck, Jehoshua (1998) Analysis of checkpointing schemes with task duplication. IEEE Transactions on Computers, 47 (2). pp. 222-227. ISSN 0018-9340. doi:10.1109/12.663769.

See Usage Policy.


Use this Persistent URL to link to this item:


This paper suggests a technique for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execution time of a task and other important parameters related to the performance of checkpointing schemes. The analysis results are used to study and compare the performance of four existing checkpointing schemes. Our comparison results show that, in general, the number of processors used, not the complexity of the scheme, has the most effect on the scheme performance.

Item Type:Article
Related URLs:
URLURL TypeDescription
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© 1998 IEEE. Reprinted with Permission. The research reported in this paper was supported in part by the U.S. National Science Foundation Young Investigator Award CCR-9457811, by the Sloan Research Fellowship, and by DARPA and BMDO through an agreement with NASA/OSAT.
Subject Keywords:Parallel computing; fault tolerance; checkpointing; task duplication; Markov Reward Model; Markov processes; parallel programming; software fault tolerance; system recovery; average execution time; checkpointing scheme performance; parallel computing; processors
Issue or Number:2
Record Number:CaltechAUTHORS:ZIVieeetc98
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:9888
Deposited On:26 Mar 2008
Last Modified:08 Nov 2021 21:02

Repository Staff Only: item control page