Distributed concurrency control based on limited wait-depth

The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 1993-11, Vol.4 (11), p.1246-1264
Main Authors: Franaszek, P.A., Haritsa, J.R., Robinson, J.T., Thomasian, A.
Format: Article
Language:English
Subjects:
Applied sciences
Bandwidth
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Concurrency control
Concurrent computing
Costs
Decision making
Distributed databases
Exact sciences and technology
Hardware
Software
System recovery
Tin
Transaction databases
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothing system more severely than that of a centralized system due to increased lock holding times. Deadlock detection and resolution are an added complicating factor in shared-nothing systems. The authors describe distributed Wait-Depth Limited (WDL) concurrency control (CC), a locking-based distributed CC method that limits the wait-depth of blocked transactions to one, thus preventing the occurrence of deadlocks. Several implementations of distributed WDL which vary in the number of messages and the amount of information available for decision making are discussed. The performance of a generic implementation of distributed WDL is compared with distributed 2PL (with general-waiting policy) and the Wound-Wait CC method through a detailed simulation. It is shown that distributed WDL behaves similarly to 2PL for low lock contention levels, but for substantial lock contention levels (caused by higher degrees of transaction concurrency), distributed WDL outperforms the other methods to a significant degree.< >
ISSN:1045-9219
1558-2183
DOI:10.1109/71.250103