Paper Info
Title
Optimal Placement of Application-Level Checkpoints
Abstract
One of the basic problems related to the efficient application-level checkpointing is the placement of checkpoints in the source codes. In this paper we discuss two common questions with a source-to-source precompiler ALEC: 1) if there are N checkpoints in the application's source code, how to pick M checkpoints out of them minimizing the total amount of checkpoint data? 2) if there are no checkpoint in the application's source code, how to insert a set of checkpoints minimizing the amount of checkpoint data? We reveal that these two questions can both be abstracted as a mathematic model which is similar to the 0-1 integer programming model, and the model can be solved using implicit enumeration method. The solving methods proposed in the paper have been implemented and integrated into ALEC. Experimental results show that the method is efficient.
Year
DOI
Venue
2008
10.1109/HPCC.2008.40
HPCC
Keywords
Field
DocType
m checkpoint,checkpoint data,efficient application-level checkpointing,implicit enumeration method,application-level checkpoints,basic problem,source code,optimal placement,n checkpoint,integer programming model,total amount,mathematic model,data structures,mathematical model,minimisation,fault tolerance,integer programming
Data structure,Integer programming model,Computer science,Source code,Parallel computing,Enumeration,Real-time computing,Integer programming,Fault tolerance,Minimisation (psychology),Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
12
Authors
5
Name
Order
Citations
PageRank
Panfeng Wang1346.12
Zhiyuan Wang2576.37
Yunfei Du37214.62
Xuejun Yang467873.26
Haifang Zhou5359.33