Published February 1998
| public
Journal Article
Open
Analysis of checkpointing schemes with task duplication
- Creators
- Ziv, Avi
-
Bruck, Jehoshua
Abstract
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.
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.Files
ZIVieeetc98.pdf
Files
(259.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:b3bc871ce94478eaaf1adbd478305c82
|
259.4 kB | Preview Download |
Additional details
- Eprint ID
- 9888
- Resolver ID
- CaltechAUTHORS:ZIVieeetc98
- Created
-
2008-03-26Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field