{"id":"https://openalex.org/W2165570975","doi":"https://doi.org/10.1109/rttas.2002.1137389","title":"Analyzing fixed-priority global multiprocessor scheduling","display_name":"Analyzing fixed-priority global multiprocessor scheduling","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2165570975","doi":"https://doi.org/10.1109/rttas.2002.1137389","mag":"2165570975"},"language":"en","primary_location":{"id":"doi:10.1109/rttas.2002.1137389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2002.1137389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101593386","display_name":"Lars Lundberg","orcid":"https://orcid.org/0000-0002-5031-8215"},"institutions":[{"id":"https://openalex.org/I52719799","display_name":"Blekinge Institute of Technology","ror":"https://ror.org/0093a8w51","country_code":"SE","type":"education","lineage":["https://openalex.org/I52719799"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"L. Lundberg","raw_affiliation_strings":["Department of Software Engineering and Computer Science, Blekinge Institute of Technology, Ronneby, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Software Engineering and Computer Science, Blekinge Institute of Technology, Ronneby, Sweden","institution_ids":["https://openalex.org/I52719799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101593386"],"corresponding_institution_ids":["https://openalex.org/I52719799"],"apc_list":null,"apc_paid":null,"fwci":1.8597,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.8580503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"153"},"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.9879000186920166,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9781000018119812,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.8387067317962646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7377133965492249},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7004947662353516},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6561710834503174},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5713130831718445},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47888320684432983},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4576306939125061},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4188677668571472},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34323251247406006},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.339900404214859},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.313301146030426},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.16202688217163086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16007307171821594},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14751583337783813},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.13859400153160095}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.8387067317962646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7377133965492249},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7004947662353516},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6561710834503174},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5713130831718445},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47888320684432983},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4576306939125061},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4188677668571472},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34323251247406006},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.339900404214859},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.313301146030426},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.16202688217163086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16007307171821594},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14751583337783813},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.13859400153160095},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rttas.2002.1137389","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2002.1137389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1524254874","https://openalex.org/W1555563977","https://openalex.org/W2054998117","https://openalex.org/W2064207294","https://openalex.org/W2109488193","https://openalex.org/W2135559191","https://openalex.org/W2262960161","https://openalex.org/W6633199838"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W1979183926","https://openalex.org/W2161267363","https://openalex.org/W2062808533","https://openalex.org/W1809394610","https://openalex.org/W2134658009","https://openalex.org/W1511880291","https://openalex.org/W2101300711","https://openalex.org/W2153689068","https://openalex.org/W2618418901"],"abstract_inverted_index":{"We":[0,129],"consider":[1],"a":[2,17,41,93],"multiprocessor":[3,77,124],"where":[4,38],"hard":[5],"real-time":[6],"tasks":[7,21,120],"are":[8,22,136],"scheduled":[9],"globally":[10],"on":[11],"in":[12,32],"processors.":[13],"Each":[14],"task":[15],"has":[16],"fixed":[18],"priority":[19,29,152],"and":[20],"executed":[23],"using":[24],"preemptive":[25],"scheduling.":[26],"The":[27,47,64],"state-of-the-art":[28,151],"assignment":[30,153],"scheme":[31],"such":[33],"cases":[34],"is":[35,40,49,79,126,143],"called":[36],"RM-US[US-LIMIT],":[37],"US-LIMIT":[39,53,68,97,134],"parameter":[42],"to":[43,50],"the":[44,52,76,106,123],"RM-US":[45],"algorithm.":[46],"challenge":[48],"find":[51],"that":[54,132,141],"can":[55,114],"guarantee":[56,71,116],"schedulability":[57,72,100],"for":[58,96,101,118,146],"as":[59,62,73,75],"high":[60],"utilization":[61,78,103,125],"possible.":[63],"previously":[65],"best":[66],"known":[67],"value":[69],"could":[70],"long":[74],"below":[80,127],"m/(3m-2),":[81],"i.e.":[82,138],"0.33333":[83],"when":[84,122],"m/spl":[85,110],"rarr//spl":[86,111],"infin/.":[87],"In":[88],"this":[89,150],"paper":[90],"we":[91,113,139],"define":[92],"new":[94],"equation":[95],"which":[98],"guarantees":[99],"higher":[102],"values":[104,135],"than":[105],"previous":[107],"result.":[108],"When":[109],"infin/":[112],"now":[115],"schedulability,":[117],"all":[119],"sets":[121],"0.37482.":[128],"also":[130],"show":[131,140],"our":[133],"optimal,":[137],"there":[142],"no":[144],"room":[145],"further":[147],"improvement":[148],"of":[149],"scheme.":[154]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}