CART: A Real-Time Concurrency Control Protocol
CART: A Real-Time Concurrency Control Protocol
复制标题
CART：实时并发控制协议
DOI：
10.1145/3216122.3216161
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Udai Shanker
中科院分区：
文献类型：
--
作者：
Sarvesh Pandey;Udai Shanker
高优先级两阶段锁（2 PL-HP）并发控制协议解决了分布式实时数据库系统（DRTDBS）中的事务调度问题。虽然2 PL-HP协议没有优先级反转，但它可能会遭受死锁，循环重启和长事务饥饿等问题。本文提出了一种受控避免死锁和饥饿导致事务间资源冲突解决（CART）并发控制协议，通过避免由于受控锁定和饥饿而导致的死锁，在一定程度上减少系统资源的浪费，从而最大限度地减少事务未命中率。通过确保完成资源分配的公平性。DRTDBS是模拟和CART优于以前的其他协议相比。
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.