Using delayed commitment in locking protocols for real-time databases

In this paper, we propose locking protocols that are useful for real-time databases. Our approach is motivated from two main observations. First, locking protocols are widely accepted and used in most database systems. Second, in real-time databases it has been shown that the blocking behavior of transactions in locking protocols results in performance degradation. We use a new relationship between locks called ordered sharing to eliminate blocking that arises in the traditional locking protocols. Ordered sharing eliminates blocking of read and write operations but may result in delayed commitment. Since in real-time databases, timeliness and not response time is the crucial factor, or protocols exploit this delay to allow transactions to execute within the slacks of delayed transactions. We compare the performance of the proposed protocols with the two phase locking protocol for real-time databases. Our experiments indicate that the propose protocols significantly reduce the percentage of missed deadlines in the system for a variety of workloads.

[1]  Andreas Reuter,et al.  Principles of transaction-oriented database recovery , 1983, CSUR.

[2]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

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

[4]  Hector Garcia-Molina,et al.  Scheduling Real-Time Transactions with Disk Resident Data , 1989, VLDB.

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

[6]  Miron Livny,et al.  On being optimistic about real-time constraints , 1990, PODS '90.

[7]  Donald F. Towsley,et al.  Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes , 1991, VLDB.

[8]  Divyakant Agrawal,et al.  Locks with constrained sharing , 1990, PODS 1990.

[9]  Divyakant Agrawal,et al.  Locks with constrained sharing (extended abstract) , 1990, PODS '90.

[10]  Guy M. Lohman,et al.  Proceedings of the 17th International Conference on Very Large Data Bases , 1991, VLDB 1991.

[11]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[12]  Yi Lin,et al.  Concurrency control in real-time databases by dynamic adjustment of serialization order , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[13]  Divyakant Agrawal,et al.  Performance characteristics of protocols with ordered shared locks , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[14]  Vassos Hadzilacos,et al.  A theory of reliability in database systems , 1988, JACM.

[15]  J CareyMichael,et al.  Concurrency control performance modeling: alternatives and implications , 1987 .

[16]  Umeshwar Dayal,et al.  Time-critical database scheduling: a framework for integrating real-time scheduling and concurrency control , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[17]  Daniel J. Rosenkrantz,et al.  Distributed database concurrency controls using before-values , 1981, SIGMOD '81.

[18]  Hamid Pirahesh,et al.  ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging , 1998 .

[19]  Michael J. Carey.  Modeling and Evaluation of Database Concurrency Control Algorithms , 1983 .

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

[21]  Rudolf Bayer,et al.  Parallelism and recovery in database systems , 1980, TODS.

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