{"id":"https://openalex.org/W1975847804","doi":"https://doi.org/10.4304/jsw.6.11.2308-2320","title":"Two-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems","display_name":"Two-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W1975847804","doi":"https://doi.org/10.4304/jsw.6.11.2308-2320","mag":"1975847804"},"language":"en","primary_location":{"id":"doi:10.4304/jsw.6.11.2308-2320","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.6.11.2308-2320","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","raw_type":"journal-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/A5043625171","display_name":"Muhammad Khurram Bhatti","orcid":"https://orcid.org/0000-0002-1974-8268"},"institutions":[{"id":"https://openalex.org/I4210095736","display_name":"Laboratoire d'\u00c9lectronique, Antennes et T\u00e9l\u00e9communications","ror":"https://ror.org/00ah32k04","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I201841394","https://openalex.org/I4210095736","https://openalex.org/I4210095849"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Muhammad Khurram Bhatti","raw_affiliation_strings":["LEAT - Laboratoire d'Electronique, Antennes et T\u00e9l\u00e9communications (B\u00e2timent Forum - Campus Sophi@Tech. - BP 145 930 Route des Colles 06903 Sophia Antipolis cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LEAT - Laboratoire d'Electronique, Antennes et T\u00e9l\u00e9communications (B\u00e2timent Forum - Campus Sophi@Tech. - BP 145 930 Route des Colles 06903 Sophia Antipolis cedex - France)","institution_ids":["https://openalex.org/I4210095736"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016522541","display_name":"C\u00e9cile Belleudy","orcid":"https://orcid.org/0009-0004-7483-163X"},"institutions":[{"id":"https://openalex.org/I4210095736","display_name":"Laboratoire d'\u00c9lectronique, Antennes et T\u00e9l\u00e9communications","ror":"https://ror.org/00ah32k04","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I201841394","https://openalex.org/I4210095736","https://openalex.org/I4210095849"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"C\u00e9cile Belleudy","raw_affiliation_strings":["LEAT - Laboratoire d'Electronique, Antennes et T\u00e9l\u00e9communications (B\u00e2timent Forum - Campus Sophi@Tech. - BP 145 930 Route des Colles 06903 Sophia Antipolis cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LEAT - Laboratoire d'Electronique, Antennes et T\u00e9l\u00e9communications (B\u00e2timent Forum - Campus Sophi@Tech. - BP 145 930 Route des Colles 06903 Sophia Antipolis cedex - France)","institution_ids":["https://openalex.org/I4210095736"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059316155","display_name":"Michel Auguin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095736","display_name":"Laboratoire d'\u00c9lectronique, Antennes et T\u00e9l\u00e9communications","ror":"https://ror.org/00ah32k04","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I201841394","https://openalex.org/I4210095736","https://openalex.org/I4210095849"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michel Auguin","raw_affiliation_strings":["LEAT - Laboratoire d'Electronique, Antennes et T\u00e9l\u00e9communications (B\u00e2timent Forum - Campus Sophi@Tech. - BP 145 930 Route des Colles 06903 Sophia Antipolis cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LEAT - Laboratoire d'Electronique, Antennes et T\u00e9l\u00e9communications (B\u00e2timent Forum - Campus Sophi@Tech. - BP 145 930 Route des Colles 06903 Sophia Antipolis cedex - France)","institution_ids":["https://openalex.org/I4210095736"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5153,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.64837997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"6","issue":"11","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9876000285148621,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9847000241279602,"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/computer-science","display_name":"Computer science","score":0.900181770324707},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7633048295974731},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7523411512374878},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6530508399009705},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6519759297370911},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.45179107785224915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4509163498878479},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.43678462505340576},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.43456512689590454},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.43046483397483826},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4166865348815918},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.40681320428848267},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11436709761619568},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.07177770137786865},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06679743528366089}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.900181770324707},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7633048295974731},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7523411512374878},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6530508399009705},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6519759297370911},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.45179107785224915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4509163498878479},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.43678462505340576},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.43456512689590454},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.43046483397483826},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4166865348815918},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.40681320428848267},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11436709761619568},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.07177770137786865},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06679743528366089},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jsw.6.11.2308-2320","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.6.11.2308-2320","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7099999785423279,"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/W1967109142","https://openalex.org/W1982258605","https://openalex.org/W2012059473","https://openalex.org/W2056830486","https://openalex.org/W2066995704","https://openalex.org/W2112837133","https://openalex.org/W2123705102","https://openalex.org/W2127467256","https://openalex.org/W2135559191","https://openalex.org/W2149058853","https://openalex.org/W2156978792","https://openalex.org/W2167731739"],"related_works":["https://openalex.org/W2245286458","https://openalex.org/W2545511463","https://openalex.org/W2172075652","https://openalex.org/W2106332846","https://openalex.org/W2956094179","https://openalex.org/W2390610159","https://openalex.org/W2050732033","https://openalex.org/W2541348386","https://openalex.org/W2167842822","https://openalex.org/W2587092711"],"abstract_inverted_index":{"The":[0],"Earliest":[1],"Deadline":[2],"First":[3],"(EDF)":[4],"scheduling":[5,17,37,60],"algorithm":[6,38,54,68],"has":[7],"the":[8,56,107,128,163,170],"least":[9],"runtime":[10],"complexity":[11],"among":[12],"joblevel":[13],"fixed-priority":[14],"algorithms":[15],"for":[16,39],"tasks":[18],"on":[19,103],"multiprocessor":[20,28,40,59],"architectures.":[21],"However,":[22],"EDF":[23],"suffers":[24],"from":[25,81],"suboptimality":[26],"in":[27,70,77,106,118,162,169],"systems.":[29],"This":[30,67],"paper":[31],"proposes":[32],"a":[33,62,88,97],"new":[34],"restricted":[35],"migration-based":[36],"real-time":[41],"systems,":[42],"called":[43],"Two-level":[44],"Hierarchical":[45],"Scheduling":[46],"Algorithm":[47],"(2L-HiSA),":[48],"to":[49,87,134,148],"address":[50],"this":[51],"sub-optimality.":[52],"2L-HiSA":[53,176],"divides":[55],"problem":[57],"of":[58,65,160,165,172],"into":[61],"two-level":[63],"hierarchy":[64],"schedulers.":[66],"works":[69],"two":[71],"phases:":[72],"i-":[73],"A":[74,115],"taskpartitioning":[75],"phase":[76,117],"which,":[78,119],"each":[79],"task":[80,83,98,173],"application":[82],"set":[84],"is":[85,139],"assigned":[86],"specific":[89],"processor":[90,105,138],"by":[91],"following":[92],"simple":[93],"bin-packing":[94],"approach.":[95],"If":[96],"can":[99],"not":[100],"be":[101],"partitioned":[102],"any":[104],"platform,":[108],"it":[109],"qualifies":[110],"as":[111],"migrating":[112],"task.":[113],"ii-":[114],"processor-grouping":[116],"processors":[120],"are":[121],"clustered":[122],"together":[123],"such":[124],"that,":[125],"per":[126],"cluster,":[127],"unused":[129],"fragmented":[130],"computation":[131],"power":[132],"equivalent":[133],"at":[135],"most":[136],"one":[137],"available.":[140],"We":[141],"provide":[142],"schedulability":[143],"analysis":[144],"and":[145,167,177],"experimental":[146],"evaluation":[147],"support":[149],"our":[150,153],"proposition.":[151],"Moreover,":[152],"simulation":[154],"results":[155],"show":[156],"an":[157],"average":[158],"difference":[159],"18-folds":[161],"number":[164,171],"preemptions":[166],"10-folds":[168],"migrations":[174],"under":[175],"PD2":[178],"algorithm.":[179]},"counts_by_year":[{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}