Optimistic concurrency control in firm real-time databases

Authors:
Anand S. Jalal;S. Tanwani;A. K. Ramani
Affiliations:
School of Computer Science, Devi Ahilya University, Indore, India;School of Computer Science, Devi Ahilya University, Indore, India;School of Computer Science, Devi Ahilya University, Indore, India
Venue:
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Year:
2005

Citing 6
Cited 0

Real-time databases

Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Concurrency control algorithms for real-time database systems

Concurrency control algorithms for real-time database systems
An overview of real-time database systems

Advances in real-time systems
Is a Bird in the Hand Worth More than Two in the Bush? Limitations of Priority Cognizance in Conflict Resolution for Firm Real-Time Database Systems

IEEE Transactions on Computers
Dynamic Adjustment of Serialization Order Using Timestamp Intervals in Real-Time Databases

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Using importance of transactions and optimistic concurrency control in firm real-time databases

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrency control algorithms for real-time database systems satisfy not only consistency requirements but also meet transaction-timing constraints. Two Phase Locking (2PL) is used often in traditional database systems. However, it has some inherent problems such as the possibility of deadlocks as well as long and unpredictable blocking times. Optimistic concurrency control protocols are non-blocking and deadlock free, but they have the problems of late conflict detection and transaction restarts. Other Concurrency Control techniques, such as Dynamic Adjustment of Serialization Order (DASO) have been found to be better at reducing number of transaction restarts. In this paper, we propose a new optimistic concurrency control algorithm based on DASO using firm deadline in order to effectively reduce number of unnecessary restarts. Since firm real time transaction imparts no value to the system once its deadline expires, therefore in our algorithm, we adjust the timestamp intervals of all conflicting active transactions only after the validating transaction is guaranteed to meet its deadline during the validation phase. A simulator is designed to verify the effectiveness of the proposed method. The simulation results show that the proposed method can significantly reduce the number of unnecessary restarts and thereby improve the miss ratio, commit ratio.