Limitations of concurrency in transaction processing
ACM Transactions on Database Systems (TODS)
A mean value performance model for locking in databases: the no-waiting case
Journal of the ACM (JACM)
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)
Performance analysis of centralized databases with optimistic concurrency control
Performance Evaluation
Locking performance in centralized databases
Locking performance in centralized databases
Analysis of database performance with dynamic locking
Journal of the ACM (JACM)
Performance Analysis of Dynamic Locking with the No-Waiting Policy
IEEE Transactions on Software Engineering
Performance Analysis of Two-Phase Locking
IEEE Transactions on Software Engineering
Performance analysis of the basic timestamp ordering algorithm via Markov modeling
Performance Evaluation
Centralized concurrency control methods for high-end TP
ACM SIGMOD Record
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Performance evaluation of cautious waiting
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
On the modeling of parallel access to shared data
Communications of the ACM
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
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
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Two-phase locking performance and its thrashing behavior
ACM Transactions on Database Systems (TODS)
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 Concurrency Control Based on Limited Wait-Depth
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Hi-index | 0.00 |
The performance of a transaction processing system with the standard two-phase locking (2PL) concurrency control (CC) method (with the general waiting policy upon a lock conflict) may be degraded significantly due to transaction blocking in a high lock contention environment. In the limit this effect leads to the thrashing phenomenon, i.e., the majority of the transactions in the system become blocked. Limiting the wait depth of blocked transactions is an effective method to increase the number of active transactions in the system and to prevent thrashing, but this is at the cost of additional processing due to transaction restarts. The no-waiting (or immediate restart) policy limits the wait-depth to zero, while cautious waiting and the running priority policies use different methods to limit the wait depth to one. A variant of the wait depth limited (WDL) policy [8] also limits the wait depth to one, while attempting to minimize the wasted processing incurred by transaction aborts. A unified methodology to analyze the performance of the 2PL CC method with limited wait depth policies in a system with multiple transaction classes is described in this paper. The analysis is based on Markov chains representing the execution steps of each transaction in isolation, but as affected by hardware resource and data contention with other transactions in the system. Since the transition rates of the Markov chain are not known a priori, an iterative solution method is developed, which is then applied to the running priority and WDL policies. Simulation is used for validating the accuracy of the approximate analytic solutions. Of interest are the conservation laws governing the rate at which locks are transferred among transactions, which can be used to verify the correctness of the analysis.