{"id":"https://openalex.org/W2046015854","doi":"https://doi.org/10.1109/rtas.2014.6925991","title":"Real-time scheduling under fault bursts with multiple recovery strategy","display_name":"Real-time scheduling under fault bursts with multiple recovery strategy","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2046015854","doi":"https://doi.org/10.1109/rtas.2014.6925991","mag":"2046015854"},"language":"en","primary_location":{"id":"doi:10.1109/rtas.2014.6925991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2014.6925991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)","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/A5016222651","display_name":"Mohammad A. Haque","orcid":"https://orcid.org/0000-0001-5613-2190"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammad A Haque","raw_affiliation_strings":["Department of Computer Science, George Mason University, Fairfax, Virginia","Department of Computer Science, George Mason University, Fairfax, Virginia 22030 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, George Mason University, Fairfax, Virginia","institution_ids":["https://openalex.org/I162714631"]},{"raw_affiliation_string":"Department of Computer Science, George Mason University, Fairfax, Virginia 22030 USA","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057010979","display_name":"Hakan Ayd\u0131n","orcid":"https://orcid.org/0000-0002-0122-8512"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hakan Aydin","raw_affiliation_strings":["Department of Computer Science, George Mason University, Fairfax, Virginia","Department of Computer Science, George Mason University, Fairfax, Virginia 22030 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, George Mason University, Fairfax, Virginia","institution_ids":["https://openalex.org/I162714631"]},{"raw_affiliation_string":"Department of Computer Science, George Mason University, Fairfax, Virginia 22030 USA","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012210223","display_name":"Dakai Zhu","orcid":"https://orcid.org/0000-0002-1938-9947"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dakai Zhu","raw_affiliation_strings":["Department of Computer Science, University of Texas at San Antonio, San Antonio, Texas","Dept. of Computer Science, University of Texas at San Antonio, 78249, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at San Antonio, San Antonio, Texas","institution_ids":["https://openalex.org/I45438204"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Texas at San Antonio, 78249, USA","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016222651"],"corresponding_institution_ids":["https://openalex.org/I162714631"],"apc_list":null,"apc_paid":null,"fwci":2.8354,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90571989,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"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.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.9869999885559082,"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.9470000267028809,"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.6764781475067139},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6693227887153625},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6484315395355225},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5168843269348145},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4658874571323395},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44163915514945984},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4372180104255676},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43669945001602173},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.42632463574409485},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3791790306568146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35250890254974365},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.20196658372879028},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1564267873764038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13307464122772217},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11984318494796753}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6764781475067139},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6693227887153625},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6484315395355225},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5168843269348145},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4658874571323395},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44163915514945984},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4372180104255676},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43669945001602173},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.42632463574409485},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3791790306568146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35250890254974365},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.20196658372879028},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1564267873764038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13307464122772217},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11984318494796753},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/rtas.2014.6925991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2014.6925991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.636.4293","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.gmu.edu/~aydin/rtas14.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.41999998688697815}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W128180137","https://openalex.org/W141121412","https://openalex.org/W1500893261","https://openalex.org/W1599676434","https://openalex.org/W1821730155","https://openalex.org/W1853358807","https://openalex.org/W1952110674","https://openalex.org/W1979820289","https://openalex.org/W1980363975","https://openalex.org/W1992045317","https://openalex.org/W2037417177","https://openalex.org/W2068171717","https://openalex.org/W2097274529","https://openalex.org/W2101587002","https://openalex.org/W2109488193","https://openalex.org/W2114634893","https://openalex.org/W2124870954","https://openalex.org/W2127467256","https://openalex.org/W2129745701","https://openalex.org/W2141440050","https://openalex.org/W2144038902","https://openalex.org/W2148952606","https://openalex.org/W2154098538","https://openalex.org/W2157307034","https://openalex.org/W2262960161","https://openalex.org/W3004935110","https://openalex.org/W4251708180"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W4388311650","https://openalex.org/W1974056099","https://openalex.org/W2107725657","https://openalex.org/W4245343541","https://openalex.org/W1862835629","https://openalex.org/W2099111379","https://openalex.org/W2136799148","https://openalex.org/W2897533804","https://openalex.org/W2890506991"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,169],"consider":[4],"the":[5,48,76,80,92,116,119,123,136,160,177,186,207,218,237,243],"feasibility":[6,49,105],"problem":[7,73],"of":[8,11,50,79,121,217],"a":[9,19,28,51,59,85,89,139,144,149,233],"set":[10],"real-time":[12,52],"jobs":[13,34],"which":[14,32,54,122],"may":[15,35,41,55,63,95],"be":[16,42,56],"subject":[17,57],"to":[18,58,115,143,158],"fault":[20,25,60,81,93,124,145],"burst":[21,26,61,82,94,146],"during":[22,31],"execution.":[23],"A":[24],"represents":[27],"time":[29,68],"interval":[30],"multiple":[33,39,109],"incur":[36],"faults;":[37],"hence":[38],"recoveries":[40],"needed.":[43],"We":[44,103,133,174,211],"show":[45,175,229],"that":[46,62,138,155,176,230,241],"determining":[47],"system,":[53,91],"last":[64],"at":[65,97,118],"most":[66],"\u0394":[67,194],"units,":[69],"is":[70,83,125,156,206,251],"an":[71,214,249],"NP-Hard":[72],"even":[74],"when":[75,181],"exact":[77],"position":[78],"known":[84],"priori.":[86],"However,":[87],"in":[88,113],"practical":[90],"occur":[96],"any":[98,164],"arbitrary":[99],"and":[100,147,228],"unpredictable":[101],"time.":[102],"develop":[104],"analysis":[106],"by":[107],"assuming":[108],"recovery":[110,151,244],"strategy":[111],"where,":[112],"addition":[114],"job":[117],"end":[120],"detected,":[126],"all":[127],"preempted":[128],"tasks":[129,245],"are":[130],"also":[131,212],"re-executed.":[132],"formally":[134],"characterize":[135],"overhead":[137,162],"scheduler":[140],"incurs":[141],"due":[142],"present":[148,213],"generic":[150],"strategy,":[152],"called":[153],"\u0394-idling,":[154,184],"shown":[157],"minimize":[159],"worst-case":[161],"for":[163],"priority-driven":[165],"scheduling":[166],"algorithm.":[167],"Next,":[168],"analyze":[170],"periodic":[171],"task":[172,209,226],"systems.":[173],"preemptive":[178],"EDF":[179,219,239],"policy,":[180],"coupled":[182],"with":[183,221],"provides":[185],"highest":[187],"possible":[188],"utilization":[189],"bound":[190],"\u00bd":[191],"(1":[192],"-":[193],"over":[195,223,236],"P":[196,202],"<sub":[197,203],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[198,204],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">min</sub>":[199,205],"),":[200],"where":[201],"smallest":[208],"period.":[210],"empirical":[215],"evaluation":[216],"policy":[220,240],"\u0394-idling":[222],"synthetically":[224],"generated":[225],"sets,":[227],"it":[231],"offers":[232],"clear":[234],"improvement":[235],"naive":[238],"triggers":[242],"as":[246,248],"soon":[247],"error":[250],"detected.":[252]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}