{"id":"https://openalex.org/W2170994858","doi":"https://doi.org/10.1109/ipdps.2004.1303076","title":"Pfair scheduling of periodic tasks with allocation constraints on multiple processors","display_name":"Pfair scheduling of periodic tasks with allocation constraints on multiple processors","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2170994858","doi":"https://doi.org/10.1109/ipdps.2004.1303076","mag":"2170994858"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","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/A5100680704","display_name":"Deming Liu","orcid":"https://orcid.org/0000-0001-5591-2929"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Deming Liu","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","[Department of Computer Science & Engineering, Arizona State University, Tempe, AZ, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"[Department of Computer Science & Engineering, Arizona State University, Tempe, AZ, USA]","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045278420","display_name":"Yann-Hang Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yann-Hang Lee","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","[Department of Computer Science & Engineering, Arizona State University, Tempe, AZ, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"[Department of Computer Science & Engineering, Arizona State University, Tempe, AZ, USA]","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100680704"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.7899,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.73835313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","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/T10933","display_name":"Real-Time Systems Scheduling","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9900000095367432,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.762274444103241},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6920801401138306},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5759206414222717},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5596719980239868},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5229964256286621},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4894069731235504},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47847720980644226},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44394034147262573},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43429237604141235},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4248565435409546},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41336244344711304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24404582381248474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15030646324157715}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.762274444103241},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6920801401138306},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5759206414222717},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5596719980239868},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5229964256286621},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4894069731235504},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47847720980644226},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44394034147262573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43429237604141235},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4248565435409546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41336244344711304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24404582381248474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15030646324157715},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2004.1303076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1628974215","https://openalex.org/W1964119857","https://openalex.org/W2056830486","https://openalex.org/W2086748818","https://openalex.org/W2090359754","https://openalex.org/W2104338317","https://openalex.org/W2109488193","https://openalex.org/W2116427457","https://openalex.org/W2157407983","https://openalex.org/W2164295489","https://openalex.org/W2262960161"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2148608945","https://openalex.org/W3112689649","https://openalex.org/W2998357381","https://openalex.org/W2808535280","https://openalex.org/W2101020326","https://openalex.org/W1966261337"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2,19,52],"given.":[3],"Pfair":[4],"scheduling":[5,138,148],"for":[6,106,147],"periodic":[7,40,107,121],"tasks":[8,29,41,50,85,108,122],"on":[9],"multiple":[10],"processors":[11],"in":[12,45,67,80,130],"a":[13,95,157],"time":[14,171],"slotted":[15],"environment":[16],"can":[17,51,127],"not":[18,161],"guarantee":[20],"task":[21,159],"deadlines":[22],"to":[23,55,88,163],"be":[24,53,128],"respected,":[25],"but":[26],"also":[27],"make":[28],"execute":[30],"at":[31],"steady":[32],"progressive":[33],"rates.":[34],"We":[35],"consider":[36],"pfair":[37,78,104,117,137,143],"schedulability":[38,118],"of":[39,63,100,103,120,170],"with":[42,109,123],"allocation":[43,111,125],"constraints":[44,126],"the":[46,64,68,81,101,168],"sense":[47],"that":[48,75,83,116],"some":[49],"assigned":[54,87],"one":[56],"or":[57],"more":[58],"specified":[59],"processors.":[60],"The":[61],"contributions":[62],"paper":[65],"lie":[66],"following":[69],"four":[70],"aspects.":[71],"Firstly,":[72],"we":[73,93,114],"prove":[74],"there":[76],"exists":[77],"schedule":[79,105],"case":[82],"fixed":[84,149,158],"are":[86],"disjoined":[89],"processor":[90],"subsets.":[91],"Secondly,":[92],"give":[94],"sufficient":[96],"and":[97,150],"necessary":[98],"condition":[99],"existence":[102],"arbitrary":[110,124],"constraints.":[112],"Thirdly,":[113],"show":[115],"test":[119],"done":[129],"polynomial":[131],"time.":[132],"Finally,":[133],"an":[134],"online":[135],"approximate":[136],"algorithm":[139],"called":[140],"HPA":[141,154],"(hierarchical":[142],"algorithm)":[144],"is":[145,160,178],"proposed":[146],"migrating":[151],"tasks.":[152],"With":[153],"although":[155],"idea":[156],"guaranteed":[162],"respect":[164],"its":[165,176],"deadline":[166,177],"completely,":[167],"amount":[169],"by":[172],"which":[173],"it":[174],"misses":[175],"bounded.":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}