Name
Abstract | ||
|---|---|---|
Using store-checkpoints (SCPs) and compare- checkpoints (CCPs), we present an adaptive checkpointing scheme that dynamically adjusts the checkpointing interval on line in this paper. With additional SCPs and CCPs, we can use both the comparison and storage operations in an efficient way and improve the performance of checkpointing schemes. Further, we obtain methods to calculate the optimal numbers of checkpoints by which minimize the mean execution times. Simulation results show that compared to previous methods, the proposed approach significantly increases the likelihood of timely task completion in the present of faults. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/IMSCCS.2006.250 | IMSCCS (2) |
Keywords | Field | DocType |
intervals,optimization,fault detection,fault tolerant,bandwidth,simulation,scp,redundancy,ccp,information science,embedded computing,computational modeling,fault tolerance | Fault detection and isolation,Computer science,Information science,Redundancy (engineering),Bandwidth (signal processing),Fault tolerance,Task completion,Distributed computing | Conference |
Volume | Issue | ISBN |
2 | null | 0-7695-2581-4 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhong-wen Li | 1 | 27 | 11.00 |
| Yang Xiang | 2 | 2930 | 212.67 |
| Chen Hong | 3 | 21 | 11.66 |