Checkpointing Workflows à la Young/Daly Is Not Good Enough - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Parallel Computing Year : 2022

Checkpointing Workflows à la Young/Daly Is Not Good Enough


This article revisits checkpointing strategies when workflows composed of multiple tasks execute on a parallel platform. The objective is to minimize the expectation of the total execution time. For a single task, the Young/Daly formula provides the optimal checkpointing period. However, when many tasks execute simultaneously, the risk that one of them is severely delayed increases with the number of tasks. To mitigate this risk, a possibility is to checkpoint each task more often than with the Young/Daly strategy. But is it worth slowing each task down with extra checkpoints? Does the extra checkpointing make a difference globally? This article answers these questions. On the theoretical side, we prove several negative results for keeping the Young/Daly period when many tasks execute concurrently, and we design novel checkpointing strategies that guarantee an efficient execution with high probability. On the practical side, we report comprehensive experiments that demonstrate the need to go beyond the Young/Daly period and to checkpoint more often for a wide range of application/platform settings.
No file

Dates and versions

hal-03920329 , version 1 (03-01-2023)



Anne Benoit, Lucas Perotin, Yves Robert, Hongyang Sun. Checkpointing Workflows à la Young/Daly Is Not Good Enough. ACM Transactions on Parallel Computing, 2022, 9 (4), pp.1-25. ⟨10.1145/3548607⟩. ⟨hal-03920329⟩
28 View
0 Download



Gmail Facebook X LinkedIn More