Article

Checkpointing and Its Applications

Authors:

C. KintalaAuthors Info & Claims

FTCS '95: Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing

Page 22

Published: 27 June 1995 Publication History

Abstract

Abstract: The paper describes our experience with the implementation and applications of the Unix checkpointing library libckp, and identifies two concepts that have proven to be the key to making checkpointing a powerful tool. First, including all persistent states, i.e., user files, as part of the process state that can be checkpointed and recovered provides a truly transparent and consistent rollback. Second, excluding part of the persistent state from the process state allows user programs to process future inputs from a desirable state, which leads to interesting new applications of checkpointing. We use real-life examples to demonstrate the use of libckp for bypassing premature software exits, for fast initialization and for memory rejuvenation.

References

[1]

M. Litzkow and M. Solomon, "Supporting checkpointing and process migration ouside the Unix," in Proc. Usenix Winter Conference, 1992.

[2]

J. S. Plank, M. Beck, G. Kingsley, and K. Li. "Libckpt: Transparent checkpointing under Unix," in Proc. Usenix Technical Conference, pp. 213-224, Jan. 1995.

Digital Library

[3]

R. E. Strom" S. A. Yemini, and D. F. Bacon, "A recoverable object store," in Proc. Hawaii International Conference on System Sciences, pp. II-215-II-221, Jan. 1988.

Digital Library

[4]

Y. M. Wang and W. K. Fuchs, "Lazy checkpoint coordination for bounding rollback propagation," in Proc. IEEE Symp. Reliable Distributed Syst., pp. 78-85, Oct. 1993.

[5]

F. Douglis and J. Ousterhout, "Transparent process migration: Design alternatives and the Sprite implementation," Software - Practice and Experience, Vol. 21, No.8, pp. 757- 785, Aug. 1991.

Digital Library

[6]

G. S. Fowler, D. G. Korn, J. J. Snyder, ane K.-P. Vo, "Feature-based portability," in Proc. VHLL Usenix Symposium on Very High Level Languages, Oct. 1994.

Digital Library

[7]

W.-J. Sun and C. Sechen, "Efficient and effective placement for very large circuits," in Proc. IEEE International Conference on Computer-Aided-Design, pp. 170-177, 1993.

Digital Library

[8]

H. Kriplani, F. Najm, and I. Hajj, "Pattern independent maximum Current estimation in power and ground buses of CMOS VLSI circuits: Algorithms, signal correlations and their resolution." submitted to IEEE Transactions on Computer-Aided Design, Feb. 1993.

[9]

P. Y. Chung, Y. M. Wang, and I. N. Hajj, "Diagnosis and correction of logic design errors in digital circuits," In Proc. the 30th ACM/IEEE Design Automation Conference, pp. 503- 508, 1993.

Digital Library

[10]

W. Chuang, S. S. Sapatnekar, and I. N. Hajj, "Timing and area optimization for standard-cell VLSI circuit design," IEEE Trans. Computer-Aided Design, to appear.

Digital Library

[11]

D. Hill, D. Shugard, J. Fishburn, and K. Keutzer, Algorithms and Techniques for VLSI Layout Synthesis. Kluwer, 1989.

Digital Library

[12]

A. Flora-Holmquist and M. Staskauskas, "Software design technology for communication systems reliability," in Proc. 1994 International Conference on Communication Technology, June 1994.

[13]

K. M. Chandy and L. Lamport, "Distributed snapshots: Determining global states of distributed systems," ACM Trans. Comput. Syst., Vol. 3, No.1, pp. 63-75, Feb. 1985.

Digital Library

[14]

R. Koo and S. Toueg, "Checkpointing and rollback-recovery for distributed systems," IEEE Trans. Software Eng., Vol. SE-13, No.1, pp. 23-31, Jan. 1987.

Digital Library

[15]

A. Avizienis, "The N-version approach to fault-tolerant software," IEEE Trans. Software Eng., Vol. SE-11, No. 12, pp. 1491-1501, Dec. 1985.

Digital Library

[16]

B. Randell, "System structure for software fault tolerance," IEEE Trans. Software Eng., Vol. SE-1, No.2, pp. 220-232, June 1975.

Digital Library

[17]

P. E. Ammann and J. C. Knight, "Data diversity: An approach to software fault-tolerance," IEEE Trans. Comput., Vol. 37, No.4, pp. 418-425, Apr. 1988.

Digital Library

[18]

D. Fell, The Essential Gardener. Avenel, NJ: Crescent Books, 1993.

[19]

K.-P. Vo, "Writing reusable libraries with disciplines and methods," in submitted to ACM SIGSOFT Symposium on Software Reusability, 1995.

[20]

R. Hastings and B. Joyce, "Purify: Fast detection of memory leaks and access errors," in Proc. Winter Usenix Conference, pp. 125-136, Jan. 1992.

[21]

A. S. Corporation, "SENTINEL run-time analysis tool: User's guide." 1994.

[22]

H.-J. Boehm and M. Weiser, "Garbage collection in an uncooperative environment," Software - Practice and Experience, Vol. 18, No.9, pp. 807-820, Sept. 1988.

Digital Library

Cited By

Seshadri VPekhimenko GRuwase OMutlu OGibbons PKozuch MMowry TChilimbi T(2015)Page overlaysACM SIGARCH Computer Architecture News10.1145/2872887.275037943:3S(79-91)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2872887.2750379
Ren JZhao JKhan SChoi JWu YMutlu OPrvulovic M(2015)ThyNVMProceedings of the 48th International Symposium on Microarchitecture10.1145/2830772.2830802(672-685)Online publication date: 5-Dec-2015
https://dl.acm.org/doi/10.1145/2830772.2830802
Vogt DMiraglia APortokalidis GBos HTanenbaum AGiuffrida CLea RGopalakrishnan STilevich EMurphy ABlackstock M(2015)Speculative Memory CheckpointingProceedings of the 16th Annual Middleware Conference10.1145/2814576.2814802(197-209)Online publication date: 24-Nov-2015
https://dl.acm.org/doi/10.1145/2814576.2814802
Show More Cited By

Recommendations

Application-transparent checkpointing in Mach 3.O/UX
HICSS '95: Proceedings of the 28th Hawaii International Conference on System Sciences

Checkpointing is perhaps the most explored of software based recovery techniques, yet it has typically been developed only for special purpose or research oriented operating systems. The paper presents virtual memory checkpointing algorithms that have ...
A memory approach to consistent, reliable distributed shared memory
HOTOS '95: Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)

Fault-tolerant distributed shared memory systems do not always need to support a complete and consistent recovery after a failure. We describe a framework, within which different approaches to, and different degrees of consistency and recoverability can ...
A low-overhead recovery technique using quasi-synchronous checkpointing
ICDCS '96: Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)

In this paper, we propose a quasi-synchronous checkpointing algorithm and a low-overhead recovery algorithm based on it. The checkpointing algorithm preserves process autonomy by allowing them to take checkpoints asynchronously and uses communication-...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FTCS '95: Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing

June 1995

Copyright © Copyright (c) 1995 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 27 June 1995

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Seshadri VPekhimenko GRuwase OMutlu OGibbons PKozuch MMowry TChilimbi T(2015)Page overlaysACM SIGARCH Computer Architecture News10.1145/2872887.275037943:3S(79-91)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2872887.2750379
Ren JZhao JKhan SChoi JWu YMutlu OPrvulovic M(2015)ThyNVMProceedings of the 48th International Symposium on Microarchitecture10.1145/2830772.2830802(672-685)Online publication date: 5-Dec-2015
https://dl.acm.org/doi/10.1145/2830772.2830802
Vogt DMiraglia APortokalidis GBos HTanenbaum AGiuffrida CLea RGopalakrishnan STilevich EMurphy ABlackstock M(2015)Speculative Memory CheckpointingProceedings of the 16th Annual Middleware Conference10.1145/2814576.2814802(197-209)Online publication date: 24-Nov-2015
https://dl.acm.org/doi/10.1145/2814576.2814802
Seshadri VPekhimenko GRuwase OMutlu OGibbons PKozuch MMowry TChilimbi TMarr DAlbonesi D(2015)Page overlaysProceedings of the 42nd Annual International Symposium on Computer Architecture10.1145/2749469.2750379(79-91)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2749469.2750379
Cotroneo DNatella RPietrantuono RRusso S(2014)A survey of software aging and rejuvenation studiesACM Journal on Emerging Technologies in Computing Systems10.1145/253911710:1(1-34)Online publication date: 13-Jan-2014
https://dl.acm.org/doi/10.1145/2539117
Kiehn ARaj PSingh P(2014)A Causal Checkpointing Algorithm for Mobile Computing EnvironmentsProceedings of the 15th International Conference on Distributed Computing and Networking - Volume 831410.1007/978-3-642-45249-9_9(134-148)Online publication date: 4-Jan-2014
https://dl.acm.org/doi/10.1007/978-3-642-45249-9_9
Zhao CSteffan JAmza CKielstra A(2012)Compiler support for fine-grain software-only checkpointingProceedings of the 21st international conference on Compiler Construction10.1007/978-3-642-28652-0_11(200-219)Online publication date: 24-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28652-0_11
de Kruijf MNomura SSankaralingam K(2010)RelaxACM SIGARCH Computer Architecture News10.1145/1816038.181602638:3(497-508)Online publication date: 19-Jun-2010
https://dl.acm.org/doi/10.1145/1816038.1816026
Voskuilen GAhmad FVijaykumar T(2010)TimetravelerACM SIGARCH Computer Architecture News10.1145/1816038.181598638:3(198-209)Online publication date: 19-Jun-2010
https://dl.acm.org/doi/10.1145/1816038.1815986
de Kruijf MNomura SSankaralingam KSeznec AWeiser URonen R(2010)RelaxProceedings of the 37th annual international symposium on Computer architecture10.1145/1815961.1816026(497-508)Online publication date: 19-Jun-2010
https://dl.acm.org/doi/10.1145/1815961.1816026
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents