{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:54Z","timestamp":1750309134200,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"TrustShare Innovation Chair (Mazars & CDD)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,3,2]]},"DOI":"10.1145\/3627535.3638497","type":"proceedings-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T14:22:41Z","timestamp":1708438961000},"page":"188-199","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Memory Bounds for Concurrent Bounded Queues"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9134-5490","authenticated-orcid":false,"given":"Vitaly","family":"Aksenov","sequence":"first","affiliation":[{"name":"City, University of London, London, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1260-4616","authenticated-orcid":false,"given":"Nikita","family":"Koval","sequence":"additional","affiliation":[{"name":"JetBrains, Amsterdam, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1148-1228","authenticated-orcid":false,"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[{"name":"Telecom Paris, Institut Polytechnique Paris, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0760-8746","authenticated-orcid":false,"given":"Anton","family":"Paramonov","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. Efficient IO with io_uring. https:\/\/kernel.dk\/io_uring.pdf."},{"key":"e_1_3_2_1_2_1","volume-title":"Memory Bounds for Concurrent Bounded Queues. arXiv preprint arXiv:2104.15003","author":"Aksenov Vitaly","year":"2024","unstructured":"Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, and Anton Paramonov. 2024. Memory Bounds for Concurrent Bounded Queues. arXiv preprint arXiv:2104.15003 (2024)."},{"key":"e_1_3_2_1_3_1","volume-title":"31st International Symposium on Distributed Computing (DISC","author":"Arbel-Raviv Maya","year":"2017","unstructured":"Maya Arbel-Raviv and Trevor Brown. 2017. Reuse, don't recycle: Transforming lock-free algorithms that throw away descriptors. In 31st International Symposium on Distributed Computing (DISC 2017)."},{"volume-title":"Distributed Computing. Fundamentals, Simulations, and Advanced Topics","author":"Attiya Hagit","key":"e_1_3_2_1_4_1","unstructured":"Hagit Attiya and Jennifer Welch. 2004. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. John Wiley & Sons."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1065"},{"key":"e_1_3_2_1_6_1","unstructured":"DPDK Developers. 2022. Data Plane Development Kit (DPDK). https:\/\/dpdk.org\/."},{"key":"e_1_3_2_1_7_1","unstructured":"SPDK Developers. 2022. Storage Performance Development Kit. https:\/\/spdk.io\/."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835260.2835264"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Anders Gidenstam H\u00e5kan Sundell and Philippas Tsigas. 2010. Cacheaware lock-free queues for multiple producers\/consumers and weak memory consistency. In PODC. 302--317.","DOI":"10.1007\/978-3-642-17653-1_23"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36108-1_18"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/850929.851942"},{"key":"e_1_3_2_1_12_1","unstructured":"Maurice Herlihy Nir Shavit Victor Luchangco and Michael Spear. 2020. The art of multiprocessor programming. Newnes."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797317299"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29400-7_23"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577481"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing","author":"Maged","year":"1996","unstructured":"Maged M. Michael and Michael L. Scott. 1996. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, May 23--26, 1996, James E. Burns and Yoram Moses (Eds.). ACM, 267--275."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442527"},{"key":"e_1_3_2_1_19_1","unstructured":"Ruslan Nikolaev. 2019. A Scalable Portable and Memory-Efficient Lock-Free FIFO Queue. In DISC."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Peter Pirkelbauer Reed Milewicz and Juan Felipe Gonzalez. 2016. A portable lock-free bounded queue. In ICAPP. 55--73.","DOI":"10.1007\/978-3-319-49583-5_4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577485"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Niloufar Shafiei. 2009. Non-blocking array-based algorithms for stacks and queues. In ICDCN. 55--66.","DOI":"10.1007\/978-3-540-92295-7_10"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Philippas Tsigas and Yi Zhang. 2001. A simple fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. In SPAA. 134--143.","DOI":"10.1145\/378580.378611"},{"key":"e_1_3_2_1_24_1","unstructured":"John D Valois. 1994. Implementing lock-free queues. In ICPADS. 64--69."},{"key":"e_1_3_2_1_25_1","unstructured":"Dmitry Vyukov. [n. d.]. Bounded MPMC Queue. http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/queues\/bounded-mpmc-queue."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3016078.2851168"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897565"}],"event":{"name":"PPoPP '24: 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Edinburgh United Kingdom","acronym":"PPoPP '24"},"container-title":["Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638497","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627535.3638497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:04Z","timestamp":1750287004000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,20]]},"references-count":27,"alternative-id":["10.1145\/3627535.3638497","10.1145\/3627535"],"URL":"https:\/\/doi.org\/10.1145\/3627535.3638497","relation":{},"subject":[],"published":{"date-parts":[[2024,2,20]]},"assertion":[{"value":"2024-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}