Name
Abstract | ||
|---|---|---|
Checkpointing is a basic mechanism for backward error-recovery in fault-tolerant systems. A checkpointed process stops execution and saves its states to files periodically. To reduce the file sizes, only data modified between two consecutive checkpoint times is saved. However, existing approaches do not consider operating system paging activities; which, if ignored may double the number of disk accesses required to checkpoint non-resident dirty pages. In this paper, we propose continuous checkpointing, which combines the checkpoint facility with virtual memory paging operations. Thus, checkpointing is continuous during the Lifetime of a process without extra overhead. Checkpoint size is no longer proportional to application size, but rather is bounded by resident dirty pages. Experimental results show that disk accesses can be reduced by about 80% when checkpointing large applications. (C) 1997 by John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
1997 | 3.3.CO;2-U" target="_self" class="small-link-text"10.1002/(SICI)1097-024X(199709)27:93.3.CO;2-U | Softw., Pract. Exper. |
Keywords | DocType | Volume |
continuous checkpointing,virtual memory paging | Journal | 27 |
Issue | ISSN | Citations |
9 | 0038-0644 | 6 |
PageRank | References | Authors |
0.64 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shang-te Hsu | 1 | 7 | 1.33 |
| Ruei-Chuan Chang | 2 | 267 | 56.19 |