{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:36Z","timestamp":1750220976595,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["08-08"],"award-info":[{"award-number":["08-08"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,19]]},"DOI":"10.1145\/3332466.3374508","type":"proceedings-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:13:53Z","timestamp":1582139633000},"page":"433-434","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Restricted memory-friendly lock-free bounded queues"],"prefix":"10.1145","author":[{"given":"Nikita","family":"Koval","sequence":"first","affiliation":[{"name":"JetBrains"}]},{"given":"Vitaly","family":"Aksenov","sequence":"additional","affiliation":[{"name":"ITMO University"}]}],"member":"320","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/2835260.2835264"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-642-17653-1_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/2517327.2442527"},{"key":"e_1_3_2_1_4_1","volume-title":"DISC","author":"Nikolaev Ruslan","year":"2019","unstructured":"Ruslan Nikolaev . A scalable, portable, and memory-efficient lock-free fifo queue . In DISC , 2019 . Ruslan Nikolaev. A scalable, portable, and memory-efficient lock-free fifo queue. In DISC, 2019."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/978-3-319-49583-5_4"},{"key":"e_1_3_2_1_6_1","first-page":"55","volume-title":"ICDCN","author":"Shafiei Niloufar","year":"2009","unstructured":"Niloufar Shafiei . Non-blocking array-based algorithms for stacks and queues . In ICDCN , pages 55 -- 66 , 2009 . Niloufar Shafiei. Non-blocking array-based algorithms for stacks and queues. In ICDCN, pages 55--66, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/378580.378611"},{"key":"e_1_3_2_1_8_1","first-page":"64","volume-title":"ICPADS","author":"Valois John D","year":"1994","unstructured":"John D Valois . Implementing lock-free queues . In ICPADS , pages 64 -- 69 , 1994 . John D Valois. Implementing lock-free queues. In ICPADS, pages 64--69, 1994."},{"unstructured":"Dmitry Vyukov. Bounded MPMC queue. http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/queues\/bounded-mpmc-queue.  Dmitry Vyukov. Bounded MPMC queue. http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/queues\/bounded-mpmc-queue.","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3016078.2851168"}],"event":{"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"],"acronym":"PPoPP '20","name":"PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Diego California"},"container-title":["Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3332466.3374508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:37Z","timestamp":1750204477000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":10,"alternative-id":["10.1145\/3332466.3374508","10.1145\/3332466"],"URL":"https:\/\/doi.org\/10.1145\/3332466.3374508","relation":{},"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"2020-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}