Application-level checkpointing techniques for parallel programs

22Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In its simplest form, checkpointing is the act of saving a program’s computation state in a form external to the running program, e.g. the computation state is saved to a filesystem. The checkpoint files can then be used to resume computation upon failure of the original process(s), hopefully with minimal loss of computing work. A checkpoint can be taken using a variety of techniques in every level of the system, from utilizing special hardware/architectural checkpointing features through modification of the user’s source code. This survey will discuss the various techniques used in application-level checkpointing, with special attention being paid to techniques for checkpointing parallel and distributed applications.

Cite

CITATION STYLE

APA

Walters, J. P., & Chaudhary, V. (2006). Application-level checkpointing techniques for parallel programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4317, pp. 221–234). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/11951957_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free