{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:31:28Z","timestamp":1760711488735,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T00:00:00Z","timestamp":1740700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"The Swedish Research Council","award":["2021-05443"],"award-info":[{"award-number":["2021-05443"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,28]]},"DOI":"10.1145\/3710848.3710892","type":"proceedings-article","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T06:20:57Z","timestamp":1740723657000},"page":"382-395","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Balanced Allocations over Efficient Queues: A Fast Relaxed FIFO Queue"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4823-6855","authenticated-orcid":false,"given":"K\u00e5re","family":"von Geijer","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9635-9154","authenticated-orcid":false,"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9255-9398","authenticated-orcid":false,"given":"Elias","family":"Johansson","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0551-4996","authenticated-orcid":false,"given":"Sebastian","family":"Hermansson","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2025,2,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210411"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087810"},{"key":"e_1_3_2_1_3_1","first-page":"593","volume-title":"180--200. A preliminary version appeared in Proceedings of the 26th Annual ACM Symposium on Theory of Computing","author":"Azar Yossi","year":"1999","unstructured":"Yossi Azar, Andrei Z Broder, Anna R Karlin, and Eli Upfal. 1999. Balanced Alocations. SIAM J. Comput. 29, 1 (1999), 180--200. A preliminary version appeared in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 593--602, Montreal, Quebec, Canada, May 23-25, 1994. ACM Press, New York, NY.."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"e_1_3_2_1_5_1","volume-title":"CBPQ: High Performance Lock-Free Priority Queue. In Euro-Par 2016: Parallel Processing, Pierre-Fran\u00e7ois Dutot and Denis Trystram (Eds.)","author":"Braginsky Anastasia","year":"2016","unstructured":"Anastasia Braginsky, Nachshon Cohen, and Erez Petrank. 2016. CBPQ: High Performance Lock-Free Priority Queue. In Euro-Par 2016: Parallel Processing, Pierre-Fran\u00e7ois Dutot and Denis Trystram (Eds.). Springer International Publishing, Cham, 460--474."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786763.2694359"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676963"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/08072646X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989549"},{"key":"e_1_3_2_1_11_1","unstructured":"Keir Fraser. 2003. Practical lock-freedom. Ph.D. Dissertation. University of Cambridge."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17653-1_23"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312035"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/322248.322254"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482767.2482789"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.08.011"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480359.2429109"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77096-1_29"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33078-0_20"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145835"},{"volume-title":"Principles of Distributed Systems","author":"Lind\u00e9n Jonatan","key":"e_1_3_2_1_22_1","unstructured":"Jonatan Lind\u00e9n and Bengt Jonsson. 2013. A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. In Principles of Distributed Systems. Springer International Publishing, Cham, 206--220."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074013"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442527"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149704.3149764"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.15"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508432"},{"volume-title":"Randomization and Approximation Techniques in Computer Science, Michael Luby, Jos\u00e9 D","author":"Raab Martin","key":"e_1_3_2_1_30_1","unstructured":"Martin Raab and Angelika Steger. 1998. \"Balls into Bins\" --- a Simple and Tight Analysis. In Randomization and Approximation Techniques in Computer Science, Michael Luby, Jos\u00e9 D. P. Rolim, and Maria Serna (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 159--170."},{"volume-title":"FAAArrayQueue - MPMC Lock-Free Queue","author":"Ramalhete Pedro","key":"e_1_3_2_1_31_1","unstructured":"Pedro Ramalhete. 2016. FAAArrayQueue - MPMC Lock-Free Queue. http:\/\/concurrencyfreaks.blogspot.com\/2016\/11\/faaarrayqueue-mpmc-lock-free-queue-part.html Accessed: 2024-07-29."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755616"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2019.31"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897873"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989550"},{"key":"e_1_3_2_1_36_1","volume-title":"Balanced Allocations: A Simple Proof for the Heavily Loaded Case. In Automata, Languages, and Programming","author":"Talwar Kunal","year":"2014","unstructured":"Kunal Talwar and Udi Wieder. 2014. Balanced Allocations: A Simple Proof for the Heavily Loaded Case. In Automata, Languages, and Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, 979--990."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378611"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"K\u00e5re von Geijer. 2025. Artifact for: Balanced Allocations over Efficient Queues: A Fast Relaxed FIFO Queue. https:\/\/doi.org\/10.5281\/zenodo.14223312","DOI":"10.5281\/zenodo.14223312"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","unstructured":"K\u00e5re von Geijer and Philippas Tsigas. 2024. Artifact of the paper: How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures. https:\/\/doi.org\/10.5281\/zenodo.11547063","DOI":"10.5281\/zenodo.11547063"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-69583-4_9"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2021.81"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851168"}],"event":{"name":"PPoPP '25: The 30th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Las Vegas NV USA","acronym":"PPoPP '25"},"container-title":["Proceedings of the 30th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3710848.3710892","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3710848.3710892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:12:48Z","timestamp":1755875568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3710848.3710892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,28]]},"references-count":42,"alternative-id":["10.1145\/3710848.3710892","10.1145\/3710848"],"URL":"https:\/\/doi.org\/10.1145\/3710848.3710892","relation":{},"subject":[],"published":{"date-parts":[[2025,2,28]]},"assertion":[{"value":"2025-02-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}