Optimistic Concurrency Control Algorithm with Dynamic Serialization Adjustment for Firm Deadline Real-Time Database Systems

  • Piotr Krzyżagórski
  • Tadeusz Morzy
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


A new optimistic concurrency control algorithm for firm deadline real-time database systems is presented. The algorithm dynamically adjusts a serialization order among conflicting transactions and, thus, tries to reduce the number of unnecessary restarts of transactions. Instead of aborting a lower priority transaction being in conflict with already committed higher priority transaction the algorithm is looking for a new serialization order, i.e. it tries to serialize the transaction before the conflicting one. Through simulation experiments, we evaluate the performance of the algorithm, and compare the algorithm with two well-known optimistic concurrency control algorithms: OCC and OPT-BC. Experimental results have shown that the performance of the algorithm depends on a system workload. The probability of successful reordering of conflicting transactions decreases with the increasing number of conflicts between the transactions.


Serialization Order Concurrency Control Execution Order Read Phase Concurrency Control Mechanism 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Agrawal, and A. El Abbadi, and R. Jeffers. Using Delayed Commitment in Locking Protocols for Real-Time Databases. In Proceedings of 1992 ACM-SIGMOD International Conference, pages 104–113, June 1992.CrossRefGoogle Scholar
  2. [2]
    R. Abbott, and H. Garcia-Molina. Scheduling Real-Time Transactions: a Performance Evaluation. In Proceedings of the 14th VLDB Conference, Los Angeles, California, 1988.Google Scholar
  3. [3]
    R. Abbott, H. Garcia-Molina. Scheduling Real-time Transactions with Disk Resident Data. In Proceedings of the 15th VLDB Conference, pages 385–395, Amsterdam, 1989.Google Scholar
  4. [4]
    R. Abbott, H. Garcia-Molina. Scheduling Real-Time Transactions: a Performance Evaluation. ACM Transactions on Database Systems, 17(3):513–560, September 1992.CrossRefGoogle Scholar
  5. [5]
    A. P. Buchmann, D. R. McCarthy, M. Hsu, and U. Dayal. Time-Critical Database Scheduling: A Framework For Integrating Real-Time Scheduling and Concurrency Control. In Proc. of Data Engineering Conference, February 1989.Google Scholar
  6. [6]
    W. Cellary, E. Gelenbe, and T. Morzy. Concurrency Control in Distributed Database Systems, North Holland Pub. Co., 1988.MATHGoogle Scholar
  7. [7]
    M. H. Graham. Issues in Real-Time Data Management. The Journal of Real-Time Systems, 4:185–202, 1992.CrossRefGoogle Scholar
  8. [8]
    J. R. Haritsa, M.J. Carey, and M. Livny. On Being Optimistic about Real-Time Constraints. In Proceedings of the 9th SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 1990.Google Scholar
  9. [9]
    J. R. Haritsa, M. J. Carey, and M. Livny. Data Access Scheduling in Firm Real-Time Database Systems. The Journal of Real-Time Systems, 4:203–241, 1992.CrossRefGoogle Scholar
  10. [10]
    J. Huang, J. A. Stankovic, K. Ramamritham, and D. Towsley. Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes. In Proceedings of the 17th VLDB Conference, pages 35–46, September 1991.Google Scholar
  11. [11]
    W. Kim, J. Srivastava. Enhancing Real-Time DBMS Performance with Multiversion Data and Priority Based Disk Scheduling. In Proc of 12th IEEE Real-Time Systems Symposium, 1991.Google Scholar
  12. [12]
    H. Kung, and J. Robinson. On Optimistic Methods for Concurrency Control. ACM Transactions on Database Systems, 6(2), June 1981.Google Scholar
  13. [13]
    D. Menasce, T. Nakanishi, Optimistic Versus Pessimistic Concurrency Control Mechanisms in Database Management Systems. Information Systems, 7(1), 1982.Google Scholar
  14. [14]
    U. Praedel, G. Schlageter, and R. Unland. Redesign of Optimistic Methods: Improving Performance and Applicability. In Proceedings of International Conference on Data Engineering, Los Angeles, 1986.Google Scholar
  15. [15]
    J. Robinson. Design of Concurrency Controls for Transaction Processing Systems, Ph.D. Thesis, Computer Science Department, Carnegie Mellon University, 1982.Google Scholar
  16. [16]
    L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Transactions on Computers, 39(9)1175–1185, September 1990.CrossRefGoogle Scholar
  17. [17]
    S. H. Son, J. Lee, and Y. Lin. Hybrid Protocols Using Dynamic Adjustment of Serialization Order for Real-Time Concurrency Control. The Journal of Real-Time Systems, 4:269–276, 1992.CrossRefGoogle Scholar

Copyright information

© British Computer Society 1996

Authors and Affiliations

  • Piotr Krzyżagórski
    • 1
  • Tadeusz Morzy
    • 1
  1. 1.Institute of Computing SciencePozńa University of TechnologyPozńaPoland

Personalised recommendations