Pierangelo Di Sanzo
Francesco Quaglia
ABSTRACT
Nowadays the 2-Phase-Locking (2PL) concurrency control algorithm still plays a core rule in the construction of transactional systems (e.g. database systems and transactional memories). Hence, any technique allowing accurate analysis and prediction of the performance of 2PL based systems can be of wide interest and applicability. In this article we present an accurate analytical model of 2PL concurrency control, which overcomes several limitations of preexisting analytical results. In particular our model captures relevant features of realistic data access patterns, by taking into account access distributions that depend on transactions' execution phases. Also, our model provides significantly more accurate performance predictions in heavy contention scenarios, where the number of transactions enqueued due to conflicting lock requests is expected to be non-minimal. The accuracy of our model has been verified against simulation results based on both synthetic data access patterns and patterns derived from the TPC-C benchmark.
- http://www.dis.uniroma1.it/pub/quaglia/2plsimulator--plus--modelsolver.tar.gz.Google Scholar
- K.A. Merchant, P. Yu, and M. Chen. Performance analysis of dynamic finite versioning for concurrent transaction and query processing. ACM SIGMETRICS Performance Evaluation Review, 20(1), June 1992. Google ScholarDigital Library
- R. Agrawal, M.J. Carey, and M. Livny. Concurrency control performance modeling: Alternatives and implications. ACM Transactions on Database Systems, 12(4), December 1987. Google ScholarDigital Library
- N. Al-Jumaha, H. Hassaneinb, and M. El-Sharkawia. Implementation and modeling of two-phase locking concurrency. Information and Software Technology, 42(4):257--273, March 2000. Elsevier Science.Google ScholarCross Ref
- R. Balter, P. Berard, and P. Decitre. Why control of the concurrency level in distributed systems is more fundamental than deadlock management. In Proceedings of the First ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Ottawa, Canada, pages 183--193. ACM New York, NY, USA, 1982. Google ScholarDigital Library
- B. Ciciani, D.M. Dias, and P.S. Yu. Analysis of concurrency-coherency control protocols for distributed transaction processing systems with regional locality. IEEE Transactions on Software Engineering, Volume 18(10):pp. 899--914, October 1992. Google ScholarDigital Library
- B. Ciciani, D.M. Dias, and P.S. Yu. Dynamic and static load sharing in hybrid distributed-centralized systems. Computer Systems Science and Engineering, Volume 7(1):pp. 25--41, January 1992. Google ScholarDigital Library
- H. Berenson, P. Bernstein, J. Gray, J. Melton, E. O'Neil, and P. O'Neil. A critique of ANSI SQL isolation levels. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, volume 99, pages 1--10, May 22-25 1995. San Jose, California, United States. Google ScholarDigital Library
- P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987. Google ScholarDigital Library
- P.A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley Longman Publishing Co., Inc., 1987. Google ScholarDigital Library
- M.J. Carey and W.A. Muhanna. The performance of multiversion concurrency control algorithms. ACM Transactions on Computer Systems, 4(4):338--378, November 1986. Google ScholarDigital Library
- B. Ciciani, F. Calderoni, A. Santoro, and F. Quaglia. Modeling of QoS-oriented content delivery networks. In Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2005), pages 341--344, Washington, DC, USA, 2005. IEEE Computer Society. Google ScholarDigital Library
- P. di Sanzo, B. Ciciani, F. Quaglia, and P. Romano. A performance model of multi-version concurrency control. In Proceedings of the 16th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2008), pages 41--50. IEEE Computer Society, 2008.Google ScholarCross Ref
- J. Gray, P. Homan, R. Obermarck, and H. Korth. A straw man analysis of probability of waiting and deadlock. IBM Research Report RJ 3066, 1981.Google Scholar
- I.K. Ryu and A. Thomasian. Analysis of database performance with dynamic locking. Journal of the ACM (JACM), Volume 37(Issue 3):pp. 491--523, July 1990. Google ScholarDigital Library
- L. Kleinrock. Queuing Systems (Vol1 and Vol2). Wiley-Interscience, 1975.Google Scholar
- S.T. Leutenegger and D. Dias. A modeling study of the tpc-c benchmark. SIGMOD Rec., 22(2):22--31, 1993. Google ScholarDigital Library
- D.R. Ries and M. Stonebraker. Locking granularity revisited. ACM Transactions on Database Systems (TODS), 4(2), 1974. Google ScholarDigital Library
- D.R. Ries and M. Stonebraker. Effects of locking granularity in a database management system. ACM Transactions on Database Systems (TODS), 2(3), September 1977. Google ScholarDigital Library
- A. Thomasian. On a more realistic lock contention model and its analysis. In Proceedings of the 10th International Conference on Data Engineering, pages 2--9, Feb 1994. Google ScholarDigital Library
- A. Thomasian. A more realistic locking model and its analysis. Information Systems, 21(5):409--430, 1996. Google ScholarDigital Library
- A. Thomasian. Concurrency control: Methods, performance, and analysis. ACM Computing Surveys, 30(1), March 1998. Google ScholarDigital Library
- A. Thomasian and I. Ryu. Performance analysis of two-phase locking. IEEE Transactions on Software Engineering, Volume 17(Issue 5):386--402, May 1991. Google ScholarDigital Library
- Transaction Processing Performance Council. TPC BenchmarkTM C, Standard Specification, Revision 5.1. Transaction Processing Perfomance Council, 2002.Google Scholar
- P. Yu and M. Chen. Performance analysis of dynamic finite versioning schemes: storage cost vs. obsolescence. IEEE Transactions on Knowledge and Data Engineering, 8(6), December 1996. Google ScholarDigital Library
- P.S. Yu, D.M. Dias, and S.S. Lavenberg. On the analytical modeling of database concurrency control. Journal of the ACM (JACM), 40(4):831--872, September 1993. Google ScholarDigital Library
Index Terms
- Analytical modeling of lock-based concurrency control with arbitrary transaction data access patterns
Recommendations
Semantics-based concurrency control: beyond commutativity
The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency ...
Concurrency control with lock preemption and restoration
CASCON '95: Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative researchLock preemption is a common problem with two-phase locking. While a transaction is still active, its locks may be preempted to avoid a deadlock or to satisfy the lock request of a higher-priority transaction. In general, the victim of preemption is ...
On the analytical modeling of concurrency control algorithms for Software Transactional Memories: The case of Commit-Time-Locking
We present an analytical performance modeling approach for concurrency control algorithms in the context of Software Transactional Memories (STMs). We consider a realistic execution pattern where each thread alternates the execution of transactional and ...
Comments