{"id":"https://openalex.org/W2036645810","doi":"https://doi.org/10.1145/2656045.2656059","title":"Extending typical worst-case analysis using response-time dependencies to bound deadline misses","display_name":"Extending typical worst-case analysis using response-time dependencies to bound deadline misses","publication_year":2014,"publication_date":"2014-10-12","ids":{"openalex":"https://openalex.org/W2036645810","doi":"https://doi.org/10.1145/2656045.2656059","mag":"2036645810"},"language":"en","primary_location":{"id":"doi:10.1145/2656045.2656059","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2656045.2656059","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Embedded Software","raw_type":"proceedings-article"},"type":"conference-paper","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/A5039410874","display_name":"Zain A. H. Hammadeh","orcid":"https://orcid.org/0000-0001-7539-2393"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Zain A. H. Hammadeh","raw_affiliation_strings":["Institute of Computer and Network Engineering (IDA), TU Braunschweig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer and Network Engineering (IDA), TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103192649","display_name":"Sophie Quinton","orcid":"https://orcid.org/0000-0003-1838-2345"},"institutions":[{"id":"https://openalex.org/I4210101348","display_name":"Centre Inria de l'Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/00n8d6z93","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sophie Quinton","raw_affiliation_strings":["Inria Grenoble - Rh\u00f4ne-Alpes, Montbonnot, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria Grenoble - Rh\u00f4ne-Alpes, Montbonnot, France","institution_ids":["https://openalex.org/I4210101348"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075507551","display_name":"Rolf Ernst","orcid":"https://orcid.org/0000-0003-2414-9566"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Ernst","raw_affiliation_strings":["Institute of Computer and Network Engineering (IDA), TU Braunschweig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer and Network Engineering (IDA), TU Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7542836666107178},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6608171463012695},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6000860333442688},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5863375663757324},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5734078288078308},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4653160572052002},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4208757281303406},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.41024717688560486},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38949325680732727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3668998181819916},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2966749668121338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16292491555213928}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7542836666107178},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6608171463012695},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6000860333442688},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5863375663757324},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5734078288078308},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4653160572052002},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4208757281303406},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.41024717688560486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38949325680732727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3668998181819916},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2966749668121338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16292491555213928},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2656045.2656059","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2656045.2656059","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Embedded Software","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01097621v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01097621","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"14th International Conference on Embedded Software 2014 (EMSOFT), Oct 2014, New Delhi, India. &#x27E8;10.1145/2656045.2656059&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1984148114","https://openalex.org/W1984851297","https://openalex.org/W1985520640","https://openalex.org/W1997998060","https://openalex.org/W2003192087","https://openalex.org/W2012392630","https://openalex.org/W2015717967","https://openalex.org/W2080059420","https://openalex.org/W2100806128","https://openalex.org/W2119167559","https://openalex.org/W2133620399","https://openalex.org/W2136711971","https://openalex.org/W2145132630"],"related_works":["https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2082154838","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W4285278887","https://openalex.org/W2995925505","https://openalex.org/W2365237642","https://openalex.org/W3116484972"],"abstract_inverted_index":{"Weakly-hard":[0],"time":[1],"constraints":[2,29],"have":[3],"been":[4,24],"proposed":[5],"for":[6,46,61,88,96],"applications":[7],"where":[8],"occasional":[9],"deadline":[10,59],"misses":[11,60],"are":[12],"permitted.":[13],"Recently,":[14],"a":[15,62,85],"new":[16],"approach":[17,45,66,112],"called":[18],"Typical":[19],"Worst-Case":[20],"Analysis":[21],"(TWCA)":[22],"has":[23],"introduced":[25],"which":[26,73],"exploits":[27],"similar":[28],"to":[30,53],"bound":[31],"response":[32],"times":[33],"of":[34,58,110],"systems":[35],"with":[36],"sporadic":[37],"overload.":[38],"In":[39],"this":[40],"paper,":[41],"we":[42],"extend":[43],"that":[44,92],"static":[47],"priority":[48,77],"preemptive":[49],"and":[50,113],"non-preemptive":[51],"scheduling":[52],"determine":[54],"the":[55,89,94,111],"maximum":[56],"number":[57],"given":[63],"deadline.":[64],"The":[65,103],"is":[67,106],"based":[68],"on":[69],"an":[70,97],"optimization":[71],"problem":[72],"trades":[74],"off":[75],"higher":[76],"interference":[78],"versus":[79],"miss":[80],"count.":[81],"We":[82],"formally":[83],"derive":[84],"lattice":[86],"structure":[87],"possible":[90],"combinations":[91],"lays":[93],"ground":[95],"integer":[98],"linear":[99],"programming":[100],"(ILP)":[101],"formulation.":[102],"ILP":[104],"solution":[105],"evaluated":[107],"showing":[108],"effectiveness":[109],"far":[114],"better":[115],"results":[116],"than":[117],"previous":[118],"TWCA.":[119]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
