On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Analysis of locking policies in database management systems
Communications of the ACM
Performance of Concurrency Control Algorithms with Nonexclusive Access
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Design of concurrency controls for transaction processing systems
Design of concurrency controls for transaction processing systems
Modeling and evaluation of database concurrency control algorithms
Modeling and evaluation of database concurrency control algorithms
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Performance Analysis of Dynamic Locking with the No-Waiting Policy
IEEE Transactions on Software Engineering
Analysis of Hybrid Concurrency Control Schemes for a High Data Contention Environment
IEEE Transactions on Software Engineering
On the analytical modeling of database concurrency control
Journal of the ACM (JACM)
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Concurrency Control Using Locking with Deferred Blocking
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Optimistic Concurrency Control-OCC schemes based on certification are analyzed in this paper. We allow two types of data access schemes referred to as static and dynamic. According to the first (second) scheme a transaction reads all the required data items at the beginning of its processing (on demand during its processing), respectively. After completing its processing, each transaction is checked as to whether it has encountered a data conflict. Validated transactions commit; otherwise, they are restarted. A variant of the regular (silent) commit scheme where a committing transaction notifies conflicted transactions to restart immediately (broadcast commit scheme) is also considered. We use an iterative method to analyze the performance of OCC schemes in the framework of a system with a fixed number of transactions in multiple classes with given probabilities for their occurrence. The iterative method is validated against simulation and shown to be highly accurate even for high data contention. We present graphs/tables, which are used to determine how system performance is affected by: (i) various OCC schemes, (ii) transaction size, i.e., number of data items accessed, (iii) number of transactions, (iv) the distribution of transaction processing time requirements, (v) the throughput characteristic of the system, and (vi) granule placement.