A Queueing Network Model for a Distributed Database Testbed System
IEEE Transactions on Software Engineering
The Delay Due to Dynamic Two-Phase Locking
IEEE Transactions on Software Engineering
A Recursive Solution Method to Analyze the Performance of Static Locking Systems
IEEE Transactions on Software Engineering
Analysis of database performance with dynamic locking
Journal of the ACM (JACM)
Modeling hot spots in database systems (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Two-phase locking performance and its thrashing behavior
ACM Transactions on Database Systems (TODS)
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Performance analysis of dynamic locking
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
Shared Memory Contention and Its Impact on Multi-processor Call Control Throughput
Performance Engineering, State of the Art and Current Trends
Database system performance evaluation models: A survey
Performance Evaluation
| Hi-index | 0.00 |
The performance of transaction processing systems is determined by the contention for hardware as well as software resources (database locks), due to the concurrency control mechanism of the database being accessed by transactions. We consider a transaction processing system with a set of dominant transcation classes. Each class needs to acquire a certain subset of the locks in the database before it can be processed, i.e., predeclared lock requests with static locking. Straightforward application of the decomposition method requires the numerical solution of a two-dimensional Markov chain. Equivalently, a hierarchical simulation method, where the computer system is represented by a composite queue with exponential service rates, can be used to analyze the system. We propose an inexpensive analytic solution method, also based on hierarchical decomposition, such that the throughput of the computer system ic characterized by the number of active transactions (regardless of class). Numerical results are provided to show that the new method is adequately accurate compared to the other two rather costly methods. It can be used to determine the effect of granularity of locking on system performance. The solution method is also applicable to multiresource queueing systems with multiple contention points.