Restart-Oriented Locking Methods

  • Alexander Thomasian
Chapter
Part of the The Springer International Series on Advances in Database Systems book series (ADBS, volume 1)

Abstract

Restart-oriented locking methods combine blocking and aborts (followed by restarts) to cope with the performance limits of standard locking. A subset of restart-oriented locking methods limit the wait depth of blocked transactions, where the wait depth is the distance of a blocked transaction from active transactions in the waits-for graph (it is shown below that this directed graph is acyclic). Wait depth limited methods are a subset of restart-oriented locking methods which limit d to a small value, d = 0 in the case of the no-waiting method and d = 1 in the case of some other methods discussed in this chapter. The wait depth limited WDL method [FrRT92] is a subset of wait depth limited methods, which in selecting the transaction to be aborted takes into account the progress made by conflicting transactions.

Keywords

Markov Chain Model Random Delay Active Transaction Effective Throughput Transaction Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. [FrRT92]
    P. Franaszek, J. T. Robinson, and A. Thomasian. “Concurrency control for high contention environments,” ACM Transactions on Database Systems 17, 2 (June 1992), 304–345.Google Scholar
  2. [TaSG85]
    Y. C. Tay, R. Suri, and N. Goodman. “A mean value performance model for locking in databases,” Journal of the ACM 32, 3 (July 1985), 618–651.MathSciNetGoogle Scholar
  3. [AgCL87]
    R. Agrawal, M. J. Carey, and M. Livny. “Concurrency control performance modeling: Alternatives and implications,” ACM Transactions on Database Systems 12, 4 (December 1987), 609–654.Google Scholar
  4. [FrRo85]
    P. Franaszek and J. T. Robinson. “Limitations of concurrency in transaction processing,” ACM Transactions on Database Systems 10, 1 (March 1985), 1–28.MATHCrossRefGoogle Scholar
  5. [FrRT91a]
    P. A. Franaszek, J. T. Robinson, and A. Thomasian. “Adaptive concurrency control scheme for transaction processing,” IBM Technical Disclosure Bulletin 33, 9 (February 1991), 29–30.Google Scholar
  6. [HsZh92]
    M. Hsu and B. Zhang. “Performance evaluation of cautious waiting,” ACM Transactions on Database Systems 17, 3 (September 1992), 477–512.Google Scholar
  7. [Thom96]
    A. Thomasian. “A performance comparison of locking policies with limited wait depth,” IEEE Transactions on Knowledge and Data Engineering, to appear (also IBM Research Report RC 19967, Hawthorne, NY, February 1993 ).Google Scholar
  8. [RoSL78]
    D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II. “System level concurrency control for distributed database systems.” ACM Transactions on Database Systems 3, 2 (June 1978), 178–198.Google Scholar
  9. [ACMc87]
    R. Agrawal, M. J. Carey, and L. W. McVoy. “The performance of alternative strategies for dealing with deadlocks in database management systems,” IEEE Transactions on Software Engineering 13, 12 (December 1987), 1348–1363.Google Scholar
  10. [ChGM83]
    A. Chesnais, E. Gelenbe, and I. Mitrani. “On the modeling of parallel access to shared data,” Communications of the ACM 26, 3 (March 1983), 198–202.Google Scholar
  11. [BeHG87]
    P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.Google Scholar
  12. [GrRe92]
    J. N. Gray and A. Reuter. Transaction Processing: Concepts and Facilities, Morgan Kauffman, 1992.Google Scholar
  13. [RyTh90b]
    I. K. Ryu and A. Thomasian. “Performance analysis of dynamic locking with the no-waiting method,” IEEE Transactions on Software Engineering 16, 7 (July 1990), 684–698.CrossRefGoogle Scholar
  14. [TayY87]
    Y. C. Tay. Locking Performance in Centralized Databases, Academic Press, 1987.Google Scholar
  15. [Tasa86]
    S. Tasaka. Performance Analysis of Multiple Access Protocols, MIT Press, 1986.Google Scholar
  16. [Thom92b]
    A. Thomasian. “Performance analysis of locking policies with limited wait depth,” Proceedings Performance 92 and ACM SIGMETRICS Joint Conference Conference on Measurement and Modeling of Computer Systems, Newport, RI, June 1992, pp. 115–127.Google Scholar
  17. [HsZh92]
    M. Hsu and B. Zhang. “Performance evaluation of cautious waiting,” ACM Transactions on Database Systems 17, 3 (September 1992), 477–512.Google Scholar
  18. [WHMZ94]
    G. Weikum, C. Hasse, A. Moenkeberg, and P. Zabback. “The COMFORT automatic tuning project, Information Systems 19, 5 (1994), 381–432.CrossRefGoogle Scholar
  19. [KIei75]
    L. Kleinrock. Queueing Systems, Volume I: Theory, John Wiley and Sons, 1975.Google Scholar
  20. [BeHG87]
    P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.Google Scholar

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  • Alexander Thomasian
    • 1
  1. 1.IBM T.J. Watson Research CenterUSA

Personalised recommendations