{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T12:10:11Z","timestamp":1751112611254,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"name":"Shenzhen Science and Technology Program","award":["No. GXWD20220817124827001 and No. JCYJ20210324132406016"],"award-info":[{"award-number":["No. GXWD20220817124827001 and No. JCYJ20210324132406016"]}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["No. 2023YFC3321300"],"award-info":[{"award-number":["No. 2023YFC3321300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["No. 62472116 and No. 61732022"],"award-info":[{"award-number":["No. 62472116 and No. 61732022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF of Guangdong Province","award":["No. 2023A1515030273"],"award-info":[{"award-number":["No. 2023A1515030273"]}]},{"name":"Guangzhou Basic and Applied Basic Research Project","award":["No. SL2024A03J00397"],"award-info":[{"award-number":["No. SL2024A03J00397"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>Deterministic concurrency control (DCC) guarantees that the same input transactions produce the same serializable result. It offers benefits in both distributed databases and blockchain systems. Dozens of DCC algorithms have emerged in the past decade. However, there is a lack of comprehensive evaluations for them.<\/jats:p>\n          <jats:p>To study the performance of existing DCC algorithms and discover further opportunities, we make the following contributions: First, we abstract five essential features from the existing DCC algorithms\u2014generality, speculative mechanism, version strategy, batch strategy, and concurrency mode. Each distinct combination of these features corresponds to a specific algorithm. Second, we implement 13 DCC algorithms and conduct evaluations focused on their features by using 10 workloads, to conclude each feature\u2019s strengths and weaknesses. Third, based on our feature analysis, we discover opportunities for improvement in two existing DCC algorithms, resulting in performance boosts of up to 2.3\u00d7 and 3.4\u00d7.<\/jats:p>","DOI":"10.1145\/3715126","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T11:27:26Z","timestamp":1739273246000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Comprehensive Evaluation and Opportunity Discovery for Deterministic Concurrency Control"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6359-7869","authenticated-orcid":false,"given":"Xinyuan","family":"Wang","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology Shenzhen","place":["Shenzhen, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0972-5881","authenticated-orcid":false,"given":"Xingchen","family":"Li","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology Shenzhen","place":["Shenzhen, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6358-2333","authenticated-orcid":false,"given":"Yun","family":"Peng","sequence":"additional","affiliation":[{"name":"Guangzhou University","place":["Guangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2030-957X","authenticated-orcid":false,"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology Shenzhen","place":["Shenzhen, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,28]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3181853"},{"issue":"2","key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.14778\/3149193.3149194","article-title":"Analyzing the impact of system architecture on the scalability of OLTP engines for high-contention workloads","volume":"11","author":"Appuswamy Raja","year":"2017","unstructured":"Raja Appuswamy, Angelos C. Anadiotis, Danica Porobic, Mustafa K. Iman, and Anastasia Ailamaki. 2017. Analyzing the impact of system architecture on the scalability of OLTP engines for high-contention workloads. Proc. VLDB Endow. 11, 2 (2017), 121\u2013134.","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1007\/s00778-022-00742-4","article-title":"The full story of 1000 cores: An examination of concurrency control on real (ly) large multi-socket hardware","volume":"31","author":"Bang Tiemo","year":"2022","unstructured":"Tiemo Bang, Norman May, Ilia Petrov, and Carsten Binnig. 2022. The full story of 1000 cores: An examination of concurrency control on real (ly) large multi-socket hardware. VLDB J. 31, 6 (2022), 1185\u20131213.","journal-title":"VLDB J."},{"key":"e_1_3_2_5_2","first-page":"687","volume-title":"Proceedings of the 18th European Conference on Computer Systems (EuroSys\u201923)","author":"Burke Matthew","year":"2023","unstructured":"Matthew Burke, Florian Suri-Payer, Jeffrey Helt, Lorenzo Alvisi, and Natacha Crooks. 2023. Morty: Scaling concurrency control with re-execution. In Proceedings of the 18th European Conference on Computer Systems (EuroSys\u201923). 687\u2013702."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_7_2","first-page":"223","volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201912)","author":"Cowling James","year":"2012","unstructured":"James Cowling and Barbara Liskov. 2012. Granola: Low-overhead distributed transaction coordination. In Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201912). 223\u2013235."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-020-9700-5"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809981"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055553"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/3572848.3577524","volume-title":"Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","author":"Gelashvili Rati","year":"2023","unstructured":"Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Zekun Li, Dahlia Malkhi, Yu Xia, and Runtian Zhou. 2023. Block-STM: Scaling blockchain execution by turning ordering curse to a performance blessing. In Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming. 232\u2013244."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055548"},{"issue":"1","key":"e_1_3_2_13_2","first-page":"455","article-title":"Survey on key techniques of multi-replica distributed transaction processing and representative database systems","volume":"35","author":"Huang ChunYue","year":"2024","unstructured":"ChunYue Huang, Qi Peng, FuXiao Zhang, ShengYi Wang, Cheng Luo, YanFeng Zhang, and Ge Yu. 2024. Survey on key techniques of multi-replica distributed transaction processing and representative database systems. Journal of Software 35, 1 (2024), 455\u2013480.","journal-title":"Journal of Software"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00719-9"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3588952"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170042"},{"key":"e_1_3_2_17_2","first-page":"1156","volume-title":"Proceedings of the International Conference on Management of Data","author":"Lin Yu-Shan","year":"2021","unstructured":"Yu-Shan Lin, Ching Tsai, Tz-Yu Lin, Yun-Sheng Chang, and Shan-Hung Wu. 2021. Don\u2019t look back, look into the future: Prescient data partitioning and migration for deterministic database systems. In Proceedings of the International Conference on Management of Data. 1156\u20131168."},{"issue":"12","key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"2047","DOI":"10.14778\/3407790.3407808","article-title":"Aria: A fast and practical deterministic OLTP database","volume":"13","author":"Lu Yi","year":"2020","unstructured":"Yi Lu, Xiangyao Yu, Lei Cao, and Samuel Madden. 2020. Aria: A fast and practical deterministic OLTP database. Proc. VLDB Endow. 13, 12 (2020), 2047\u20132060.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/3477132.3483591","volume-title":"Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles","author":"Qin Dai","year":"2021","unstructured":"Dai Qin, Angela Demke Brown, and Ashvin Goel. 2021. Caracal: Contention management with deterministic concurrency control. In Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles. 180\u2013194."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732955"},{"issue":"3","key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/211414.211427","article-title":"Transaction chopping: Algorithms and performance studies","volume":"20","author":"Shasha Dennis","year":"1995","unstructured":"Dennis Shasha, Francois Llirbat, Eric Simon, and Patrick Valduriez. 1995. Transaction chopping: Algorithms and performance studies. ACM Trans. Datab. Syst. 20, 3 (1995), 325\u2013363.","journal-title":"ACM Trans. Datab. Syst."},{"issue":"11","key":"e_1_3_2_22_2","first-page":"4084","article-title":"Overview on parallel execution models of smart contract transactions in blockchains","volume":"33","author":"Shi Jianfeng","year":"2021","unstructured":"Jianfeng Shi, Heng Wu, Heran Gao, and Wenbo Zhang. 2021. Overview on parallel execution models of smart contract transactions in blockchains. J. Softw. 33, 11 (2021), 4084\u20134106.","journal-title":"J. Softw."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424575"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_3_2_25_2","article-title":"Comprehensive framework of RDMA-enabled concurrency control protocols","author":"Wang Chao","year":"2020","unstructured":"Chao Wang, Kezhao Huang, and Xuehai Qian. 2020. Comprehensive framework of RDMA-enabled concurrency control protocols. arXiv preprint arXiv:2002.12664 (2020).","journal-title":"arXiv preprint arXiv:2002.12664"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2022.102980"},{"issue":"4","key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"184204","DOI":"10.1007\/s11704-023-2605-z","article-title":"Gria: An efficient deterministic concurrency control protocol","volume":"18","author":"Wang Xinyuan","year":"2024","unstructured":"Xinyuan Wang, Yun Peng, and Hejiao Huang. 2024. Gria: An efficient deterministic concurrency control protocol. Front. Comput. Sci. 18, 4, Article 184204 (2024), 184204 pages.","journal-title":"Front. Comput. Sci."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2024.05.004"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4965187"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067427"},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/978-3-031-30637-2_33","volume-title":"Proceedings of the International Conference on Database Systems for Advanced Applications","author":"Xia Huahui","year":"2023","unstructured":"Huahui Xia, Jinchuan Chen, Nabo Ma, Jia Huang, and Xiaoyong Du. 2023. Efficient execution of blockchain transactions through deterministic concurrency control. In Proceedings of the International Conference on Database Systems for Advanced Applications. Springer, 509\u2013518."},{"key":"e_1_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Xiangyao Yu George Bezerra Andrew Pavlo Srinivas Devadas and Michael Stonebraker. 2014. Staring into the abyss: An evaluation of concurrency control with one thousand cores. VLDB Endowment 209\u2013220.","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00821-0"},{"issue":"1","key":"e_1_3_2_34_2","article-title":"Experimental study of concurrency control algorithms in main-memory database systems.","volume":"12","author":"Zhao Hongyao","year":"2022","unstructured":"Hongyao Zhao, Zhanhao Zhao, Wanqing Yang, Wei Lu, Haixiang Li, and Xiaoyong Du. 2022. Experimental study of concurrency control algorithms in main-memory database systems. International Journal of Software and Informatics 12, 1 (2022).","journal-title":"International Journal of Software and Informatics"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3715126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T11:52:45Z","timestamp":1751111565000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,28]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1145\/3715126"],"URL":"https:\/\/doi.org\/10.1145\/3715126","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2025,6,28]]},"assertion":[{"value":"2024-08-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}