{"id":"https://openalex.org/W1591946588","doi":"https://doi.org/10.1109/rtas.2015.7108444","title":"Unifying fixed- and dynamic-priority scheduling based on priority promotion and an improved ready queue management technique","display_name":"Unifying fixed- and dynamic-priority scheduling based on priority promotion and an improved ready queue management technique","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1591946588","doi":"https://doi.org/10.1109/rtas.2015.7108444","mag":"1591946588"},"language":"en","primary_location":{"id":"doi:10.1109/rtas.2015.7108444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2015.7108444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st IEEE Real-Time and Embedded Technology and Applications Symposium","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/A5057249018","display_name":"Risat Mahmud Pathan","orcid":"https://orcid.org/0000-0002-9902-7558"},"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":true,"raw_author_name":"Risat Mahmud Pathan","raw_affiliation_strings":["Chalmers University of Technology, Sweden","Chalmers University of Technology SWEDEN"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Chalmers University of Technology SWEDEN","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057249018"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":1.9791,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8546557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"209","last_page":"220"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9814000129699707,"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.9679999947547913,"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.7900639176368713},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.7248504757881165},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.7078024744987488},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.6969407796859741},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6615992784500122},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.6368324756622314},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.6134498119354248},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.5755800604820251},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5409845113754272},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.5271125435829163},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5055761337280273},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.46530917286872864},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.40537333488464355},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2833646535873413},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21078914403915405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11210101842880249},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09604531526565552}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7900639176368713},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.7248504757881165},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.7078024744987488},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.6969407796859741},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6615992784500122},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.6368324756622314},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.6134498119354248},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.5755800604820251},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5409845113754272},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.5271125435829163},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5055761337280273},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.46530917286872864},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.40537333488464355},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2833646535873413},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21078914403915405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11210101842880249},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09604531526565552}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/rtas.2015.7108444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2015.7108444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st IEEE Real-Time and Embedded Technology and Applications Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.lib.chalmers.se:211842","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/211842-unifying-fixed-and-dynamic-priority-scheduling-based-on-priority-promotion-and-an-improved-ready-que","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (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":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:211842","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/211842","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":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W194244820","https://openalex.org/W1702973254","https://openalex.org/W1967792055","https://openalex.org/W1968005108","https://openalex.org/W2018115912","https://openalex.org/W2021947636","https://openalex.org/W2034497274","https://openalex.org/W2042979415","https://openalex.org/W2056227251","https://openalex.org/W2064207294","https://openalex.org/W2109488193","https://openalex.org/W2110186189","https://openalex.org/W2111206806","https://openalex.org/W2114919461","https://openalex.org/W2117322725","https://openalex.org/W2125783653","https://openalex.org/W2127467256","https://openalex.org/W2129861363","https://openalex.org/W2140213052","https://openalex.org/W2145132630","https://openalex.org/W2147603290","https://openalex.org/W2156979918","https://openalex.org/W2163007708","https://openalex.org/W2165923099","https://openalex.org/W6607920450"],"related_works":["https://openalex.org/W2364408853","https://openalex.org/W2372058405","https://openalex.org/W1591583623","https://openalex.org/W2369535141","https://openalex.org/W2067749084","https://openalex.org/W2069990174","https://openalex.org/W2604560300","https://openalex.org/W2037055167","https://openalex.org/W2368419261","https://openalex.org/W2337893998"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,142,176],"new":[4],"preemptive":[5],"scheduling":[6,15,34,96],"algorithm,":[7],"called":[8,61],"Fixed-Priority":[9],"with":[10],"Priority":[11,63],"Promotion":[12],"(FPP),":[13],"for":[14,76,251],"sporadic":[16],"tasks":[17,26,40,194,203],"on":[18,231],"uni-":[19],"and":[20,73,110,114,126,146,151,155,212,233],"multiprocessor":[21],"platform.":[22],"In":[23],"FPP":[24,95,140],"scheduling,":[25,141,185],"are":[27,89,160,189,204],"executed":[28,213],"similar":[29],"to":[30,52,68,101,113,149,154,166,170,192,198,243],"traditional":[31,120,183,216],"fixed-priority":[32],"(FP)":[33],"but":[35],"the":[36,53,70,116,157,200,222,225],"priority":[37,171,210],"of":[38,56,119,132,224,238,245],"some":[39],"may":[41],"be":[42],"promoted":[43,74],"at":[44,64],"fixed":[45,206],"time":[46,55],"interval":[47],"(called,":[48],"promotion":[49,71,172,187,211],"point)":[50],"relative":[51],"release":[54],"each":[57,77],"job.":[58],"A":[59],"policy":[60],"Increase":[62],"Deadline":[65],"Difference":[66],"(IPDD)":[67],"compute":[69],"points":[72,188],"priorities":[75,88,207],"task":[78,177,239],"is":[79,82,106,123,173,179],"proposed.":[80,161],"It":[81,105],"shown":[83],"that":[84,108,131,195,244],"when":[85],"all":[86],"tasks'":[87],"governed":[90],"under":[91],"IPDD":[92],"policy,":[93],"then":[94,186],"essentially":[97],"prioritizes":[98],"jobs":[99,112,153],"according":[100],"Earliest-Deadline-First":[102],"(EDF)":[103],"priority.":[104],"known":[107],"inserting":[109],"removing":[111],"from":[115,156],"ready":[117,158],"queue":[118,159],"EDF":[121],"scheduler":[122],"more":[124],"complex":[125],"has":[127],"higher":[128],"overhead":[129,168,230],"than":[130],"FP":[133,184,217],"scheduler.":[134],"To":[135],"avoid":[136],"such":[137],"problem":[138],"in":[139,228,234,241],"simple":[143],"data":[144],"structure":[145],"efficient":[147],"operations":[148],"insert":[150],"remove":[152],"Finally,":[162],"an":[163],"effective":[164],"scheme":[165,227],"reduce":[167],"due":[169],"proposed:":[174],"if":[175],"set":[178],"not":[180],"schedulable":[181],"using":[182,246],"assigned":[190,205],"only":[191],"those":[193],"need":[196],"them":[197],"meet":[199],"deadlines;":[201],"otherwise,":[202],"without":[208],"any":[209],"same":[214],"as":[215],"scheduling.":[218],"Empirical":[219],"investigation":[220],"shows":[221],"effectiveness":[223],"proposed":[226],"reducing":[229],"uniprocessor":[232],"accepting":[235],"larger":[236],"number":[237],"sets":[240],"comparison":[242],"state-of-the-art":[247],"global":[248],"schedulability":[249],"tests":[250],"multiprocessors.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}