{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:58Z","timestamp":1750307038223,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"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":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312057","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"298-307","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On the cost of composing shared-memory algorithms"],"prefix":"10.1145","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[{"name":"TU-Berlin\/Telekom Innovation Labs , Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuliano","family":"Losa","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"85","volume-title":"WDAG '92","author":"Afek Yehuda","year":"1992","unstructured":"Yehuda Afek , Eli Gafni , John Tromp , and Paul M. B. Vit\u00e1nyi . Wait-free test-and-set (extended abstract) . In WDAG '92 , pages 85 -- 94 , London, UK , 1992 . Springer-Verlag. Yehuda Afek, Eli Gafni, John Tromp, and Paul M. B. Vit\u00e1nyi. Wait-free test-and-set (extended abstract). In WDAG '92, pages 85--94, London, UK, 1992. Springer-Verlag."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/s004460100060"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1281100.1281107"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/1946143.1946147"},{"key":"e_1_3_2_1_5_1","volume-title":"EPFL","author":"Alistarh Dan","year":"2012","unstructured":"Dan Alistarh , Rachid Guerraoui , Petr Kuznetsov , and Giuliano Losa . On the complexity of composing shared-memory algorithms. Technical report , EPFL , 2012 . Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, and Giuliano Losa. On the complexity of composing shared-memory algorithms. Technical report, EPFL, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1538902.1538908"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1926385.1926442"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/637437.637447"},{"key":"e_1_3_2_1_9_1","volume-title":"Sun Microsystems","author":"Dice David","year":"2003","unstructured":"David Dice , Mark Moir , and William Scherer . Quickly reacquirable locks. Technical report , Sun Microsystems , 2003 . David Dice, Mark Moir, and William Scherer. Quickly reacquirable locks. Technical report, Sun Microsystems, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/571825.571838"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1016\/0020-0190(90)90185-Z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1755913.1755950"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/2254064.2254072"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/114005.102808"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/78969.78972"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/277697.277731"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/872035.872079"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-540-39989-6_4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1854273.1854287"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"SPAA '12","name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pittsburgh Pennsylvania USA"},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312057","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:52Z","timestamp":1750238452000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":19,"alternative-id":["10.1145\/2312005.2312057","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312057","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}