Marwan Wehaiba el Khazen, L. Cucu-Grosjean, A. Gogonel, Hadrien A. Clarke, Y. Sorel
{"title":"摘要:WKS是一种局部无监督统计算法,用于检测时序分析中的过渡","authors":"Marwan Wehaiba el Khazen, L. Cucu-Grosjean, A. Gogonel, Hadrien A. Clarke, Y. Sorel","doi":"10.1109/RTCSA52859.2021.00032","DOIUrl":null,"url":null,"abstract":"The increased complexity of programs and processors is an important challenge that the embedded real-time systems community faces today, as it implies substancial timing variability. Processor features like pipelines or communication buses are not always completely described, while black-box programs integrated by third parties are hidden for IP reasons. This situation explains the use of statistical approaches to study the timing variability of programs. Most existing work is concentrated on the guarantees provided by positive answers to statistical tests, while our current work concerns potential algorithms based on the negative answers to these tests and their impact on the timing analysis. We introduce here one such algorithm, the Walking Kolmogorov-Smirnov test (WKS).","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"26 1","pages":"201-203"},"PeriodicalIF":0.5000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Work-in-Progress Abstract: WKS, a local unsupervised statistical algorithm for the detection of transitions in timing analysis\",\"authors\":\"Marwan Wehaiba el Khazen, L. Cucu-Grosjean, A. Gogonel, Hadrien A. Clarke, Y. Sorel\",\"doi\":\"10.1109/RTCSA52859.2021.00032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The increased complexity of programs and processors is an important challenge that the embedded real-time systems community faces today, as it implies substancial timing variability. Processor features like pipelines or communication buses are not always completely described, while black-box programs integrated by third parties are hidden for IP reasons. This situation explains the use of statistical approaches to study the timing variability of programs. Most existing work is concentrated on the guarantees provided by positive answers to statistical tests, while our current work concerns potential algorithms based on the negative answers to these tests and their impact on the timing analysis. We introduce here one such algorithm, the Walking Kolmogorov-Smirnov test (WKS).\",\"PeriodicalId\":38446,\"journal\":{\"name\":\"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)\",\"volume\":\"26 1\",\"pages\":\"201-203\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2021-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTCSA52859.2021.00032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTCSA52859.2021.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Work-in-Progress Abstract: WKS, a local unsupervised statistical algorithm for the detection of transitions in timing analysis
The increased complexity of programs and processors is an important challenge that the embedded real-time systems community faces today, as it implies substancial timing variability. Processor features like pipelines or communication buses are not always completely described, while black-box programs integrated by third parties are hidden for IP reasons. This situation explains the use of statistical approaches to study the timing variability of programs. Most existing work is concentrated on the guarantees provided by positive answers to statistical tests, while our current work concerns potential algorithms based on the negative answers to these tests and their impact on the timing analysis. We introduce here one such algorithm, the Walking Kolmogorov-Smirnov test (WKS).