Analytic Models for Rollback and Recovery Strategies in Data Base Systems

IEEE Transactions on Software Engineering

Volumn SE-1, Issue 1, 1975, Pages 100-110

  Chandy, K Mani ^a   Browne, James C ^a   Dissly, Charles W ^a   Uhrig, Werner R ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Data base systems; graph theory; probabilistic models; rollback and recovery strategies; software reliability; systems modeling

Indexed keywords

DATA PROCESSING;

EID: 0016487291     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1975.6312824     Document Type: Article

References (5)

1. K. M. Chandy andC. V. Ramamoorthy, “Rollback and recovery strategies for computer programs,” IEEE Trans. Comput, vol. C-21, pp. 546-556, June 1972.
2. K. M Chandy, C. V. Ramamoorthy, and A. E. Cowan, “A framework for hardware-software tradeoffs in the design of fault-tolerant computers,” in 1972 Fall Joint Comput. Conf, AFIPS Con/. Proc, vol. 41, part I. Montvale, N. J.: AFIPS Press, 1972, pp. 55-64.
3. J. C. Browne, K. M. Chandy, R. M. Brown, T. W. Keller, D. Towsley, and C. W. Dissly, “Hierarchical techniques for development of realistic models of complex computer systems,” IEEE Trans. Comput, to be published
4. H. M. Wagner Principles of Operations Research. Englewood Cliffs, N. J.: Prentice-Hall, 1969.
5. J. W. Young, “A first order approximation to the optimum checkpoint interval,” Commun. Ass. Comput. Mach., vol. 17, pp. 530-531, Sept. 1974.