Observations on optimistic concurrency control schemes
Information Systems - Special issue: Databases:8Mtheir creation, management and utilization
Limitations of concurrency in transaction processing
ACM Transactions on Database Systems (TODS)
Locking performance in centralized databases
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
A Performance Comparison of Multimicro and Mainframe Database Architectures
IEEE Transactions on Software Engineering
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Performance Analysis of Two-Phase Locking
IEEE Transactions on Software Engineering
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Performance analysis of locking policies with limited wait depth
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Locking Performance in a Shared Nothing Parallel Database Machine
IEEE Transactions on Knowledge and Data Engineering
Determining the Number of Remote Sites Accessed in Distributed Transaction Processing
IEEE Transactions on Parallel and Distributed Systems
Access Invariance and Its Use in High Contention Environments
Proceedings of the Sixth International Conference on Data Engineering
Performance Limits of Two-Phase Locking
Proceedings of the Seventh International Conference on Data Engineering
Wait Depth Limited Concurrency Control
Proceedings of the Seventh International Conference on Data Engineering
Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Checkpointing for Optimistic Concurrency Control Methods
IEEE Transactions on Knowledge and Data Engineering
A Performance Comparison of Locking Methods with Limited Wait Depth
IEEE Transactions on Knowledge and Data Engineering
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
Performance Studies of Shared-Nothing Parallel Transaction Processing Systems
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
A New Look at Timestamp Ordering Concurrency Control
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
A General Stochastic Model for Dynamic Locking in Database Systems
IEEE Transactions on Computers
Multi-level RAID for very large disk arrays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
| Hi-index | 0.00 |
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.