{"id":"https://openalex.org/W4415148257","doi":"https://doi.org/10.1145/3771738","title":"The MultiQueue: A Simple and Fast Relaxed Concurrent Priority Queue","display_name":"The MultiQueue: A Simple and Fast Relaxed Concurrent Priority Queue","publication_year":2025,"publication_date":"2025-10-14","ids":{"openalex":"https://openalex.org/W4415148257","doi":"https://doi.org/10.1145/3771738"},"language":"en","primary_location":{"id":"doi:10.1145/3771738","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3771738","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3771738","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061238962","display_name":"Marvin Williams","orcid":"https://orcid.org/0000-0002-1990-0899"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marvin Williams","raw_affiliation_strings":["Institute of Theoretical Informatics, Karlsruhe Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0002-1990-0899","affiliations":[{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082922326","display_name":"Peter Sanders","orcid":"https://orcid.org/0000-0003-3330-9349"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Sanders","raw_affiliation_strings":["Institute of Theoretical Informatics, Karlsruhe Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0003-3330-9349","affiliations":[{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":0.9905,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.8191656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":"12","issue":"4","first_page":"1","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.7720000147819519},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7361999750137329},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6575999855995178},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.5781999826431274},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5595999956130981},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.5235999822616577},{"id":"https://openalex.org/keywords/event","display_name":"Event (particle physics)","score":0.41999998688697815},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4049000144004822}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8174999952316284},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.7720000147819519},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7361999750137329},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6575999855995178},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.5781999826431274},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5595999956130981},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.5235999822616577},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5095000267028809},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.41999998688697815},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4049000144004822},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.38830000162124634},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.38670000433921814},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.37049999833106995},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.364300012588501},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.296999990940094},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2825999855995178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27149999141693115},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C147203929","wikidata":"https://www.wikidata.org/wiki/Q574814","display_name":"Discrete event simulation","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3771738","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3771738","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3771738","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3771738","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W14558443","https://openalex.org/W1508299786","https://openalex.org/W1587463421","https://openalex.org/W1678178911","https://openalex.org/W1963503748","https://openalex.org/W1967362387","https://openalex.org/W1970702766","https://openalex.org/W1983572666","https://openalex.org/W1990986484","https://openalex.org/W1996492982","https://openalex.org/W2003898228","https://openalex.org/W2005199432","https://openalex.org/W2012223233","https://openalex.org/W2034102265","https://openalex.org/W2036521380","https://openalex.org/W2043047774","https://openalex.org/W2057112598","https://openalex.org/W2061394399","https://openalex.org/W2063800777","https://openalex.org/W2068739275","https://openalex.org/W2070991879","https://openalex.org/W2089439745","https://openalex.org/W2090747326","https://openalex.org/W2101939036","https://openalex.org/W2106782772","https://openalex.org/W2127620007","https://openalex.org/W2132473764","https://openalex.org/W2139142311","https://openalex.org/W2140908587","https://openalex.org/W2163121173","https://openalex.org/W2555198020","https://openalex.org/W2581324891","https://openalex.org/W2625050767","https://openalex.org/W2739409954","https://openalex.org/W2741644788","https://openalex.org/W2912437396","https://openalex.org/W2917654163","https://openalex.org/W2945703238","https://openalex.org/W2950343219","https://openalex.org/W2963146589","https://openalex.org/W2963708011","https://openalex.org/W2982518754","https://openalex.org/W2988838119","https://openalex.org/W3198705423","https://openalex.org/W3198810785","https://openalex.org/W4220783457","https://openalex.org/W4238937905","https://openalex.org/W4239542686","https://openalex.org/W4240200084","https://openalex.org/W4285092328","https://openalex.org/W4293768823","https://openalex.org/W4399345956","https://openalex.org/W4403444443"],"related_works":[],"abstract_inverted_index":{"Priority":[0],"queues":[1,25,44,73],"are":[2],"used":[3],"in":[4,32,41],"a":[5,28,56,128,146],"wide":[6],"range":[7],"of":[8,79,85,109,127,139,198],"applications,":[9],"including":[10],"prioritized":[11],"online":[12],"scheduling,":[13],"discrete":[14],"event":[15],"simulation,":[16],"and":[17,59,100,135,154,161,183,190],"greedy":[18],"algorithms.":[19],"In":[20,48],"parallel":[21],"settings,":[22],"classical":[23],"priority":[24,43,62,72,143],"often":[26],"become":[27],"severe":[29],"bottleneck,":[30],"resulting":[31],"low":[33],"throughput.":[34],"Consequently,":[35],"there":[36],"has":[37],"been":[38],"significant":[39],"interest":[40,200],"concurrent":[42,209],"with":[45,141],"relaxed":[46,61,208],"semantics.":[47],"this":[49],"article,":[50],"we":[51,191],"present":[52],"the":[53,75,86,97,106,110,132,165,179],"MultiQueue":[54,87,111,166],",":[55],"highly":[57],"scalable":[58],"flexible":[60],"queue.":[63],"Its":[64],"design":[65,173],"is":[66,88,117],"based":[67,156],"on":[68,96,151,157],"leveraging":[69],"multiple":[70],"internal":[71,98],"using":[74,119],"seemingly":[76],"paradoxical":[77],"technique":[78],"\u201cwait-free":[80,194],"locking\u201d.":[81],"The":[82,115],"practical":[83],"performance":[84],"further":[89],"enhanced":[90],"by":[91],"element":[92,130],"buffering,":[93],"batched":[94],"operations":[95],"queues,":[99],"cache-optimized":[101],"access":[102],"patterns.":[103],"We":[104],"evaluate":[105],"quality-throughput":[107],"tradeoff":[108],"against":[112],"state-of-the-art":[113],"competitors.":[114,170],"quality":[116,184],"measured":[118],"two":[120],"complementary":[121],"metrics:":[122],"rank":[123],"error":[124],"(the":[125,137],"distance":[126],"deleted":[129,144],"to":[131,176,185],"best":[133],"element),":[134],"delay":[136],"number":[138],"elements":[140],"lower":[142],"before":[145],"given":[147],"element).":[148],"Extensive":[149],"experiments":[150],"both":[152],"micro-benchmarks":[153],"benchmarks":[155],"real-world":[158],"applications":[159],"(shortest-path":[160],"branch-and-bound)":[162],"show":[163],"that":[164,193],"consistently":[167],"outperforms":[168],"its":[169,172],"Additionally,":[171],"allows":[174],"users":[175],"easily":[177],"tune":[178],"balance":[180],"between":[181],"throughput":[182],"meet":[186],"specific":[187],"application":[188],"requirements,":[189],"believe":[192],"locking\u201d":[195],"may":[196],"be":[197],"broader":[199],"for":[201],"converting":[202],"sequential":[203],"data":[204],"structures":[205],"into":[206],"high-performance,":[207],"ones.":[210]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-01T08:55:40.977307","created_date":"2025-10-14T00:00:00"}