{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:07:40Z","timestamp":1755907660864,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":57,"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":"Google Research Scholar Award"},{"name":"MIT UROP Funding - Ralph L. Evans (1948) Endowment Fund"},{"name":"Greek Ministry of Education Religious Affairs and Sports under the call SUB 1.1 -- Research Excellence Partnerships","award":["HARSH \\Ypsilon\\Pi 3TA-0560901"],"award-info":[{"award-number":["HARSH \\Ypsilon\\Pi 3TA-0560901"]}]},{"name":"National Science Foundation grants","award":["CCF-1845763, CCF-2316235, CCF-2403237"],"award-info":[{"award-number":["CCF-1845763, CCF-2316235, CCF-2403237"]}]},{"name":"Google Faculty Research Award"},{"name":"Hellenic Foundation for Research and Innovation (HFRI) under the ``Second Call for HFRI Research Projects to support Faculty Members and Researchers'","award":["PERSIST3684"],"award-info":[{"award-number":["PERSIST3684"]}]},{"DOI":"10.13039\/501100006374","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,28]]},"DOI":"10.1145\/3710848.3710873","type":"proceedings-article","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T06:20:57Z","timestamp":1740723657000},"page":"99-114","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Aggregating Funnels for Faster Fetch&Add and Queues"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2268-8921","authenticated-orcid":false,"given":"Younghun","family":"Roh","sequence":"first","affiliation":[{"name":"MIT CSAIL, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5176-0961","authenticated-orcid":false,"given":"Yuanhao","family":"Wei","sequence":"additional","affiliation":[{"name":"MIT CSAIL, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5613-8701","authenticated-orcid":false,"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[{"name":"York University, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6265-6895","authenticated-orcid":false,"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[{"name":"FORTH ICS and University of Crete, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2681-1632","authenticated-orcid":false,"given":"Siddhartha","family":"Jayanti","sequence":"additional","affiliation":[{"name":"Google Research, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6163-6625","authenticated-orcid":false,"given":"Julian","family":"Shun","sequence":"additional","affiliation":[{"name":"MIT CSAIL, USA"}]}],"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\/225058.225271"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993850"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80120"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185815"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594601"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2019.00024"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_20"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407909"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-60603-8_14"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00446-003-0097-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145849"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00224-013-9491-Y"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323197"},{"volume-title":"Foundations of Computation Theory","author":"Fischer Michael J.","key":"e_1_3_2_1_15_1","unstructured":"Michael J. Fischer. 1983. The consensus problem in unreliable distributed systems (a brief survey). In Foundations of Computation Theory, Marek Karpinski (Ed.). Springer, Berlin, 127--140."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.37"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100228"},{"key":"e_1_3_2_1_18_1","unstructured":"Keir Fraser. 2003. Practical lock-freedom. Ph.D. Dissertation. University of Cambridge. Technical report based on thesis is available from https:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-579.pdf."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/106972.106998"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/70082.68188"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/859515.859517"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/69624.357206"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/210223.210225"},{"key":"e_1_3_2_1_25_1","volume-title":"The Art of Multiprocessor Programming","author":"Herlihy Maurice","unstructured":"Maurice Herlihy, Nir Shavit, Victor Luchangco, and Michael Spear. 2021. The Art of Multiprocessor Programming (2nd ed.). Morgan Kaufmann.","edition":"2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/S004460050019"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_28_1","unstructured":"Intel. 2020. Intel 64 and IA-32 Architectures Software Developer Manuals. https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/articles\/intel-sdm.html"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277735"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571875"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662820"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331593"},{"key":"e_1_3_2_1_33_1","unstructured":"Siddhartha Visveswara Jayanti. 2022. Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures [in Telugu]. (2022). arXiv:2207.07561 [cs.DS] Manuscript available from https:\/\/arxiv.org\/abs\/2207.07561."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806747"},{"key":"e_1_3_2_1_35_1","first-page":"123","article-title":"Annotated Bibliography on Counting","volume":"72","author":"Mavronicolas Marios","year":"2000","unstructured":"Marios Mavronicolas. 2000. Annotated Bibliography on Counting Networks. Bull. EATCS 72 (2000), 123--132.","journal-title":"Networks. Bull. EATCS"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_3_2_1_37_1","unstructured":"Maged M. Michael and Michael L. Scott. 1995. Correction of a Memory Management Method for Lock-Free Data Structures. Technical Report 599. Computer Science Department University of Rochester."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(95)00009-H"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442527"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2019.28"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538572"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2770121"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/69622.357194"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/359060.359076"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577485"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/S002240000072"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/235543.235546"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1006\/JPDC.2000.1621"},{"key":"e_1_3_2_1_49_1","unstructured":"Harold S. Stone. 1982. Parallel Memory Allocation using the FETCHAND-ADD Instruction. Technical Report RC 9674. IBM Research. 14 pages."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.5009333"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.451"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90022-H"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441602"},{"volume-title":"Operating System Data Structures for Shared-Memory MIMD Machines with Fetch-and-Add. Ph. D. Dissertation","author":"Wilson James M.","key":"e_1_3_2_1_55_1","unstructured":"James M. Wilson. 1988. Operating System Data Structures for Shared-Memory MIMD Machines with Fetch-and-Add. Ph. D. Dissertation. New York University. Available from https:\/\/cs.nyu.edu\/~gottlieb\/family-tree."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851168"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676921"}],"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.3710873","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3710848.3710873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:16:13Z","timestamp":1755875773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3710848.3710873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,28]]},"references-count":57,"alternative-id":["10.1145\/3710848.3710873","10.1145\/3710848"],"URL":"https:\/\/doi.org\/10.1145\/3710848.3710873","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"}}]}}