{"id":"https://openalex.org/W4220783457","doi":"https://doi.org/10.1145/3503221.3508432","title":"Multi-queues can be state-of-the-art priority schedulers","display_name":"Multi-queues can be state-of-the-art priority schedulers","publication_year":2022,"publication_date":"2022-03-28","ids":{"openalex":"https://openalex.org/W4220783457","doi":"https://doi.org/10.1145/3503221.3508432"},"language":"en","primary_location":{"id":"doi:10.1145/3503221.3508432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3503221.3508432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009049737","display_name":"Anastasiia Postnikova","orcid":null},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Anastasiia Postnikova","raw_affiliation_strings":["ITMO University"],"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047006729","display_name":"Nikita Koval","orcid":"https://orcid.org/0000-0002-1260-4616"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikita Koval","raw_affiliation_strings":["JetBrains"],"affiliations":[{"raw_affiliation_string":"JetBrains","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025497029","display_name":"Giorgi Nadiradze","orcid":"https://orcid.org/0000-0001-5634-0731"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Giorgi Nadiradze","raw_affiliation_strings":["IST Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083822059","display_name":"Dan Alistarh","orcid":"https://orcid.org/0000-0003-3650-940X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["IST Austria"],"affiliations":[{"raw_affiliation_string":"IST Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5009049737"],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":3.1788,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9209008,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"353","last_page":"367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9993000030517578,"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.7603840231895447},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.7586864829063416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7508863210678101},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6243469715118408},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6157927513122559},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.48656168580055237},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45537269115448},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3599321246147156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35608184337615967},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2028358280658722},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10325023531913757},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08316776156425476}],"concepts":[{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.7603840231895447},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.7586864829063416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7508863210678101},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6243469715118408},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6157927513122559},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.48656168580055237},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45537269115448},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3599321246147156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35608184337615967},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2028358280658722},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10325023531913757},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08316776156425476},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3503221.3508432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3503221.3508432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1438340602","https://openalex.org/W1979055695","https://openalex.org/W2000041758","https://openalex.org/W2012223233","https://openalex.org/W2016559894","https://openalex.org/W2034102265","https://openalex.org/W2061394399","https://openalex.org/W2099160142","https://openalex.org/W2235134718","https://openalex.org/W2327526361","https://openalex.org/W2581324891","https://openalex.org/W2739409954","https://openalex.org/W2765149243","https://openalex.org/W2802440256","https://openalex.org/W2886779068","https://openalex.org/W2951846568","https://openalex.org/W2963146589","https://openalex.org/W2988838119","https://openalex.org/W3099866104","https://openalex.org/W3102883299","https://openalex.org/W3103720127","https://openalex.org/W4205190765","https://openalex.org/W4220984812","https://openalex.org/W4232836277","https://openalex.org/W6672478477","https://openalex.org/W6679463428"],"related_works":["https://openalex.org/W2023832055","https://openalex.org/W2082485924","https://openalex.org/W2036343335","https://openalex.org/W189328514","https://openalex.org/W2262651858","https://openalex.org/W2951223296","https://openalex.org/W4297169359","https://openalex.org/W2143289692","https://openalex.org/W1974858599","https://openalex.org/W3049636605"],"abstract_inverted_index":{"Designing":[0],"and":[1,22,47,59],"implementing":[2],"efficient":[3],"parallel":[4],"priority":[5,27],"schedulers":[6],"is":[7,16,79,90],"an":[8],"active":[9],"research":[10],"area.":[11],"An":[12],"intriguing":[13],"proposed":[14],"design":[15],"the":[17,49,65,85],"Multi-Queue:":[18],"given":[19],"n":[20,25],"threads":[21],"m":[23],"\u2265":[24],"distinct":[26],"queues,":[28,78],"task":[29,51,69],"insertions":[30],"are":[31],"performed":[32],"uniformly":[33,44],"at":[34,45],"random,":[35,46],"while,":[36],"to":[37,72],"delete,":[38],"a":[39],"thread":[40],"picks":[41],"two":[42],"queues":[43],"removes":[48],"observed":[50],"of":[52,67,87,93],"higher":[53],"priority.":[54],"This":[55],"approach":[56],"scales":[57],"well,":[58],"has":[60],"probabilistic":[61],"rank":[62,66],"guarantees:":[63],"roughly,":[64],"each":[68],"removed,":[70],"relative":[71],"remaining":[73],"tasks":[74],"in":[75,82],"all":[76],"other":[77],"O":[80],"(m)":[81],"expectation.":[83],"Yet,":[84],"performance":[86],"this":[88],"pattern":[89],"below":[91],"that":[92],"well-engineered":[94],"schedulers,":[95],"which":[96],"eschew":[97],"theoretical":[98],"guarantees":[99],"for":[100],"practical":[101],"efficiency.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}