On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
The distribution of granule accesses made by database transactions
Communications of the ACM
Analysis of locking policies in database management systems
Communications of the ACM
Performance evaluation of two concurrency control mechanisms in a distributed database system
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Process structuring, synchronization, and recovery using atomic actions
Proceedings of an ACM conference on Language design for reliable software
Performance of update algorithms for replicated data in a distributed database.
Performance of update algorithms for replicated data in a distributed database.
Concurrency control performance issues
Concurrency control performance issues
Modeling and evaluation of database concurrency control algorithms
Modeling and evaluation of database concurrency control algorithms
Transactions: a construct for reliable distributed computing
ACM SIGOPS Operating Systems Review
Optimistic concurrency control for abstract data types
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Optimistic concurrency control for abstract data types
ACM SIGOPS Operating Systems Review
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
A Queueing Network Model for a Distributed Database Testbed System
IEEE Transactions on Software Engineering
AGM: a dataflow database machine
ACM Transactions on Database Systems (TODS)
A Recursive Solution Method to Analyze the Performance of Static Locking Systems
IEEE Transactions on Software Engineering
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
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
An Optimistic Locking Technique for Concurrency Control in Distributed Databases
IEEE Transactions on Software Engineering
Modeling hot spots in database systems (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Some further analysis of the essential blocking recurrence
ACM SIGMOD Record
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Analysis of Hybrid Concurrency Control Schemes for a High Data Contention Environment
IEEE Transactions on Software Engineering
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
An approach to eliminate transaction blocking in locking protocols
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the analytical modeling of database concurrency control
Journal of the ACM (JACM)
Two-phase locking performance and its thrashing behavior
ACM Transactions on Database Systems (TODS)
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Load control for locking: the “half-and-half” approach
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ANSS '92 Proceedings of the 25th annual symposium on Simulation
An approximation of the processing time for a random graph model of parallel computation
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Value-based scheduling in real-time database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Locking Performance in a Shared Nothing Parallel Database Machine
IEEE Transactions on Knowledge and Data Engineering
Modeling and Analysis of a Time-Stamp History Based Certification Protocol for Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Checkpointing for Optimistic Concurrency Control Methods
IEEE Transactions on Knowledge and Data Engineering
Divergence Control Algorithms for Epsilon Serializability
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
Distributed Concurrency Control Based on Limited Wait-Depth
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Concurrency Control Using Locking with Deferred Blocking
IEEE Transactions on Software Engineering
Measured Performance of Time Interval Concurrency Control Techniques
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Performance Evaluation of an Operating System Transaction Manager
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Adaptive Load Control in Transaction Processing Systems
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
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 |
Given the pairwise probability of conflict p among transactions in a transaction processing system, together with the total number of concurrent transactions n, the effective level of concurrency E(n,p) is defined as the expected number of the n transactions that can run concurrently and actually do useful work. Using a random graph model of concurrency, we show for three general classes of concurrency control methods, examples of which are (1) standard locking, (2) strict priority scheduling, and (3) optimistic methods, that (1) E(n, p) ⩽ n(1 - p/2)n-1, (2) E(n, p) ⩽ (1 - (1 - p)n)/p, and (3) 1 + ((1 - p)/p)ln(p(n - 1) + 1) ⩽ E(n, p) ⩽ 1 + (1/p)ln(p(n - 1) + 1). Thus, for fixed p, as n ↣ ∞), (1) E ↣ 0 for standard locking methods, (2) E ⩽ 1/p for strict priority scheduling methods, and (3) E ↣ ∞ for optimistic methods. Also found are bounds on E in the case where conflicts are analyzed so as to maximize E.The predictions of the random graph model are confirmed by simulations of an abstract transaction processing system. In practice, though, there is a price to pay for the increased effective level of concurrency of methods (2) and (3): using these methods there is more wasted work (i.e., more steps executed by transactions that are later aborted). In response to this problem, three new concurrency control methods suggested by the random graph model analysis are developed. Two of these, called (a) running priority and (b) older or running priority, are shown by the simulation results to perform better than the previously known methods (l)-(3) for relatively large n or large p, in terms of achieving a high effective level of concurrency at a comparatively small cost in wasted work.