A hybrid distributed optimistic concurrency control method for high-performance real-time transaction processing

Authors:
Biao Qin;Yun Sheng Liu
Affiliations:
College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, P.R. China;College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2003

Citing 7
Cited 0

Concurrency control for high contention environments

ACM Transactions on Database Systems (TODS)
Analysis of Hybrid Concurrency Control Schemes for a High Data Contention Environment

IEEE Transactions on Software Engineering
Scheduling real-time transactions: a performance evaluation

ACM Transactions on Database Systems (TODS)
The PROMPT Real-Time Commit Protocol

IEEE Transactions on Parallel and Distributed 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
Transaction Scheduling in Distributed Real-Time Systems

Real-Time Systems
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conventional lock scheme tends to suffer from a cascade of blockings, while the optimistic concurrency control (OCC) scheme may suffer from wasting resources. To overcome these problems, some researchers have proposed a combination of OCC and lock in transaction processing. Using this method, Thomasian proposed the hybrid method for conventional distributed transaction processing, and Lam proposed the DOCC-DA protocol for distributed real-time database system based on forward validation. This paper proposes a new protocol, called Hybrid Distributed Optimistic Concurrency Control Embedded in two-Phase Commit, which is based on back validation. The new protocol makes use of access invariance and runtime information which can guarantee a rerun transaction to meet its deadline and abort the fruitless run transactions as early as possible. A series of simulation experiments have been done to investigate the performance of the new protocol. The results show that its performance is consistently better than that of other protocols.