{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:21Z","timestamp":1750220361566,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,17]]},"DOI":"10.1145\/3437801.3441583","type":"proceedings-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T23:04:20Z","timestamp":1613862260000},"page":"454-456","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A lock-free relaxed concurrent queue for fast work distribution"],"prefix":"10.1145","author":[{"given":"Giorgos","family":"Kappes","sequence":"first","affiliation":[{"name":"University of Ioannina, Ioannina, Greece"}]},{"given":"Stergios V.","family":"Anastasiadis","sequence":"additional","affiliation":[{"name":"University of Ioannina, Ioannina, Greece"}]}],"member":"320","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989545"},{"key":"e_1_3_2_1_2_1","first-page":"54","article-title":"The Art of Multiprocessor Programming. Morgan Kaufmann, Waltham, MA","volume":"3","author":"Herlihy Maurice","year":"2012","unstructured":"Maurice Herlihy and Nir Shavit . 2012 . The Art of Multiprocessor Programming. Morgan Kaufmann, Waltham, MA , Chapter 3 , 54 -- 61 . Maurice Herlihy and Nir Shavit. 2012. The Art of Multiprocessor Programming. Morgan Kaufmann, Waltham, MA, Chapter 3, 54--61.","journal-title":"Chapter"},{"volume-title":"Symp. Cloud Computing","author":"Kappes Giorgos","key":"e_1_3_2_1_3_1","unstructured":"Giorgos Kappes and Stergios V. Anastasiadis . 2020. A User-Level Toolkit for Storage I\/O Isolation on Multitenant Hosts . In Symp. Cloud Computing ( Virtual Event, USA). ACM, New York, NY, 74--89. Giorgos Kappes and Stergios V. Anastasiadis. 2020. A User-Level Toolkit for Storage I\/O Isolation on Multitenant Hosts. In Symp. Cloud Computing (Virtual Event, USA). ACM, New York, NY, 74--89."},{"key":"e_1_3_2_1_4_1","volume-title":"Linearizable FIFO Queue for Fine-Granular Work Distribution on the GPU. In Intl. Conf. Supercomputing","author":"Kerbl Bernhard","year":"2018","unstructured":"Bernhard Kerbl , Michael Kenzel , Joerg H. Mueller , Dieter Schmalstieg , and Markus Steinberger . 2018 . The Broker Queue: A Fast , Linearizable FIFO Queue for Fine-Granular Work Distribution on the GPU. In Intl. Conf. Supercomputing ( Beijing, China). ACM, New York, NY, 76--85. Bernhard Kerbl, Michael Kenzel, Joerg H. Mueller, Dieter Schmalstieg, and Markus Steinberger. 2018. The Broker Queue: A Fast, Linearizable FIFO Queue for Fine-Granular Work Distribution on the GPU. In Intl. Conf. Supercomputing (Beijing, China). ACM, New York, NY, 76--85."},{"volume-title":"Fast and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Symposium on Principles of Distributed Computing","author":"Maged","key":"e_1_3_2_1_6_1","unstructured":"Maged M. Michael and Michael L. Scott. 1996. Simple , Fast and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Symposium on Principles of Distributed Computing ( Philadelphia, PA). ACM, New York, NY, 267--275. Maged M. Michael and Michael L. Scott. 1996. Simple, Fast and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Symposium on Principles of Distributed Computing (Philadelphia, PA). ACM, New York, NY, 267--275."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442527"},{"key":"e_1_3_2_1_8_1","volume-title":"Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. In Symposium on Parallelism in Algorithms and Architectures","author":"Rihani Hamza","year":"2015","unstructured":"Hamza Rihani , Peter Sanders , and Roman Dementiev . 2015 . Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. In Symposium on Parallelism in Algorithms and Architectures ( Portland, OR). ACM, New York, NY, 80--82. Hamza Rihani, Peter Sanders, and Roman Dementiev. 2015. Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. In Symposium on Parallelism in Algorithms and Architectures (Portland, OR). ACM, New York, NY, 80--82."},{"volume-title":"Nonblocking Concurrent Data Structures with Condition Synchronization. In Intl. Conf. Distributed Computing","author":"William","key":"e_1_3_2_1_9_1","unstructured":"William N. Scherer and Michael L. Scott. 2004 . Nonblocking Concurrent Data Structures with Condition Synchronization. In Intl. Conf. Distributed Computing ( Amsterdam, Netherlands). Springer, Berlin, Heidelberg, 174--187. William N. Scherer and Michael L. Scott. 2004. Nonblocking Concurrent Data Structures with Condition Synchronization. In Intl. Conf. Distributed Computing (Amsterdam, Netherlands). Springer, Berlin, Heidelberg, 174--187."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851168"}],"event":{"name":"PPoPP '21: 26th ACM SIGPLAN 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":"Virtual Event Republic of Korea","acronym":"PPoPP '21"},"container-title":["Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441583","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:25Z","timestamp":1750191445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":9,"alternative-id":["10.1145\/3437801.3441583","10.1145\/3437801"],"URL":"https:\/\/doi.org\/10.1145\/3437801.3441583","relation":{},"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"2021-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}