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)
The commercial INGRES epilogue
The INGRES papers: anatomy of a relational database system
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
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Performance analysis of centralized databases with optimistic concurrency control
Performance Evaluation
Analysis of affinity based routing in multi-system data sharing
Performance Evaluation
The Delay Due to Dynamic Two-Phase Locking
IEEE Transactions on Software Engineering
Concurrency control in distributed database systems
Concurrency control in distributed database systems
The effect of skewed data access on buffer hits and data contention in a data sharing environment
Proceedings of the sixteenth international conference on Very large databases
A hybrid Distributed Centralized System Structure for Transaction Processing
IEEE Transactions on Software Engineering
Performance Analysis of Two-Phase Locking
IEEE Transactions on Software Engineering
Conflict detection tradeoffs for replicated data
ACM Transactions on Database Systems (TODS)
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
IEEE Transactions on Software Engineering
On the analytical modeling of database concurrency control
Journal of the ACM (JACM)
Analysis of some optimistic concurrency control schemes based on certification
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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)
On the modeling of parallel access to shared data
Communications of the ACM
Analysis of locking policies in database management systems
Communications of the ACM
Benchmark Handbook: For Database and Transaction Processing Systems
Benchmark Handbook: For Database and Transaction Processing Systems
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Queueing network models for concurrent transaction processing in a database system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Tradeoffs Between Coupling Small and Large Processors for Transaction Processing
IEEE Transactions on Computers
Analysis of Replication in Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Buffer Coherency Policies in a Multisystem Data Sharing Environment
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the Fourth International Conference on Data Engineering
Database Buffer Model for the Data Sharing Environment
Proceedings of the Sixth International Conference on Data Engineering
Concurrency control performance issues
Concurrency control performance issues
A mean value performance model for locking in databases
A mean value performance model for locking in databases
Deferred locking with shadow transaction for client-server DBMSs
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
The concurrency control (CC) method employed can be critical to the performance of transaction processing systems. Conventional locking suffers from the blocking phenomenon, where waiting transactions continue to hold locks and block other transactions from progressing. In a high data contention environment, as an increasing number of transactions wait, a larger number of lock requests get blocked and fewer lock requests can get through. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. By properly balancing the blocking and abort effects, the proposed scheme can lead to better performance than either the conventional locking or the optimistic concurrency control (OCC) schemes at all data and resource contention levels. We consider both static and dynamic approaches to determine when to switch from the nonblocking phase to the blocking phase. An analytical model is developed to estimate the performance of this scheme and determine the optimal operating or switching point. The accuracy of the analytic model is validated through a detailed simulation.