Locking protocols for concurrency control in real-time database systems

Authors:
S. L. Hung;K. Y. Lam
Affiliations:
-;-
Venue:
ACM SIGMOD Record
Year:
1992

Citing 8
Cited 4

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Concurrency control performance modeling: alternatives and implications

ACM Transactions on Database Systems (TODS)
Issues and approaches to design of real-time database systems

ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Concurrency control for distributed real-time databases

ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Concurrency control for high contention environments

ACM Transactions on Database Systems (TODS)
Sources of unbounded priority inversions in real-time systems and a comparative study of possible solutions

ACM SIGOPS Operating Systems Review
Time-Critical Database Scheduling: A Framework For Integrating Real-Time Scheduling and Concurrency Control

Proceedings of the Fifth International Conference on Data Engineering
Scheduling Real-time Transactions: a Performance Evaluation

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases

A performance study of concurrency control in a real-time main memory database system

ACM SIGMOD Record
On Using Real-Time Static Locking Protocols for DistributedReal-Time Databases

Real-Time Systems
A Collaborative Environment Based on Distributed Object-Oriented Databases

WET-ICE '95 Proceedings of the 4th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET-ICE'95)
Performance of distributed optimistic concurrency control in real-time databases

CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrency Control in real-time database systems is complicated by the requirement to maintain database consistency at the same time to minimize the number of transactions missing their deadlines. The scheduling of data in Basic Two Phase Locking (2PL) completely ignores the urgency of a transaction and thus the effectiveness of the adopted real-time resource scheduling protocol is greatly reduced. In Restart based locking protocols (R2PL), same priorities are used for both data and resources scheduling and should have fewer transactions missing their deadlines. However, Restart based protocols sufferred the intrinsic weakness of high restart overhead owing to ensure atomicity of transactions. In this paper, based on their weaknesses, a hybrid concurrency control protocol (H2PL) is proposed. Through performance study, results indicate that it can perform well under different degree of deadline constraint and workload as compared with other real-time locking protocols.