{"id":"https://openalex.org/W2115693940","doi":"https://doi.org/10.1145/2555243.2555278","title":"Data structures for task-based priority scheduling","display_name":"Data structures for task-based priority scheduling","publication_year":2014,"publication_date":"2014-02-06","ids":{"openalex":"https://openalex.org/W2115693940","doi":"https://doi.org/10.1145/2555243.2555278","mag":"2115693940"},"language":"en","primary_location":{"id":"doi:10.1145/2555243.2555278","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2555243.2555278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th 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/A5037403044","display_name":"Martin Wimmer","orcid":"https://orcid.org/0009-0009-2716-8886"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Martin Wimmer","raw_affiliation_strings":["Vienna University of Technology, Vienna, Austria","Vienna University of technology, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010522931","display_name":"Francesco Versaci","orcid":"https://orcid.org/0000-0003-2513-3590"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Francesco Versaci","raw_affiliation_strings":["Vienna University of Technology, Vienna, Austria","Vienna University of technology, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064279948","display_name":"Jesper Larsson Tr\u00e4ff","orcid":"https://orcid.org/0000-0002-4864-9226"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Jesper Larsson Tr\u00e4ff","raw_affiliation_strings":["Vienna University of Technology, Vienna, Austria","Vienna University of technology, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034170956","display_name":"Daniel Cederman","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Daniel Cederman","raw_affiliation_strings":["Chalmers University of Technology, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003177344","display_name":"Philippas Tsigas","orcid":"https://orcid.org/0000-0001-9635-9154"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Philippas Tsigas","raw_affiliation_strings":["Chalmers University of Technology, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3568,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.96044668,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"379","last_page":"380"},"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.9993000030517578,"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.9993000030517578,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9940999746322632,"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/computer-science","display_name":"Computer science","score":0.8713259696960449},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.7375125885009766},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7180789709091187},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6983609795570374},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.5321050882339478},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.45814627408981323},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.44938626885414124},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.4439612925052643},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4261144995689392},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3846525251865387},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.37205034494400024},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3457469940185547},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.3027310073375702},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.26712504029273987},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24847650527954102},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14679855108261108},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09445655345916748}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8713259696960449},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7375125885009766},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7180789709091187},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6983609795570374},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.5321050882339478},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.45814627408981323},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.44938626885414124},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.4439612925052643},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4261144995689392},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3846525251865387},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.37205034494400024},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3457469940185547},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.3027310073375702},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26712504029273987},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24847650527954102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14679855108261108},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09445655345916748},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2555243.2555278","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2555243.2555278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.748.423","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.748.423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1312.2501.pdf","raw_type":"text"},{"id":"pmh:oai:research.chalmers.se:196874","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/196874","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1607723","https://openalex.org/W1543180701","https://openalex.org/W2004658153","https://openalex.org/W2083630254","https://openalex.org/W2952529154","https://openalex.org/W6600066165","https://openalex.org/W6677044019"],"related_works":["https://openalex.org/W2543329403","https://openalex.org/W1935185185","https://openalex.org/W2352790745","https://openalex.org/W2386407620","https://openalex.org/W2375726820","https://openalex.org/W2545511463","https://openalex.org/W2167574351","https://openalex.org/W2377321505","https://openalex.org/W2393789493","https://openalex.org/W2899933590"],"abstract_inverted_index":{"We":[0,55,107],"present":[1],"three":[2],"lock-free":[3],"data":[4,131,162],"structures":[5,163],"for":[6,62,115,158],"priority":[7,11,58,101,143],"task":[8,59,104],"scheduling:":[9],"a":[10,14,21,74,112,166],"work-stealing":[12],"one,":[13],"centralized":[15],"one":[16,23],"with":[17],"\u03c1-relaxed":[18],"semantics,":[19],"and":[20,45,65,100],"hybrid":[22,129],"combining":[24],"both":[25],"concepts.":[26],"With":[27],"the":[28,39,43,50,70,80,84,96,117,127,149,174],"single-source":[29],"shortest":[30],"path":[31],"(SSSP)":[32],"problem":[33],"as":[34,135,137],"example,":[35],"we":[36],"show":[37,108],"how":[38],"different":[40],"approaches":[41],"affect":[42],"prioritization":[44],"provide":[46],"upper":[47],"bounds":[48],"on":[49,148],"number":[51],"of":[52,83,90,169],"examined":[53],"nodes.":[54],"argue":[56],"that":[57,109],"scheduling":[60,105,144],"allows":[61],"an":[63],"intuitive":[64],"easy":[66],"way":[67],"to":[68,94,124,177],"parallelize":[69],"SSSP":[71],"problem,":[72],"notoriously":[73],"hard":[75],"task.":[76],"Experimental":[77],"evidence":[78],"supports":[79],"good":[81],"scalability":[82,99],"resulting":[85],"algorithm.":[86],"The":[87],"larger":[88],"aim":[89],"this":[91],"work":[92],"is":[93,111],"understand":[95],"trade-offs":[97],"between":[98],"guarantees":[102],"in":[103],"systems.":[106],"\u03c1-relaxation":[110],"valuable":[113],"technique":[114],"improving":[116],"first,":[118],"while":[119,139],"still":[120,140,172],"allowing":[121],"semantic":[122,175],"constraints":[123,176],"be":[125,178],"satisfied:":[126],"lock-free,":[128],"$k$-priority":[130],"structure":[132],"can":[133],"scale":[134],"well":[136],"work-stealing,":[138],"providing":[141],"strong":[142],"guarantees,":[145],"which":[146,171],"depend":[147],"parameter":[150],"k.":[151],"Our":[152],"theoretical":[153],"results":[154],"open":[155],"up":[156],"possibilities":[157],"even":[159],"more":[160],"scalable":[161],"by":[164],"adopting":[165],"weaker":[167],"form":[168],"\u03c1-relaxation,":[170],"enables":[173],"respected.":[179]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}