Name
Abstract | ||
|---|---|---|
Incremental checkpointing is an cost-efficient fault tolerant technique for long running programs such as genetic algorithms. In this paper, we derive the equations for the writing granularity of incremental checkpointing and find factors associated with the time overhead and disk space for incremental checkpoint. We also verify the applicability of the derived equation and the acceptability of the factors through experiments. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11540007_150 | FSKD (2) |
Keywords | Field | DocType |
writing granularity,genetic algorithm,incremental checkpoint,disk space,cost-efficient fault tolerant technique,incremental checkpointing,time overhead,cost efficiency,fault tolerant | Computer science,Parallel computing,Fault tolerance,Granularity,Genetic algorithm | Conference |
Volume | ISSN | ISBN |
3614 | 0302-9743 | 3-540-28331-5 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junyoung Heo | 1 | 288 | 27.60 |
| Xuefeng Piao | 2 | 23 | 4.89 |
| Sangho Yi | 3 | 538 | 35.84 |
| Geunyoung Park | 4 | 26 | 3.74 |
| Minkyu Park | 5 | 97 | 25.21 |
| Jiman Hong | 6 | 0 | 0.34 |
| Yookun Cho | 7 | 1544 | 162.03 |