CART: A Real-Time Concurrency Control Protocol

Abstract

The Two Phase Locking with High Priority (2PL-HP) concurrency control protocol addresses the transaction scheduling issue in a distributed real-time database system (DRTDBS). Although the 2PL-HP protocol is free from priority inversion, it may suffer from the problems such as deadlock, cyclic restart, and starvation of lengthy transactions. In this paper, a Controlled Avoidance of deadlock and starvation causing Resourceful Conflict resolution between Transactions (CART) concurrency control protocol has been proposed to minimize the transactions miss percentage by reducing the wastage of system resources through avoiding the deadlock due to controlled locking and starvation to some extent by ensuring a fairness in the allocation of resources for their completion. DRTDBS is simulated and CART outperforms as compared with previous other protocols.