{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:46Z","timestamp":1750309246450,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003816","name":"Huawei Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003816","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3663338.3665827","type":"proceedings-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T15:32:50Z","timestamp":1718897570000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Next 700 Benchmarking Frameworks for Concurrent Data Structures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2255-6949","authenticated-orcid":false,"given":"Ravil","family":"Galiev","sequence":"first","affiliation":[{"name":"ITMO University, Saint-Petersburg, Russian Federation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7681-5877","authenticated-orcid":false,"given":"Michael","family":"Spear","sequence":"additional","affiliation":[{"name":"Lehigh University, Bethlehem, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9134-5490","authenticated-orcid":false,"given":"Vitaly","family":"Aksenov","sequence":"additional","affiliation":[{"name":"City, University of London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"unstructured":"TPC [n. d.]. TPC benchmarks. https:\/\/www.tpc.org\/.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","volume-title":"The CB tree: a practical concurrent self-adjusting search tree. Distributed computing 27, 6","author":"Afek Yehuda","year":"2014","unstructured":"Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, and Robert E Tarjan. 2014. The CB tree: a practical concurrent self-adjusting search tree. Distributed computing 27, 6 (2014), 393--417."},{"key":"e_1_3_2_1_3_1","volume-title":"The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing","author":"Aksenov Vitaly","year":"2023","unstructured":"Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. 2023. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing (2023), 1--24."},{"volume-title":"Euro-Par 2017: Parallel Processing","author":"Aksenov Vitaly","unstructured":"Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, and Srivatsan Ravi. 2017. A concurrency-optimal binary search tree. In Euro-Par 2017: Parallel Processing. Springer, 580--593.","key":"e_1_3_2_1_4_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1837853.1693488"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 25th PPoPP. 276--291","author":"Brown Trevor","year":"2020","unstructured":"Trevor Brown, Aleksandar Prokopec, and Dan Alistarh. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the 25th PPoPP. 276--291."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1807128.1807152"},{"volume-title":"Euro-Par 2013 Parallel Processing","author":"Crain Tyler","unstructured":"Tyler Crain, Vincent Gramoli, and Michel Raynal. 2013. A contention-friendly binary search tree. In Euro-Par 2013 Parallel Processing. Springer, 229--240.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 20th Symposium on Principles and Practice of Parallel Programming. 1--10","author":"Gramoli Vincent","year":"2015","unstructured":"Vincent Gramoli. 2015. More than you ever wanted to know about synchronization: Synchrobench, measuring the impact of the synchronization on concurrent algorithms. In Proceedings of the 20th Symposium on Principles and Practice of Parallel Programming. 1--10."},{"key":"e_1_3_2_1_10_1","volume-title":"Networked Systems: Third International Conference, NETYS 2015","author":"Haas Andreas","year":"2015","unstructured":"Andreas Haas, Thomas H\u00fctter, Christoph M Kirsch, Michael Lippautz, Mario Preishuber, and Ana Sokolova. 2015. Scal: A benchmarking suite for concurrent data structures. In Networked Systems: Third International Conference, NETYS 2015, Agadir, Morocco, May 13-15, 2015, Revised Selected Papers 3. Springer, 1--14."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.21105\/joss.03143"},{"key":"e_1_3_2_1_12_1","volume-title":"Performance Anomalies in Concurrent Data Structure Microbenchmarks. arXiv preprint arXiv:2208.08469 (","author":"Kharal Rosina","year":"2022","unstructured":"Rosina Kharal and Trevor Brown. 2022. Performance Anomalies in Concurrent Data Structure Microbenchmarks. arXiv preprint arXiv:2208.08469 ( 2022)."},{"doi-asserted-by":"crossref","unstructured":"David MW Powers. 1998. Applications and explanations of Zipf's law. In New methods in language processing and computational natural language learning.","key":"e_1_3_2_1_13_1","DOI":"10.3115\/1603899.1603924"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"acronym":"ApPLIED'24","name":"ApPLIED'24: 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems","location":"Nantes France"},"container-title":["Proceedings of the 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3663338.3665827","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3663338.3665827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:45Z","timestamp":1750291005000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3663338.3665827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":13,"alternative-id":["10.1145\/3663338.3665827","10.1145\/3663338"],"URL":"https:\/\/doi.org\/10.1145\/3663338.3665827","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}