research-article

Leveraging lock contention to improve OLTP application performance

Authors:

Alvin CheungAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 9, Issue 5

Pages 444 - 455

https://doi.org/10.14778/2876473.2876479

Published: 01 January 2016 Publication History

Abstract

Locking is one of the predominant costs in transaction processing. While much work has focused on designing efficient concurrency control mechanisms, not much has been done on understanding how transaction applications issue queries and leveraging application semantics to improve application performance. This paper presents Quro, a query-aware compiler that automatically reorders queries in transaction code to improve performance. Observing that certain queries within a transaction are more contentious than others as they require locking the same tuples as other concurrently executing transactions, Quro automatically changes the application such that contentious queries are issued as late as possible. We have evaluated Quro on various transaction benchmarks, and our results show that Quro-generated implementations can increase transaction throughput by up to 6.53x, while reduce transaction latency by up to 85%.

References

[1]

The bidding benchmark from silo. https://github.com/stephentu/silo.git.

[2]

Clang. http://clang.llvm.org.

[3]

dbt2 benchmark tool. http://osdldbt.sourceforge.net/#dbt2.

[4]

dbt5 benchmark tool. http://osdldbt.sourceforge.net/#dbt5.

[5]

Gurobi optimization. http://www.gurobi.com.

[6]

lpsolve. http://sourceforge.net/projects/lpsolve.

[7]

P. A. Bernstein and N. Goodman. Concurrency control in distributed database systems. In ACM Comput. Surv., volume 13, pages 185--221, June 1981.

Digital Library

[8]

P. A. Bernstein, D. W. Shipman, and W. S. Wong. Formal aspects of serializability in database concurrency control. In IEEE Trans. Softw. Eng., volume 5, pages 203--216, May 1979.

Digital Library

[9]

M. Chavan, R. Guravannavar, K. Ramachandra, and S. Sudarshan. DBridge: A program rewrite tool for set-oriented query execution. In Data Engineering (ICDE), 2011 IEEE 27th International Conference on, pages 1284--1287, 2011.

Digital Library

[10]

A. Cheung, S. Madden, O. Arden, and A. C. Myers. Automatic partitioning of database applications. In Proceedings of the VLDB Endowment, volume 5, pages 1471--1482, 2012.

Digital Library

[11]

A. Cheung, S. Madden, and A. Solar-Lezama. Sloth: Being lazy is a virtue (when issuing database queries). In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pages 931--942, 2014.

Digital Library

[12]

J. M. Faleiro, A. Thomson, and D. J. Abadi. Lazy evaluation of transactions in database systems. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pages 15--26, 2014.

Digital Library

[13]

R. Guravannavar and S. Sudarshan. Rewriting procedures for batched bindings. In Proceedings of the VLDB Endowment, volume 1, pages 1107--1123, Aug. 2008.

Digital Library

[14]

T. Horikawa. Latch-free data structures for DBMS: Design, implementation, and evaluation. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 409--420, 2013.

Digital Library

[15]

R. Johnson, I. Pandis, and A. Ailamaki. Improving OLTP scalability using speculative lock inheritance. In Proceedings of the VLDB Endowment, volume 2, pages 479--489, Aug. 2009.

Digital Library

[16]

R. Johnson, I. Pandis, N. Hardavellas, A. Ailamaki, and B. Falsafi. Shore-MT: A scalable storage manager for the multicore era. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, 2009.

Digital Library

[17]

H. Jung, H. Han, A. D. Fekete, G. Heiser, and H. Y. Yeom. A scalable lock manager for multicores. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 73--84, 2013.

Digital Library

[18]

H. T. Kung and J. T. Robinson. On optimistic methods for concurrency control. In ACM Trans. Database Syst., 1981.

Digital Library

[19]

T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks: A unified model. In Acta Inf., pages 121--163, 1990.

Digital Library

[20]

D. Porter and E. Witchel. Understanding transactional memory performance. In Proceedings of the 2010 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pages 97--108, March 2010.

[21]

Transaction Processing Performance Council. TPC-C Benchmark Revision 5.11. Technical report, 2010.

[22]

M. J. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Longman Publishing Co., Inc., 1995.

Digital Library

[23]

C. Yan and A. Cheung. Leveraging lock contention to improve OLTP application performance, technical report. http://homes.cs.washington.edu/~congy/reorder_techreport.pdf.

[24]

L. T. Yang and M. Guo. High-performance computing: paradigm and infrastructure, volume 44. John Wiley & Sons, 2005.

[25]

X. Yu, G. Bezerra, A. Pavlo, S. Devadas, and M. Stonebraker. Staring into the abyss: An evaluation of concurrency control with one thousand cores. In Proceedings of the VLDB Endowment, volume 8, pages 209--220, Nov. 2014.

Digital Library

Cited By

Gao JLu YXie MWang QShu JNaor DGoel A(2023)CITRONProceedings of the 21st USENIX Conference on File and Storage Technologies10.5555/3585938.3585957(297-314)Online publication date: 21-Feb-2023
https://dl.acm.org/doi/10.5555/3585938.3585957
Huang HShen BZhong LZhou YAamodt TJerger NSwift M(2023)Protecting Data Integrity of Web Applications with Database Constraints Inferred from Application CodeProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3575693.3575699(632-645)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1145/3575693.3575699
Vandevoort BKetsman BKoch CNeven FLibkin LBarceló P(2022)Robustness Against Read CommittedProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3524162(1-14)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3517804.3524162
Show More Cited By

Index Terms

Leveraging lock contention to improve OLTP application performance
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database transaction processing
2. Theory of computation
  1. Models of computation
    1. Concurrency

Index terms have been assigned to the content through auto-classification.

Recommendations

Analyzing lock contention in multithreaded applications
PPoPP '10

Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks reduces parallel efficiency and hurts scalability. Being able to quantify ...
Analyzing lock contention in multithreaded applications
PPoPP '10: Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks reduces parallel efficiency and hurts scalability. Being able to quantify ...
Transactional lock-free execution of lock-based programs
Special Issue: Proceedings of the 10th annual conference on Architectural Support for Programming Languages and Operating Systems

This paper is motivated by the difficulty in writing correct high-performance programs. Writing shared-memory multi-threaded programs imposes a complex trade-off between programming ease and performance, largely due to subtleties in coordinating access ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 9, Issue 5

January 2016

72 pages

ISSN:2150-8097

Editors:
Surajit Chaudhuri
Microsoft Research
,
Jayant Haritsa
I.I.Sc. Bangalore

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 January 2016

Published in PVLDB Volume 9, Issue 5

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
235
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Gao JLu YXie MWang QShu JNaor DGoel A(2023)CITRONProceedings of the 21st USENIX Conference on File and Storage Technologies10.5555/3585938.3585957(297-314)Online publication date: 21-Feb-2023
https://dl.acm.org/doi/10.5555/3585938.3585957
Huang HShen BZhong LZhou YAamodt TJerger NSwift M(2023)Protecting Data Integrity of Web Applications with Database Constraints Inferred from Application CodeProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3575693.3575699(632-645)Online publication date: 27-Jan-2023
https://dl.acm.org/doi/10.1145/3575693.3575699
Vandevoort BKetsman BKoch CNeven FLibkin LBarceló P(2022)Robustness Against Read CommittedProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3524162(1-14)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3517804.3524162
Milkai EChronis YGaffney KGuo ZPatel JYu XIves ZBonifati AEl Abbadi A(2022)How Good is My HTAP System?Proceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526148(1810-1824)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3526148
Jasny MThostrup LZiegler TBinnig CIves ZBonifati AEl Abbadi A(2022)P4DB - The Case for In-Network OLTPProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517825(1375-1389)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517825
Li NJiang HChe HWang ZNguyen MBromberg YKermarrec AKozyrakis C(2022)Improving scalability of database systems by reshaping user parallel I/OProceedings of the Seventeenth European Conference on Computer Systems10.1145/3492321.3519570(592-609)Online publication date: 28-Mar-2022
https://dl.acm.org/doi/10.1145/3492321.3519570
Hu HZhou XZhu TQian WZhou A(2022)In-memory transaction processing: efficiency and scalability considerationsKnowledge and Information Systems10.1007/s10115-019-01340-761:3(1209-1240)Online publication date: 11-Mar-2022
https://dl.acm.org/doi/10.1007/s10115-019-01340-7
Wang JTrummer IBasu D(2021)UDOProceedings of the VLDB Endowment10.14778/3484224.348423614:13(3402-3414)Online publication date: 28-Oct-2021
https://dl.acm.org/doi/10.14778/3484224.3484236
Ghosh ABansod DNarechania ADintyala PTimurturkan SArulraj J(2021)Interactive demonstration of SQLCheckProceedings of the VLDB Endowment10.14778/3476311.347634314:12(2779-2782)Online publication date: 28-Oct-2021
https://dl.acm.org/doi/10.14778/3476311.3476343
Vandevoort BKetsman BKoch CNeven F(2021)Robustness against read committed for transaction templatesProceedings of the VLDB Endowment10.14778/3476249.347626814:11(2141-2153)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.14778/3476249.3476268
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents