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 performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Locking performance in centralized databases
Locking performance in centralized databases
An introduction to database systems (7th ed.)
An introduction to database systems (7th ed.)
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)
Corrigendum: `` Mean-Value Analysis of Closed Multichain Queuing Networks''
Journal of the ACM (JACM)
On the modeling of parallel access to shared data
Communications of the ACM
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A decomposition solution to the queueing network model of the centralized DBMS with static locking
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer 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
Analysis of database performance with dynamic locking
Journal of the ACM (JACM)
Concurrency control for high contention environments
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)
Quasi-dynamic two-phase locking
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
A Performance Comparison of Locking Methods with Limited Wait Depth
IEEE Transactions on Knowledge and Data Engineering
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
A New Look at Timestamp Ordering Concurrency Control
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Asynchronous Operations in Distributed Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Performance modeling of nested transactions in database systems
CASCON '00 Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research
A General Stochastic Model for Dynamic Locking in Database Systems
IEEE Transactions on Computers
Performance considerations of embedded computations in distributed databases
Journal of Embedded Computing
Elimination of non-deterministic delays in a real-time database system
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Variance estimation of locking performance
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |
A transaction processing system with two-phase dynamic locking with the no waiting policy (DLNW) for concurrency control is considered. In this method, transactions making conflicting lock requests are aborted and restarted rather than blocked, thereby eliminating blocking delays (and deadlocks), but making it susceptible to cyclic restarts. Cyclic restarts are dealt with by delaying the restart of a transaction encountering a lock conflict or replacing it with a new transaction. Analytic solution methods for evaluating the performance of the variants of the DLNW method are described. The analytic methods, validated against simulation and shown to be acceptably accurate, are used to study the effect of the following parameters on system performance: transaction size and its distribution, degree of concurrency, the throughput characteristic of the computer system, and the mixture of read-only query and update transactions. A comparison of the DLNW and dynamic locking with waiting (DLW) methods shows that DLW provides higher throughput than DLNW, except when there is no hardware resource contention and conflicted transactions can be replaced by new transactions. The DLNW method outperforms the time-stamp ordering method, as observed from simulation results as well as case by case analyses of possible scenarios.