{"id":"https://openalex.org/W2135965809","doi":"https://doi.org/10.1109/emrts.2003.1212744","title":"Multiprocessor fixed-priority scheduling with restricted interprocessor migrations","display_name":"Multiprocessor fixed-priority scheduling with restricted interprocessor migrations","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W2135965809","doi":"https://doi.org/10.1109/emrts.2003.1212744","mag":"2135965809"},"language":"en","primary_location":{"id":"doi:10.1109/emrts.2003.1212744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emrts.2003.1212744","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/A5038442224","display_name":"Sanjoy Baruah","orcid":"https://orcid.org/0000-0002-4541-3445"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Baruah","raw_affiliation_strings":["The University of North Carolina, Department of Computer Science, CB 3175 Chapel Hill, NC 27599-3175, USA (Corresponding author. E-mail: baruah@cs.unc.edu)"],"affiliations":[{"raw_affiliation_string":"The University of North Carolina, Department of Computer Science, CB 3175 Chapel Hill, NC 27599-3175, USA (Corresponding author. E-mail: baruah@cs.unc.edu)","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022875889","display_name":"John Carpenter","orcid":"https://orcid.org/0000-0003-2821-2569"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Carpenter","raw_affiliation_strings":["The University of North Carolina, Department of Computer Science, CB 3175 Chapel Hill, NC 27599-3175, USA"],"affiliations":[{"raw_affiliation_string":"The University of North Carolina, Department of Computer Science, CB 3175 Chapel Hill, NC 27599-3175, USA","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038442224"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":2.3816,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.88126069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"1","issue":"2","first_page":"195","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9990000128746033,"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.9990000128746033,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9908000230789185,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9836000204086304,"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/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.8334000706672668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7828850746154785},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.687979519367218},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6703482270240784},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6464651823043823},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5735759735107422},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5300132036209106},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5280540585517883},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.520943284034729},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5171467661857605},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.47937944531440735},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4462425410747528},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4282754361629486},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28269195556640625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1345197856426239},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11044037342071533},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.05884543061256409}],"concepts":[{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.8334000706672668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7828850746154785},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.687979519367218},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6703482270240784},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6464651823043823},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5735759735107422},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5300132036209106},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5280540585517883},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.520943284034729},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5171467661857605},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.47937944531440735},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4462425410747528},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4282754361629486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28269195556640625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1345197856426239},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11044037342071533},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.05884543061256409},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/emrts.2003.1212744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emrts.2003.1212744","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":"mag:2173215150","is_oa":false,"landing_page_url":"https://content.iospress.com/articles/journal-of-embedded-computing/jec00013","pdf_url":null,"source":{"id":"https://openalex.org/S69036484","display_name":"Journal of Embedded Computing","issn_l":"1740-4460","issn":["1740-4460","1875-9025"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of Embedded Computing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.800000011920929,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W194244820","https://openalex.org/W1485093219","https://openalex.org/W1602274988","https://openalex.org/W1805570991","https://openalex.org/W2043862089","https://openalex.org/W2048905935","https://openalex.org/W2054998117","https://openalex.org/W2056830486","https://openalex.org/W2064207294","https://openalex.org/W2079333823","https://openalex.org/W2109488193","https://openalex.org/W2158002367"],"related_works":["https://openalex.org/W2545511463","https://openalex.org/W2245286458","https://openalex.org/W2106332846","https://openalex.org/W2172075652","https://openalex.org/W2956094179","https://openalex.org/W2167842822","https://openalex.org/W2612088627","https://openalex.org/W3110516039","https://openalex.org/W2541348386","https://openalex.org/W2587092711"],"abstract_inverted_index":{"The":[0],"priority-driven":[1],"scheduling":[2,59,82,86],"of":[3,80,85],"periodic":[4],"and":[5,31,67,84],"sporadic":[6],"task":[7],"systems":[8],"upon":[9,37],"identical":[10],"multiprocessor":[11],"platforms":[12],"is":[13,43,51,61],"considered,":[14],"under":[15,48],"the":[16,46,55,76,90],"restrictions":[17,50],"that":[18,45,63,68,88],"(i)":[19],"each":[20,33],"job":[21,34],"may":[22,35],"be":[23],"assigned":[24],"exactly":[25],"one":[26],"priority":[27],"throughout":[28],"its":[29],"lifetime,":[30],"(ii)":[32],"execute":[36],"only":[38],"a":[39,70],"single":[40],"processor.":[41],"It":[42],"shown":[44],"feasibility-analysis":[47],"these":[49,65],"intractable":[52],"(NP-hard":[53],"in":[54],"strong":[56],"sense).":[57],"A":[58],"algorithm":[60],"presented":[62],"satisfies":[64],"restrictions,":[66],"has":[69],"worst-case":[71,77],"utilization":[72,78],"bound":[73],"comparable":[74],"to":[75],"bounds":[79],"partitioned":[81],"algorithms,":[83],"algorithms":[87],"retain":[89],"priority-assignment":[91],"restriction":[92],"but":[93],"allow":[94],"arbitrary":[95],"interprocessor":[96],"migration.":[97]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}