Limitations of concurrency in transaction processing
ACM Transactions on Database Systems (TODS)
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Concurrency control in real-time database systems
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
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
Data access scheduling in firm real-time database systems
Real-Time Systems - Special issue: real-time databases
Priority inheritance in soft real-time databases
Real-Time Systems - Special issue: real-time databases
Shoring up persistent applications
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
A Performance Comparison of Locking Methods with Limited Wait Depth
IEEE Transactions on Knowledge and Data Engineering
Data page layouts for relational databases on deep memory hierarchies
The VLDB Journal — The International Journal on Very Large Data Bases
Wait Depth Limited Concurrency Control
Proceedings of the Seventh International Conference on Data Engineering
Scheduling Real-time Transactions: a Performance Evaluation
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Priority Mechanisms for OLTP and Transactional Web Applications
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Selective early request termination for busy internet services
Proceedings of the 15th international conference on World Wide Web
Tolerating Dependences Between Large Speculative Threads Via Sub-Threads
Proceedings of the 33rd annual international symposium on Computer Architecture
Tail asymptotics for policies favoring short jobs in a many-flows regime
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review
Incrementally parallelizing database transactions with thread-level speculation
ACM Transactions on Computer Systems (TOCS)
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling and exploiting query interactions in database systems
Proceedings of the 17th ACM conference on Information and knowledge management
Interaction-aware scheduling of report-generation workloads
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
OLTP and transactional workloads are increasingly common in computer systems, ranging from e-commerce to warehousing to inventory management. It is valuable to provide priority scheduling in these systems, to reduce the response time for the most important clients, e.g. the "big spenders". Two-phase locking, commonly used in DBMS, makes prioritization difficult, as transactions wait for locks held by others regardless of priority. Common lock scheduling solutions, including non-preemptive priority inheritance and preemptive abort, have performance drawbacks for TPC-C type workloads. The contributions of this paper are two-fold: (i) We provide a detailed statistical analysis of locking in TPC-C workloads with priorities under several common preemptive and non-preemptive lock prioritization policies. We determine why non-preemptive policies fail tosufficiently help high-priority transactions, and why pre-emptive policies excessively hurt low-priority transactions. (ii) We propose and implement a policy, POW, that provides all the benefits of preemptive prioritization without its penalties.