{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:24Z","timestamp":1750221144582,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Israel Science Foundation","award":["274\/14"],"award-info":[{"award-number":["274\/14"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210388","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"99-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["BQ"],"prefix":"10.1145","author":[{"given":"Gal","family":"Milman","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Alex","family":"Kogan","sequence":"additional","affiliation":[{"name":"Oracle Labs, Burlington, MA, USA"}]},{"given":"Yossi","family":"Lev","sequence":"additional","affiliation":[{"name":"Oracle Labs, Burlington, MA, USA"}]},{"given":"Victor","family":"Luchangco","sequence":"additional","affiliation":[{"name":"Oracle Labs, Burlington, MA, USA"}]},{"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Caf\u00e9: Scalable task pools with adjustable fairness and contention DISC.","author":"Basin Dmitry","year":"2011","unstructured":"Dmitry Basin , Rui Fan , Idit Keidar , Ofer Kiselov , and Dmitri Perelman . 2011 . Caf\u00e9: Scalable task pools with adjustable fairness and contention DISC. Dmitry Basin, Rui Fan, Idit Keidar, Ofer Kiselov, and Dmitri Perelman . 2011. Caf\u00e9: Scalable task pools with adjustable fairness and contention DISC."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755579"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCS.2005.49"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989549"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145849"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345215"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Anders Gidenstam H\u00e5kan Sundell and Philippas Tsigas . 2010. Cache-aware lock-free queues for multiple producers\/consumers and weak memory consistency. In OPODIS.   Anders Gidenstam H\u00e5kan Sundell and Philippas Tsigas . 2010. Cache-aware lock-free queues for multiple producers\/consumers and weak memory consistency. In OPODIS.","DOI":"10.1007\/978-3-642-17653-1_23"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/70082.68188"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/69624.357206"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482767.2482789"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/210223.210225"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_15_1","volume-title":"The baskets queue. OPODIS","author":"Hoffman Moshe","year":"2007","unstructured":"Moshe Hoffman , Ori Shalev , and Nir Shavit . 2007. The baskets queue. OPODIS ( 2007 ). Moshe Hoffman, Ori Shalev, and Nir Shavit . 2007. The baskets queue. OPODIS (2007)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39958-9_18"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611496"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087838"},{"key":"e_1_3_2_1_19_1","volume-title":"An optimistic approach to lock-free FIFO queues. Distributed Computing","author":"Ladan-Mozes Edya","year":"2008","unstructured":"Edya Ladan-Mozes and Nir Shavit . 2008. An optimistic approach to lock-free FIFO queues. Distributed Computing Vol. 20 , 5 ( 2008 ). Edya Ladan-Mozes and Nir Shavit . 2008. An optimistic approach to lock-free FIFO queues. Distributed Computing Vol. 20, 5 (2008)."},{"key":"e_1_3_2_1_20_1","unstructured":"Doug Lea . 2009. The java concurrency package (JSR-166).  Doug Lea . 2009. The java concurrency package (JSR-166)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Gal Milman Alex Kogan Yossi Lev Victor Luchangco and Erez Petrank . 2018. BQ: a lock-free queue with batching (full paper). (2018). deftempurl%http:\/\/www.cs.technion.ac.il\/ erez\/Papers\/bq-full.pdf tempurl  Gal Milman Alex Kogan Yossi Lev Victor Luchangco and Erez Petrank . 2018. BQ: a lock-free queue with batching (full paper). (2018). deftempurl%http:\/\/www.cs.technion.ac.il\/ erez\/Papers\/bq-full.pdf tempurl","DOI":"10.1145\/3210377.3210388"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074013"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442527"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92295-7_10"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378611"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851168"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:13Z","timestamp":1750208893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210388"}},"subtitle":["A Lock-Free Queue with Batching"],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":28,"alternative-id":["10.1145\/3210377.3210388","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210388","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}