{"id":"https://openalex.org/W2945977556","doi":"https://doi.org/10.23919/date.2019.8714908","title":"Efficient Computation of Deadline-Miss Probability and Potential Pitfalls","display_name":"Efficient Computation of Deadline-Miss Probability and Potential Pitfalls","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2945977556","doi":"https://doi.org/10.23919/date.2019.8714908","mag":"2945977556"},"language":"en","primary_location":{"id":"doi:10.23919/date.2019.8714908","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2019.8714908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)","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/A5040715141","display_name":"Kuan-Hsun Chen","orcid":"https://orcid.org/0000-0002-7110-921X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Kuan-Hsun Chen","raw_affiliation_strings":["Department of Informatics, TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081007355","display_name":"Niklas Ueter","orcid":"https://orcid.org/0000-0002-6722-4805"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Niklas Ueter","raw_affiliation_strings":["Department of Informatics, TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004024181","display_name":"Georg von der Br\u00fcggen","orcid":"https://orcid.org/0000-0002-8137-3612"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georg von der Bruggen","raw_affiliation_strings":["Department of Informatics, TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000417436","display_name":"Jian-Jia Chen","orcid":"https://orcid.org/0000-0001-8114-9760"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jian-Jia Chen","raw_affiliation_strings":["Department of Informatics, TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5040715141"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":2.1669,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87072789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"896","last_page":"901"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9940999746322632,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9923999905586243,"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/chernoff-bound","display_name":"Chernoff bound","score":0.853748083114624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7241935729980469},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6694572567939758},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.6340964436531067},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5424864888191223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.518608570098877},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5124688744544983},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4836314916610718},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.44290661811828613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36814412474632263},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.320864737033844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18485987186431885},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11321741342544556}],"concepts":[{"id":"https://openalex.org/C14539891","wikidata":"https://www.wikidata.org/wiki/Q1070305","display_name":"Chernoff bound","level":2,"score":0.853748083114624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7241935729980469},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6694572567939758},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.6340964436531067},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5424864888191223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.518608570098877},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5124688744544983},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4836314916610718},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.44290661811828613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36814412474632263},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.320864737033844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18485987186431885},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11321741342544556},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/date.2019.8714908","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2019.8714908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1621653743","https://openalex.org/W1804879348","https://openalex.org/W1995552962","https://openalex.org/W2121738258","https://openalex.org/W2141440050","https://openalex.org/W2145856894","https://openalex.org/W2532760205","https://openalex.org/W2568888431","https://openalex.org/W2612429302","https://openalex.org/W2741413319","https://openalex.org/W2810473819","https://openalex.org/W2899598218","https://openalex.org/W2899702797","https://openalex.org/W2910692850","https://openalex.org/W4250589301","https://openalex.org/W6755573740"],"related_works":["https://openalex.org/W2062791376","https://openalex.org/W2494523064","https://openalex.org/W2943623134","https://openalex.org/W4297785020","https://openalex.org/W2950134957","https://openalex.org/W2476651439","https://openalex.org/W2158343516","https://openalex.org/W2407082569","https://openalex.org/W2242259016","https://openalex.org/W2149931498"],"abstract_inverted_index":{"In":[0,69],"soft":[1],"real-time":[2],"systems,":[3,25,164],"applications":[4],"can":[5,82,121],"tolerate":[6],"rare":[7],"deadline":[8],"misses.":[9],"Therefore,":[10],"probabilistic":[11],"arguments":[12],"and":[13],"analyses":[14,20,33],"are":[15],"applicable":[16],"in":[17,28,53],"the":[18,48,59,62,66,76,97,101,104,109],"timing":[19],"for":[21,161],"this":[22,70,147],"class":[23],"of":[24,103,137],"as":[26],"demonstrated":[27],"many":[29],"existing":[30],"researches.":[31],"Convolution-based":[32],"allow":[34],"to":[35,157,172],"derive":[36],"tight":[37],"deadline-miss":[38,77],"probabilities,":[39],"but":[40],"suffer":[41],"from":[42],"a":[43,54,113,117,133,138,142],"high":[44],"time":[45],"complexity.":[46],"Among":[47],"analytical":[49],"approaches,":[50,61],"which":[51],"result":[52],"significantly":[55],"faster":[56],"runtime":[57,102],"than":[58],"convolution-based":[60],"Chernoff":[63,80,105],"bounds":[64,81,106],"provide":[65],"tightest":[67],"results.":[68],"paper,":[71],"we":[72],"show":[73],"that":[74],"calculating":[75],"probability":[78],"using":[79,128],"be":[83,122,158],"solved":[84],"by":[85,127],"considering":[86,149],"an":[87,173],"equivalent":[88],"convex":[89],"optimization":[90],"problem.":[91],"This":[92],"allows":[93],"us":[94],"to,":[95],"on":[96,108],"one":[98],"hand,":[99,111],"decrease":[100],"while,":[107],"other":[110],"ensure":[112],"tighter":[114],"approximation":[115,169],"since":[116],"larger":[118,134],"variable":[119],"space":[120],"searched":[123],"more":[124],"efficiently,":[125],"i.e.,":[126],"binary":[129],"search":[130,140],"techniques":[131],"over":[132,141],"area":[135],"instead":[136],"sequential":[139],"smaller":[143],"area.":[144],"We":[145],"evaluate":[146],"approach":[148,154],"synthesized":[150],"task":[151,163],"sets.":[152],"Our":[153],"is":[155],"shown":[156],"computationally":[159],"efficient":[160],"large":[162],"whilst":[165],"experimentally":[166],"suggesting":[167],"reasonable":[168],"quality":[170],"compared":[171],"exact":[174],"analysis.":[175]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
