Analysis of Concurrency Control Protocols for Real-Time Database Systems

Abstract This paper provides an approximate analytic solution method for evaluating the performance of concurrency control protocols developed for real-time database systems (RTDBSs). Transactions processed in a RTDBS are associated with timing constraints typically in the form of deadlines. The primary consideration in developing a RTDBS concurrency control protocol is the fact that satisfaction of the timing constraints of transactions is as important as maintaining the consistency of the underlying database. The proposed solution method provides the evaluation of the performance of concurrency control protocols in terms of the satisfaction rate of timing constraints. As a case study, a RTDBS concurrency control protocol, called High Priority, is analyzed using the proposed method. The accuracy of the performance results obtained is ascertained via simulation. The solution method is also used to investigate the real-time performance benefits of the High Priority over the ordinary Two-Phase Locking.

[1]  Donald F. Towsley,et al.  Experimental evaluation of real-time transaction processing , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[2]  Lui Sha,et al.  A Real-Time Locking Protocol , 1991, IEEE Trans. Computers.

[3]  Le Gruenwald,et al.  A performance study of concurrency control in a real-time main memory database system , 1993, SGMD.

[4]  DogacAsuman,et al.  An Optimistic Locking Technique for Concurrency Control in Distributed Databases , 1991 .

[5]  Erol Gelenbe,et al.  On the modeling of parallel access to shared data , 1983, CACM.

[6]  Özgür Ulusoy.  Research Issues in Real-Time Database Systems , 1995, Inf. Sci..

[7]  Gultekin Özsoyoglu,et al.  Temporal and Real-Time Databases: A Survey , 1995, IEEE Trans. Knowl. Data Eng..

[8]  Yi Lin,et al.  An integrated real-time locking protocol , 1992, [1992] Eighth International Conference on Data Engineering.

[9]  Vlad Ingar Wietrzyk,et al.  Real-Time Transaction Scheduling in Database Systems , 1996, DEXA.

[10]  Y. C. Tay,et al.  Some performance issues for transactions with firm deadlines , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[11]  Sheung-lun Hung,et al.  Concurrency Control for Time-Constrained Transactions in Distributed Databases Systems , 1995, Comput. J..

[12]  Alexander Thomasian,et al.  A decomposition solution to the queueing network model of the centralized DBMS with static locking , 1983, SIGMETRICS '83.

[13]  Mukesh Singhal.  Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems , 1991, IEEE Trans. Knowl. Data Eng..

[14]  Hector Garcia-Molina,et al.  Scheduling real-time transactions: a performance evaluation , 1988, TODS.

[15]  Krithi Ramamritham,et al.  The integration of deadline and criticalness in hard real-time scheduling , 1988, Proceedings. Real-Time Systems Symposium.

[16]  Miron Livny,et al.  Concurrency control performance modeling: alternatives and implications , 1987, TODS.

[17]  M. Tamer Özsu.  Performance Comparison of Distributed vs. Centralized Locking Algorithms in Distributed Database Systems , 1985, ICDCS.

[18]  Ugur Halici,et al.  An Optimistic Locking Technique For Concurrency Control in Distributed Databases , 1991, IEEE Trans. Software Eng..

[19]  Cory Devor,et al.  Structural locking mechanisms and their effect on database management system performance , 1982, Inf. Syst..

[20]  Philip S. Yu,et al.  Performance comparison of concurrency control protocols for transaction processing systems with regional locality , 1989, Proceedings of the Eighth Symposium on Reliable Distributed Systems.

[21]  Kwok-Wa Lam,et al.  An Efficient Real-time Optimistic Concurrency Control Protocol , 1995, ARTDB.

[22]  Philip S. Yu,et al.  Proceedings of the Eleventh International Conference on Data Engineering , 1995 .

[23]  Özgür Ulusoy.  An approximate analysis of a real-time database concurrency control protocol via Markov modeling , 1993, PERV.

[24]  Paula Hawthorn.  Proceedings of the Sixth Berkeley Workshop on Distributed Data Management and Computer Networks, Asilomar, February 16-19, 1982 , 1982, Berkeley Workshop.

[25]  Miron Livny,et al.  Dynamic real-time optimistic concurrency control , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[26]  Jerry Nolte,et al.  Performance of Two Phase Locking , 1982, Berkeley Workshop.

[27]  David J. DeWitt,et al.  Proceedings of the Fourteenth International Conference on Very Large Data Bases , 1988 .

[28]  Özgür Ulusoy,et al.  Real-time lock-based concurrency control in distributed database systems , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[29]  Y. C. Tay,et al.  Locking performance in centralized databases , 1985, TODS.

[30]  Alexander Thomasian.  Performance limits of two-phase locking , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[31]  Mukesh Singhal,et al.  Performance Analysis of the Basic Timestamp Ordering Algorithm via Markov Modeling , 1991, Perform. Evaluation.

[32]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..

[33]  Jayant R. Haritsa.  Approximate analysis of real-time database systems , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.