{"id":"https://openalex.org/W2058308219","doi":"https://doi.org/10.1109/etfa.2011.6059008","title":"Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling","display_name":"Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2058308219","doi":"https://doi.org/10.1109/etfa.2011.6059008","mag":"2058308219"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2011.6059008","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2011.6059008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ETFA2011","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/A5016807947","display_name":"Michael Short","orcid":"https://orcid.org/0000-0001-6290-4396"},"institutions":[{"id":"https://openalex.org/I874055015","display_name":"Teesside University","ror":"https://ror.org/03z28gk75","country_code":"GB","type":"education","lineage":["https://openalex.org/I874055015"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Michael Short","raw_affiliation_strings":["Electronics & Control Group, Teesside University, Middlesborough, UK"],"affiliations":[{"raw_affiliation_string":"Electronics & Control Group, Teesside University, Middlesborough, UK","institution_ids":["https://openalex.org/I874055015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016807947"],"corresponding_institution_ids":["https://openalex.org/I874055015"],"apc_list":null,"apc_paid":null,"fwci":1.0271,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.77969066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9988999962806702,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9986000061035156,"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/uniprocessor-system","display_name":"Uniprocessor system","score":0.9109095931053162},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.8550354242324829},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.808869481086731},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.622682511806488},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5828618407249451},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47852978110313416},{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"Worst-case execution time","score":0.4706054627895355},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.45997050404548645},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45491504669189453},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41419824957847595},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.38295871019363403},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.37321656942367554},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.29887694120407104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21627554297447205},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11980339884757996},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.11676007509231567},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11317828297615051}],"concepts":[{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.9109095931053162},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8550354242324829},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.808869481086731},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.622682511806488},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5828618407249451},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47852978110313416},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.4706054627895355},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.45997050404548645},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45491504669189453},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41419824957847595},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.38295871019363403},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.37321656942367554},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.29887694120407104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21627554297447205},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11980339884757996},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.11676007509231567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11317828297615051},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/etfa.2011.6059008","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2011.6059008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ETFA2011","raw_type":"proceedings-article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire_cris_publications/53d088b3-d205-45f7-8fc7-e0c6ddaa08c3","is_oa":false,"landing_page_url":"https://research.tees.ac.uk/en/publications/53d088b3-d205-45f7-8fc7-e0c6ddaa08c3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Short, M 2011, 'Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling', Paper presented at 16th IEEE International Conference on Emerging Technologies and Factory Automation, Toulous, France, 6/09/11 - 9/09/11.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:publications/53d088b3-d205-45f7-8fc7-e0c6ddaa08c3","is_oa":false,"landing_page_url":"http://www.etfa-2011.org/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Short, M 2011, 'Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling', Paper presented at 16th IEEE International Conference on Emerging Technologies and Factory Automation, Toulous, France, 6/09/11 - 9/09/11.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tees.openrepository.com:10149/142012","is_oa":false,"landing_page_url":"http://hdl.handle.net/10149/142012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Meetings and Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"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":27,"referenced_works":["https://openalex.org/W1519695112","https://openalex.org/W1576380096","https://openalex.org/W1595529246","https://openalex.org/W1825357451","https://openalex.org/W2002514423","https://openalex.org/W2006023091","https://openalex.org/W2049602716","https://openalex.org/W2105995702","https://openalex.org/W2109488193","https://openalex.org/W2110186189","https://openalex.org/W2112696369","https://openalex.org/W2120097243","https://openalex.org/W2123644071","https://openalex.org/W2129757807","https://openalex.org/W2130181800","https://openalex.org/W2135522804","https://openalex.org/W2137784941","https://openalex.org/W2141440050","https://openalex.org/W2141849939","https://openalex.org/W2171372660","https://openalex.org/W2262960161","https://openalex.org/W2484338577","https://openalex.org/W4239322463","https://openalex.org/W4246142437","https://openalex.org/W4254551272","https://openalex.org/W6635693137","https://openalex.org/W6650852052"],"related_works":["https://openalex.org/W2569893484","https://openalex.org/W2097106574","https://openalex.org/W2157996160","https://openalex.org/W2314658126","https://openalex.org/W2143771622","https://openalex.org/W2017977262","https://openalex.org/W2171342002","https://openalex.org/W2110186189","https://openalex.org/W2152732192","https://openalex.org/W2015013368"],"abstract_inverted_index":{"Limited-preemption":[0],"forms":[1],"of":[2,23,36,54,106,119],"uniprocessor":[3],"scheduling":[4,22],"provide":[5],"a":[6,37],"practical":[7],"trade-off":[8],"between":[9],"flexibility":[10],"and":[11,46,57,64,103],"system":[12],"overheads":[13],"in":[14,40,74],"embedded":[15],"kernels.":[16],"This":[17],"paper":[18],"considers":[19],"the":[20,28,34,76,87,104,111],"limited-preemption":[21],"implicit":[24],"deadline":[25,38],"tasks":[26],"using":[27],"EDF":[29],"algorithm.":[30],"Upper":[31],"bounds":[32],"for":[33,72,110],"occurrence":[35],"miss":[39],"these":[41],"task":[42],"sets":[43],"are":[44,90],"derived,":[45],"employed":[47],"to":[48,81,92,100],"create":[49],"several":[50,117],"sufficient":[51,88],"schedulability":[52],"tests":[53,89],"increasing":[55,96],"complexity":[56,69],"tightness.":[58],"Exact":[59],"analysis":[60],"is":[61,70,79,114],"then":[62],"considered,":[63],"an":[65],"algorithm":[66],"with":[67],"polynomial-time":[68],"developed":[71],"situations":[73],"which":[75],"CPU":[77],"utilization":[78],"bounded":[80],"be":[82],"less":[83],"than":[84],"unity.":[85],"Experimentally,":[86],"shown":[91],"have":[93],"acceptance":[94],"ratios":[95],"from":[97],"\u224860%":[98],"up":[99],"\u2248":[101],"99%,":[102],"number":[105],"evaluated":[107],"deadlines":[108],"required":[109],"exact":[112],"test":[113],"reduced":[115],"by":[116],"orders":[118],"magnitude":[120],"over":[121],"previously":[122],"known":[123],"techniques.":[124]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}