{"id":"https://openalex.org/W2147453591","doi":"https://doi.org/10.1109/emrts.2003.1212725","title":"The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%","display_name":"The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W2147453591","doi":"https://doi.org/10.1109/emrts.2003.1212725","mag":"2147453591"},"language":"en","primary_location":{"id":"doi:10.1109/emrts.2003.1212725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emrts.2003.1212725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"15th Euromicro Conference on Real-Time Systems, 2003. 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/A5111558021","display_name":"Bj\u00f6rn Andersson","orcid":"https://orcid.org/0000-0002-4718-5722"},"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":"B. Andersson","raw_affiliation_strings":["Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108523787","display_name":"J. J\u00f6nsson","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":"J. Jonsson","raw_affiliation_strings":["Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chalmers University of Technology and G\u00f6teborg University, Goteborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7701,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.95004885,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9951000213623047,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9933000206947327,"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.7831538915634155},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.666094958782196},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.6522236466407776},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6471593379974365},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.6333526372909546},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5930102467536926},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5875095725059509},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.568926215171814},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.5514543652534485},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5279055237770081},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5004751682281494},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4919111728668213},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4784541130065918},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.4738505184650421},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2019137144088745},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1583489179611206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1275390088558197},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.048542171716690063}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7831538915634155},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.666094958782196},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.6522236466407776},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6471593379974365},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.6333526372909546},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5930102467536926},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5875095725059509},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.568926215171814},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.5514543652534485},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5279055237770081},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5004751682281494},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4919111728668213},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4784541130065918},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.4738505184650421},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2019137144088745},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1583489179611206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1275390088558197},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.048542171716690063}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/emrts.2003.1212725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emrts.2003.1212725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:139044","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/139044","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":20,"referenced_works":["https://openalex.org/W85119474","https://openalex.org/W1510429808","https://openalex.org/W1522258883","https://openalex.org/W1568809964","https://openalex.org/W2054998117","https://openalex.org/W2056830486","https://openalex.org/W2064207294","https://openalex.org/W2086061827","https://openalex.org/W2095540735","https://openalex.org/W2101300711","https://openalex.org/W2116427457","https://openalex.org/W2120512156","https://openalex.org/W2134202349","https://openalex.org/W2135559191","https://openalex.org/W2157476829","https://openalex.org/W2158002367","https://openalex.org/W2166440675","https://openalex.org/W2167207895","https://openalex.org/W2543632133","https://openalex.org/W4229885360"],"related_works":["https://openalex.org/W2364408853","https://openalex.org/W2186454171","https://openalex.org/W2372058405","https://openalex.org/W1591583623","https://openalex.org/W2163007708","https://openalex.org/W2464659810","https://openalex.org/W2377321505","https://openalex.org/W1591946588","https://openalex.org/W2108793785","https://openalex.org/W2612088627"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"preemptive":[3],"static-priority":[4,14,50],"scheduling":[5,15,52],"on":[6],"multiprocessors.":[7],"We":[8,22],"consider":[9],"two":[10],"approaches:":[11],"global":[12],"pfair":[13],"and":[16,30],"partitioned":[17],"traditional":[18],"static":[19],"priority":[20],"scheduling.":[21],"prove":[23],"that":[24,48],"if":[25,31],"presented":[26],"algorithms":[27],"are":[28,43],"used":[29,39],"less":[32],"than":[33,60],"50%":[34],"of":[35],"the":[36],"capacity":[37],"is":[38,46],"then":[40],"all":[41],"deadlines":[42],"met.":[44],"It":[45],"known":[47],"no":[49],"multiprocessor":[51],"algorithm":[53],"can":[54],"achieve":[55],"a":[56],"utilization":[57],"bound":[58],"greater":[59],"50%.":[61]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}