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
The Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
IEEE Transactions on Software Engineering
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
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Performance evaluation of cautious waiting
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
Two-phase locking performance and its thrashing behavior
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Modeling performance impact of hot spots
Performance of concurrency control mechanisms in centralized database systems
A more realistic locking model and its analysis
Information Systems
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
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Operating Systems Theory
Performance Evaluation of a Threshold Policy for Scheduling Readers and Writers
IEEE Transactions on Computers
The Performance of Protocols Based on Locks with Ordered Sharing
IEEE Transactions on Knowledge and Data Engineering
Checkpointing for Optimistic Concurrency Control Methods
IEEE Transactions on Knowledge and Data Engineering
Distributed Concurrency Control Based on Limited Wait-Depth
IEEE Transactions on Parallel and Distributed Systems
Concurrency Control of Bulk Access Transactions on Shared Nothing Parallel Database Machines
Proceedings of the Sixth International Conference on Data Engineering
Characterization of Contention in Real Relational
Characterization of Contention in Real Relational
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
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
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Hi-index | 0.00 |
A number of recent studies have proposed lock conflict resolution methods to improve the performance of standard locking, i.e., strict two-phase locking with the general waiting method. This paper is primarily concerned with the performance of wait depth limited methods with respect to each other and some other methods. The methods considered include the general waiting, wound-wait, and no-waiting methods, symmetric and asymmetric versions of cautious waiting and running priority methods, the wait depth limited (WDL) method, and a modified version of it. In spite of the availability of analytic solutions for most of wait depth limited methods, for reasons given in the paper, the performance comparison is based on simulation results. The contributions of this study are as follows: 1) modeling assumptions, i.e., a careful definition of transaction restart options; 2) new results concerning the relative performance of wait depth limited methods, which show that a) the running priority method outperforms cautious waiting and may even outperform the WDL method in a system with limited hardware resource, b) WDL outperforms other methods in high lock contention, high capacity systems, and c) modified WDL has a performance comparable to WDL, but incurs less overhead in selecting the abort victim; and 3) contrary to common belief, Tay's Effective Database Size Paradigm for dealing with shared and exclusive locks and/or skewed database accesses in standard locking is applicable to some wait depth limited methods and provides acceptably accurate approximations in others驴as long as locking modes for restarted transactions are not resampled.