论文信息 - Checkpointing strategies for database systems

Checkpointing strategies for database systems

In this paper we consider a transaction oriented database system where checkpointing is done after a certain number of transactions are processed. The design objective is to maximize the system availability given the failure rate, service rate and other system parameters. Several checkpointing strategies have been proposed and analyzed. We have also considered the effect of error latency.

Pradip K. Srimani | Raj Sekhar Pamula

[1] Andrzej Duda,et al. The Effects of Checkpointing on Program Execution Time , 1983, Inf. Process. Lett..

[2] Erol Gelenbe,et al. On the Optimum Checkpoint Interval , 1979, JACM.

[3] K. Mani Chandy,et al. Analytic models for rollback and recovery strategies in data base systems , 1975, IEEE Transactions on Software Engineering.

[4] Kang G. Shin,et al. Optimization criteria for checkpoint placement , 1984, CACM.

[5] K. Mani Chandy,et al. A Survey of Analytic Models of Rollback and Recovery Stratergies , 1975, Computer.

[6] Erol Gelenbe,et al. Performance of rollback recovery systems under intermittent failures , 1978, CACM.

[7] John W. Young,et al. A first order approximation to the optimum checkpoint interval , 1974, CACM.

[8] Joost Verhofstad,et al. Recovery Techniques for Database Systems , 1978, CSUR.