Abstract | ||
---|---|---|
We provide a framework to analyze multi-level checkpointing protocols, by formally defining a $k$ -level checkpointing pattern. We provide a first-order approximation to the optimal checkpointing period, and show that the corresponding overhead is in the order of $\sum _{\ell =1}^{k}\sqrt{2\lambda _\ell C_\ell}$ , where $\lambda _\ell$ is the error rate at level $\ell$ , and $C_\ell$ the ch... |
Year | DOI | Venue |
---|---|---|
2017 | 10.1109/TC.2016.2643660 | IEEE Transactions on Computers |
Keywords | Field | DocType |
Checkpointing,Protocols,Error analysis,Shape,Optimized production technology,Dynamic programming,Heuristic algorithms | Dynamic programming,Computer science,Word error rate,Parallel computing,Real-time computing,Lambda | Journal |
Volume | Issue | ISSN |
66 | 7 | 0018-9340 |
Citations | PageRank | References |
6 | 0.42 | 7 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Anne Benoit | 1 | 342 | 33.74 |
Aurélien Cavelan | 2 | 38 | 8.08 |
Valentin Le Fèvre | 3 | 7 | 2.13 |
Yves Robert | 4 | 842 | 70.03 |
Hongyang Sun | 5 | 32 | 5.24 |