{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:32Z","timestamp":1750220852611,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Research Foundation","award":["160364472-SFB901"],"award-info":[{"award-number":["160364472-SFB901"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323193","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"287-296","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Skeap & Seap"],"prefix":"10.1145","author":[{"given":"Michael","family":"Feldmann","sequence":"first","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1990.143500"},{"key":"e_1_3_2_1_2_1","volume-title":"Koninklijke Nederlandsche Akademie Van Wetenschappen","volume":"49","author":"de Bruijn N. G.","year":"1946","unstructured":"N. G. de Bruijn . 1946 . A Combinatorial Problem . Koninklijke Nederlandsche Akademie Van Wetenschappen , Vol. 49 , 6 (29 June 1946), 758--764. N. G. de Bruijn. 1946. A Combinatorial Problem. Koninklijke Nederlandsche Akademie Van Wetenschappen, Vol. 49, 6 (29 June 1946), 758--764."},{"key":"e_1_3_2_1_3_1","volume-title":"Scalable Distributed Priority Queues for constant and arbitrary Priorities. CoRR","author":"Feldmann Michael","year":"2018","unstructured":"Michael Feldmann and Christian Scheideler . 2018. Skeap & Seap : Scalable Distributed Priority Queues for constant and arbitrary Priorities. CoRR , Vol. abs\/ 1805 .03472 ( 2018 ). arxiv: 1805.03472 http:\/\/arxiv.org\/abs\/1805.03472 Michael Feldmann and Christian Scheideler. 2018. Skeap & Seap: Scalable Distributed Priority Queues for constant and arbitrary Priorities. CoRR, Vol. abs\/1805.03472 (2018). arxiv: 1805.03472 http:\/\/arxiv.org\/abs\/1805.03472"},{"key":"e_1_3_2_1_4_1","volume-title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue. In IPDPS. 1040--1049.","author":"Feldmann Michael","year":"2018","unstructured":"Michael Feldmann , Christian Scheideler , and Alexander Setzer . 2018 . Skueue: A Scalable and Sequentially Consistent Distributed Queue. In IPDPS. 1040--1049. Michael Feldmann, Christian Scheideler, and Alexander Setzer. 2018. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In IPDPS. 1040--1049."},{"key":"e_1_3_2_1_5_1","volume-title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue. CoRR","author":"Feldmann Michael","year":"2018","unstructured":"Michael Feldmann , Christian Scheideler , and Alexander Setzer . 2018 . Skueue: A Scalable and Sequentially Consistent Distributed Queue. CoRR , Vol. abs\/ 1802 .07504 (2018). arxiv: 1802.07504 http:\/\/arxiv.org\/abs\/1802.07504 Michael Feldmann, Christian Scheideler, and Alexander Setzer. 2018. Skueue: A Scalable and Sequentially Consistent Distributed Queue. CoRR, Vol. abs\/1802.07504 (2018). arxiv: 1802.07504 http:\/\/arxiv.org\/abs\/1802.07504"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806718"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/68182.68188"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Allan Gottlieb Ralph Grishman Clyde P. Kruskal Kevin P. McAuliffe Larry Rudolph and Marc Snir. 1998. The NYU Ultracomputer - Designing a MIMD Shared-Memory Parallel Machine. In 25 Years of the International Symposia on Computer Architecture (Selected Papers). 239--254.  Allan Gottlieb Ralph Grishman Clyde P. Kruskal Kevin P. McAuliffe Larry Rudolph and Marc Snir. 1998. The NYU Ultracomputer - Designing a MIMD Shared-Memory Parallel Machine. In 25 Years of the International Symposia on Computer Architecture (Selected Papers). 239--254.","DOI":"10.1145\/285930.285983"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Bernhard Haeupler Jeet Mohapatra and Hsin-Hao Su. 2018. Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. In PODC. 179--188.  Bernhard Haeupler Jeet Mohapatra and Hsin-Hao Su. 2018. Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. In PODC. 179--188.","DOI":"10.1145\/3212734.3212770"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.08.011"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00148-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1097"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248401"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582722"},{"key":"e_1_3_2_1_16_1","volume-title":"Scott","author":"Michael Maged M.","year":"1996","unstructured":"Maged M. Michael and Michael L . Scott . 1996 . Simple, Fast , and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In PODC. 267--275. Maged M. Michael and Michael L. Scott. 1996. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In PODC. 267--275."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Mark Moir and Nir Shavit. 2004. Concurrent Data Structures. In Handbook of Data Structures and Applications.  Mark Moir and Nir Shavit. 2004. Concurrent Data Structures. In Handbook of Data Structures and Applications.","DOI":"10.1201\/9781420035179.ch47"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273350"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258523"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160108"},{"key":"e_1_3_2_1_21_1","volume-title":"Rowstron and Peter Druschel","author":"Antony I.","year":"2001","unstructured":"Antony I. T. Rowstron and Peter Druschel . 2001 . Pastry : Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In Middleware . 329--350. Antony I. T. Rowstron and Peter Druschel. 2001. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In Middleware. 329--350."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_47"},{"key":"e_1_3_2_1_23_1","unstructured":"Nir Shavit and Itay Lotan. 2000. Skiplist-Based Concurrent Priority Queues. In IPDPS. 263--268.   Nir Shavit and Itay Lotan. 2000. Skiplist-Based Concurrent Priority Queues. In IPDPS. 263--268."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301339"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383071"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818784"}],"event":{"name":"SPAA '19: 31st 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":"Phoenix AZ USA","acronym":"SPAA '19"},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323193"}},"subtitle":["Scalable Distributed Priority Queues for Constant and Arbitrary Priorities"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":26,"alternative-id":["10.1145\/3323165.3323193","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323193","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}