Fred J. Maryanski
ABSTRACT
The performance characteristics of a rollback algorithm are analyzed in a simulation experiment. An overview of the operation of the rollback algorithm is presented, followed by a discussion of the simulation model and its parameters. The model, as implemented, consists of data definition, data manipulation command processing, and rollback facilities. The model is parameterized in terms of number of application tasks and amount of data sharing and driven by randomized streams of data manipulation language commands. The simulation experiment applies the model to a CODASYL DBMS in an environment in which the rollback algorithm is initiated by a deadlock detection procedure. The overhead of the rollback algorithm in this environment is projected in terms of CPU utilization and file accesses. The results indicate that the factors having the strongest influence upon the performance of the rollback algorithm are update frequency and the degree of data sharing among programs. The performance projections indicate that the rollback algorithm introduces only a small amount of overhead even in worst case situations.
- 1.Colliat, G. and Bachman, C., "Commitment in a Distributed Database," Conf. on Very Large Data Bases, Sept. 1978.Google Scholar
- 2.Deppe, M. E., "Recovery and Restart in a Distributed Environment," Hewlett-Packard, General Systems Division, Santa Clara, CA 95059, June 1978.Google Scholar
- 3.Eswaran, K. P. et al., "The Notions of Consistency and Predicate Locks in a Data Base System," CACM (19, 11), Nov. 1976, pp. 624-633. Google ScholarDigital Library
- 4.Everest, G. C., "Concurrent Update Control and Database Integrity," in Data Base Management (Klimbie, J. W. and Koffeman, K. L., eds.), North-Holland, Apr. 1974, pp. 241-270.Google Scholar
- 5.Gray, J. N.; Lorie, R. A.; and Putzolu, G. R., "Granularity of Locks in a Shared Data Base," Conf. on Very Larg Data Bases, Sept. 1975, pp. 428-451.Google Scholar
- 6.Hill, E. Jr., "Analysis of An Inverted Data Base Structure," ACM SIGIR Conf., May 1978, pp. 37-64. Google ScholarDigital Library
- 7.Holt, R. C., "Some Deadlock Properties of Computer Systems," Computing Surveys (4,3), Sept. 1972, pp. 179-196. Google ScholarDigital Library
- 8.King, P. F. and Collmeyer, A. J., "Database Sharing—An Efficient Mechanism for Supporting Concurrent Processes," National Computer Conf. Vol. 42, June 1973, pp. 271-275.Google Scholar
- 9.Lomet, D. B., "A Practical Deadlock Avoidance Algorithm for Data Base Systems," ACM SIGMOD Conf., Aug. 1977, pp. 122-127. Google ScholarDigital Library
- 10.Macri, P. P., "Deadlock Detection and Resolution in a CODASYL Based Data Management System," ACM SIGMOD Conf., May 1976, pp. 45-49. Google Scholar
- 11.March, S. T. and Severance, D. G., "The Determination of Efficient Record Segmentations and Blocking Factors for Shared Data Files," ACM TODS (2, 3), Sept. 1977, pp. 279-296. Google ScholarDigital Library
- 12.Maryanski, F. J., "Restart and Recovery in Distributed Databases," Distributed Database, Infotech-State-of-the-Art Report, 1979.Google Scholar
- 13.Maryanski, F. J. and Fisher, P. S., "Rollback and Recovery in Distributed Data Base Management Systems," ACM Annual Conf., Oct. 1977, pp. 33-38.Google Scholar
- 14.Menasce, D.; Muntz, R.; and Popek, G., "A Formal Model of Crash Recovery in Computer Systems," Hawaii Int. Conf. on System Sciences, Vol. I, Jan. 1979.Google Scholar
- 15.Munz, R. and Krenz, G., "Concurrency in Database Systems—A Simulation Study," ACM SIGMOD Conf., Aug. 1977, pp. 111-120. Google ScholarDigital Library
- 16.Norsworthy, K. A., "Simulation of a Selective Rollback and Recovery Methodology," M.S. Report, Dept. Of Computer Science, Kansas State University, Manhattan, KS, Aug. 1978.Google Scholar
- 17.Ries, D. P. and Stonebaker, M., "Effects of Locking Granularity in a Database Management System," ACM TODS (2,3), Sept. 1977, pp. 233-246. 18 Google ScholarDigital Library
- 18.Severance, D. G. and Lohman, G. M., "Differential Files: Their Application to the Maintenance of Large Databases," ACM TODS (1,3), Sept. 1976, pp. 256-267. Google ScholarDigital Library
- 19.Shemer, J. E. and Collmeyer, A. J., "Database Sharing: A Study of Interference, Roadblock, and Deadlock," ACM SIGFIDET Workshop, Nov. 1972, pp. 147-163. Google ScholarDigital Library
- 20.Verhofstad, J. S. M., "Recovery and Crash Resistance in a Filing System," ACM SIGMOD Conf., Aug. 1977, pp. 158-167. Google ScholarDigital Library
- 21.Verhofstad, J. S. M., "Recovery Techniques for Database Systems," ACM computing surveys (10, 2), June 1978, pp, 167-196. Google ScholarDigital Library
Index Terms
- A model of the performance of a rollback algorithm
Recommendations
Performance of rollback recovery systems under intermittent failures
A mathematical model of a transaction-oriented system under intermittent failures is proposed. The system is assumed to operate with a checkpointing and rollback/recovery method to ensure reliable information processing. The model is used to derive the ...
Roll-Forward and Rollback Recovery: Performance-Reliability Trade-Off
Special issue on mobile computingPerformance and reliability trade-offs depend on the recovery scheme used in any fault-tolerant system. Gain in performance, using comparable resources, typically requires sacrifice in reliability, and vice-versa. Roll-forward schemes for duplex systems ...
Comments