Value-based scheduling in real-time database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Scheduling real-time transactions with dynamic values: a performance evaluation
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
ESCC: a new deadline-driven extension of the SCC protocol
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
| Hi-index | 0.00 |
The two-phase locking approach widely used for concurrency control in database systems have some inherent disadvantages such as deadlock and unpredictable blocking time. These appear to be serious problems with respect to real-time transaction processing, since in a real-time environ- ment transactions need to meet their time constraints as well as their consistency requirements. Integrated with CPU scheduling, we investigate an optimistic concurrency control approach for real- time transaction processing, which possesses the properties of deadlock freedom and predictable blocking time. We also give solutions to the problem of transaction starvation. The proposed optimistic concurrency control scheme is implemented on a real-time database testbed. The per- formance results show that the optimistic scheme outperforms two-phase locking even when the system is CPU bound.