Improving Scalability of Application-Level Checkpoint-Recovery by Reducing Checkpoint Sizes
Use this link to citehttp://hdl.handle.net/2183/20945
- GI-GAC - Artigos 
MetadataShow full item record
TitleImproving Scalability of Application-Level Checkpoint-Recovery by Reducing Checkpoint Sizes
Cores, I., Rodríguez, G., martín, M.J. et al. New Gener. Comput. (2013) 31: 163. https://doi.org/10.1007/s00354-013-0302-4
[Abstract] The execution times of large-scale parallel applications on nowadays multi/many-core systems are usually longer than the mean time between failures. Therefore, parallel applications must tolerate hardware failures to ensure that not all computation done is lost on machine failures. Checkpointing and rollback recovery is one of the most popular techniques to implement fault-tolerant applications. However, checkpointing parallel applications is expensive in terms of computing time, network utilization and storage resources. Thus, current checkpoint-recovery techniques should minimize these costs in order to be useful for large scale systems. In this paper three different and complementary techniques to reduce the size of the checkpoints generated by application-level checkpointing are proposed and implemented. Detailed experimental results obtained on a multicore cluster show the effectiveness of the proposed methods to reduce checkpointing cost.
This is a post-peer-review, pre-copyedit version of an article published in New Generation Computing. The final authenticated version is available online at: https://doi.org/10.1007/s00354-013-0302-4