Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00018
Xiaojie Guo, Lionel Rieg, P. Torrini
Embedded systems often need to react in a timely manner. Life-critical or mission-critical ones require assurance that they comply with these real-time requirements. In particular, schedulability analysis is both essential and difficult to get right. Formal methods can help as they are a powerful tool for ensuring properties with the highest assurance level. We describe a case study for the FPP and EDF policies providing end-to-end assurance by connecting the schedulability analysis tool Prosa and the real-time OS kernel RT-CertiKOS, both using the Coq proof assistant to prove their results. Analyzing precisely the key ideas underlying this connection, we improve it to make it more generic and reduce the associated proof burden. We thus sketch a refined method which allows for providing formal schedulability guarantees to other OSes or low-level components with minimal effort.
{"title":"A generic approach for the certified schedulability analysis of software systems","authors":"Xiaojie Guo, Lionel Rieg, P. Torrini","doi":"10.1109/RTCSA52859.2021.00018","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00018","url":null,"abstract":"Embedded systems often need to react in a timely manner. Life-critical or mission-critical ones require assurance that they comply with these real-time requirements. In particular, schedulability analysis is both essential and difficult to get right. Formal methods can help as they are a powerful tool for ensuring properties with the highest assurance level. We describe a case study for the FPP and EDF policies providing end-to-end assurance by connecting the schedulability analysis tool Prosa and the real-time OS kernel RT-CertiKOS, both using the Coq proof assistant to prove their results. Analyzing precisely the key ideas underlying this connection, we improve it to make it more generic and reduce the associated proof burden. We thus sketch a refined method which allows for providing formal schedulability guarantees to other OSes or low-level components with minimal effort.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"52 1","pages":"83-92"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84151525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00027
Yigong Hu, Shengzhong Liu, T. Abdelzaher, Maggie B. Wigness, P. David
On-board computing capacity remains a key bottleneck in modern machine inference pipelines that run on embedded hardware, such as aboard autonomous drones or cars. To mitigate this bottleneck, recent work proposed an architecture for segmenting input frames of complex modalities, such as video, and prioritizing downstream machine perception tasks based on criticality of the respective segments of the perceived scene. Criticality-based prioritization allows limited machine resources (of lower-end embedded GPUs) to be spent more judiciously on tracking more important objects first. This paper explores a novel dimension in criticality-based prioritization of machine perception; namely, the role of criticality-dependent image resizing as a way to improve the trade-off between perception quality and timeliness. Given an assessment of criticality (e.g., an object’s distance from the autonomous car), the scheduler is allowed to choose from several image resizing options (and related inference models) before passing the resized images to the perception module. Experiments on an AI-powered embedded platform with a real-world driving dataset demonstrate significant improvements in the trade-off between perception accuracy and response time when the proposed resizing algorithm is used. The improvement is attributed to two advantages of the proposed scheme: (i) improved preferential treatment of more critical objects by reducing time spent on less critical ones, and (ii) improved image batching within the GPU, thanks to re-sizing, leading to better resource utilization.
{"title":"On Exploring Image Resizing for Optimizing Criticality-based Machine Perception","authors":"Yigong Hu, Shengzhong Liu, T. Abdelzaher, Maggie B. Wigness, P. David","doi":"10.1109/RTCSA52859.2021.00027","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00027","url":null,"abstract":"On-board computing capacity remains a key bottleneck in modern machine inference pipelines that run on embedded hardware, such as aboard autonomous drones or cars. To mitigate this bottleneck, recent work proposed an architecture for segmenting input frames of complex modalities, such as video, and prioritizing downstream machine perception tasks based on criticality of the respective segments of the perceived scene. Criticality-based prioritization allows limited machine resources (of lower-end embedded GPUs) to be spent more judiciously on tracking more important objects first. This paper explores a novel dimension in criticality-based prioritization of machine perception; namely, the role of criticality-dependent image resizing as a way to improve the trade-off between perception quality and timeliness. Given an assessment of criticality (e.g., an object’s distance from the autonomous car), the scheduler is allowed to choose from several image resizing options (and related inference models) before passing the resized images to the perception module. Experiments on an AI-powered embedded platform with a real-world driving dataset demonstrate significant improvements in the trade-off between perception accuracy and response time when the proposed resizing algorithm is used. The improvement is attributed to two advantages of the proposed scheme: (i) improved preferential treatment of more critical objects by reducing time spent on less critical ones, and (ii) improved image batching within the GPU, thanks to re-sizing, leading to better resource utilization.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"123 1","pages":"169-178"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86776407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00028
Anh-Duy Vu, Borzoo Bonakdarpour
In this paper, we propose an approach to extend the operational time of teams of battery-based robots by introducing a set of charging stations. We assume that the robots are heterogeneous (having different energy limits and being able to service different types of customers) and have access to a priori known map of the environment. The map is modeled as a directed, connected, and finite graph whose nodes are charging stations or customers, and arcs denote the possibility of traveling. To this end, we first formulate a task assignment and path planning problem that aims at optimizing energy consumption as well as the time needed to complete the tasks, including the time spent for recharging. Next, we propose four offline optimization techniques and one online algorithm, where the robots can dynamically adjust their paths in response to the presence of uncertainties imposed by the physical environment. Our proposed algorithms are validated through both simulation and a real-world case study on a team of unmanned aerial vehicles (UAVs) performing a joint search mission.
{"title":"Optimal Recharging of Teams of Mobile Robots","authors":"Anh-Duy Vu, Borzoo Bonakdarpour","doi":"10.1109/RTCSA52859.2021.00028","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00028","url":null,"abstract":"In this paper, we propose an approach to extend the operational time of teams of battery-based robots by introducing a set of charging stations. We assume that the robots are heterogeneous (having different energy limits and being able to service different types of customers) and have access to a priori known map of the environment. The map is modeled as a directed, connected, and finite graph whose nodes are charging stations or customers, and arcs denote the possibility of traveling. To this end, we first formulate a task assignment and path planning problem that aims at optimizing energy consumption as well as the time needed to complete the tasks, including the time spent for recharging. Next, we propose four offline optimization techniques and one online algorithm, where the robots can dynamically adjust their paths in response to the presence of uncertainties imposed by the physical environment. Our proposed algorithms are validated through both simulation and a real-world case study on a team of unmanned aerial vehicles (UAVs) performing a joint search mission.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"27 1","pages":"179-188"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73597037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00025
Aaron Willcock, N. Fisher, Thidapat Chantem
Characterizing computational demand of Cyber-Physical Systems (CPS) is critical for guaranteeing that multiple hard real-time tasks may be scheduled on shared resources without missing deadlines. In a CPS involving repetition such as industrial automation systems found in chemical process control or robotic manufacturing, sensors and actuators used as part of the industrial process may be conditionally enabled (and disabled) as a sequence of repeated steps is executed. In robotic manufacturing, for example, these steps may be the movement of a robotic arm through some trajectories followed by activation of end-effector sensors and actuators at the end of each completed motion. The conditional enabling of sensors and actuators produces a sequence of Monotonically Ascending Execution times (MAE) with lower WCET when the sensors are disabled and higher WCET when enabled. Since these systems may have several predefined steps to follow before repeating the entire sequence each unique step may result in several consecutive sequences of MAE. The repetition of these unique sequences of MAE result in a repeating WCET sequence. In the absence of an efficient demand characterization technique for repeating WCET sequences composed of subsequences with monotonically increasing execution time, this work proposes a new task model to describe the behavior of real-world systems which generate large repeating WCET sequences with subsequences of monotonically increasing execution times. In comparison to the most applicable current model, the Generalized Multiframe model (GMF), an empirically and theoretically faster method for characterizing the demand is provided. The demand characterization algorithm is evaluated through a case study of a robotic arm and simulation of 10,000 randomly generated tasks where, on average, the proposed approach is 231 and 179 times faster than the state-of-the-art in the case study and simulation respectively.
{"title":"Demand Characterization of CPS with Conditionally-Enabled Sensors","authors":"Aaron Willcock, N. Fisher, Thidapat Chantem","doi":"10.1109/RTCSA52859.2021.00025","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00025","url":null,"abstract":"Characterizing computational demand of Cyber-Physical Systems (CPS) is critical for guaranteeing that multiple hard real-time tasks may be scheduled on shared resources without missing deadlines. In a CPS involving repetition such as industrial automation systems found in chemical process control or robotic manufacturing, sensors and actuators used as part of the industrial process may be conditionally enabled (and disabled) as a sequence of repeated steps is executed. In robotic manufacturing, for example, these steps may be the movement of a robotic arm through some trajectories followed by activation of end-effector sensors and actuators at the end of each completed motion. The conditional enabling of sensors and actuators produces a sequence of Monotonically Ascending Execution times (MAE) with lower WCET when the sensors are disabled and higher WCET when enabled. Since these systems may have several predefined steps to follow before repeating the entire sequence each unique step may result in several consecutive sequences of MAE. The repetition of these unique sequences of MAE result in a repeating WCET sequence. In the absence of an efficient demand characterization technique for repeating WCET sequences composed of subsequences with monotonically increasing execution time, this work proposes a new task model to describe the behavior of real-world systems which generate large repeating WCET sequences with subsequences of monotonically increasing execution times. In comparison to the most applicable current model, the Generalized Multiframe model (GMF), an empirically and theoretically faster method for characterizing the demand is provided. The demand characterization algorithm is evaluated through a case study of a robotic arm and simulation of 10,000 randomly generated tasks where, on average, the proposed approach is 231 and 179 times faster than the state-of-the-art in the case study and simulation respectively.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"1 1","pages":"149-158"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90327780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00030
F. Slomka, M. Sadeghi
In this ongoing research, we investigate the mathematical properties of the scheduling theory and the real-time calculus and their relationship to each other.
在本研究中，我们探讨了调度理论和实时微积分的数学性质及其相互关系。
{"title":"Work-in-Progress Abstract: On the relationship between scheduling theory and real-time calculus","authors":"F. Slomka, M. Sadeghi","doi":"10.1109/RTCSA52859.2021.00030","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00030","url":null,"abstract":"In this ongoing research, we investigate the mathematical properties of the scheduling theory and the real-time calculus and their relationship to each other.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"72 1","pages":"195-197"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86963832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00019
Matthew McCormack, Amit Vasudevan, Guyue Liu, V. Sekar
Today’s edge networks continue to see an increasing number of deployed IoT devices. These IoT devices aim to increase productivity and efficiency; however, they are plagued by a myriad of vulnerabilities. Industry and academia have proposed protecting these devices by deploying a “bolt-on” security gateway to these edge networks. The gateway applies security protections at the network level. While security gateways are an attractive solution, they raise a fundamental concern: Can the bolt-on security gateway be trusted? This paper identifies key challenges in realizing this goal and sketches a roadmap for providing trust in bolt-on edge IoT security gateways. Specifically, we show the promise of using a micro-hypervisor driven approach for delivering practical (deployable today) trust that is catered to both end-users and gateway vendors alike in terms of cost, generality, capabilities, and performance. We describe the challenges in establishing trust on today’s edge security gateways, formalize the adversary and trust properties, describe our system architecture, encode and prove our architecture trust properties using the Alloy formal modeling language. We foresee our trustworthy security gateway architecture becoming a practical and extensible formal foundation towards realizing robust trust properties on today’s edge security gateway implementations.
{"title":"Formalizing an Architectural Model of a Trustworthy Edge IoT Security Gateway‡","authors":"Matthew McCormack, Amit Vasudevan, Guyue Liu, V. Sekar","doi":"10.1109/RTCSA52859.2021.00019","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00019","url":null,"abstract":"Today’s edge networks continue to see an increasing number of deployed IoT devices. These IoT devices aim to increase productivity and efficiency; however, they are plagued by a myriad of vulnerabilities. Industry and academia have proposed protecting these devices by deploying a “bolt-on” security gateway to these edge networks. The gateway applies security protections at the network level. While security gateways are an attractive solution, they raise a fundamental concern: Can the bolt-on security gateway be trusted? This paper identifies key challenges in realizing this goal and sketches a roadmap for providing trust in bolt-on edge IoT security gateways. Specifically, we show the promise of using a micro-hypervisor driven approach for delivering practical (deployable today) trust that is catered to both end-users and gateway vendors alike in terms of cost, generality, capabilities, and performance. We describe the challenges in establishing trust on today’s edge security gateways, formalize the adversary and trust properties, describe our system architecture, encode and prove our architecture trust properties using the Alloy formal modeling language. We foresee our trustworthy security gateway architecture becoming a practical and extensible formal foundation towards realizing robust trust properties on today’s edge security gateway implementations.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"28 1","pages":"93-102"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81428632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00017
Luca Belluardo, Andrea Stevanato, Daniel Casini, Giorgiomaria Cicero, Alessandro Biondi, G. Buttazzo
This work aims at making Apollo, a popular autonomous driving framework, safer and more secure by designing a multi-domain architecture, where its components are split between a feature-rich domain running Linux and a critical domain running a real-time operating system (RTOS). The two domains are isolated by a hypervisor. We implemented a prototype where the control component has been ported from Linux to the Erika automotive-grade RTOS, and we discuss a number of challenges that have been faced in moving the component to Erika. The proposed solution has been experimentally evaluated by measuring the latencies involving processing paths passing through the control component.
{"title":"A Multi-Domain Software Architecture for Safe and Secure Autonomous Driving","authors":"Luca Belluardo, Andrea Stevanato, Daniel Casini, Giorgiomaria Cicero, Alessandro Biondi, G. Buttazzo","doi":"10.1109/RTCSA52859.2021.00017","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00017","url":null,"abstract":"This work aims at making Apollo, a popular autonomous driving framework, safer and more secure by designing a multi-domain architecture, where its components are split between a feature-rich domain running Linux and a critical domain running a real-time operating system (RTOS). The two domains are isolated by a hypervisor. We implemented a prototype where the control component has been ported from Linux to the Erika automotive-grade RTOS, and we discuss a number of challenges that have been faced in moving the component to Erika. The proposed solution has been experimentally evaluated by measuring the latencies involving processing paths passing through the control component.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"1 1","pages":"73-82"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90401143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00023
Junjie Shi, Niklas Ueter, G. V. D. Brüggen, Jian-Jia Chen
Multiprocessor resource synchronization and locking protocols are of great importance to utilize the computation power of multiprocessor real-time systems. Hence, in the past decades a large number of protocols have been developed and analyzed. The recently proposed dependency graph approach has significantly improved the schedulability for frame-based and periodic real-time task systems. However, the dependency graph approach only supports non-nested resource access, i.e., each critical section can only access one shared resource. In this paper, we develop a dependency graph based protocol that allows nested resource access, where a critical section can access multiple shared resources at the same time. First, constraint programming is applied to construct a dependency graph that determines the execution order of critical sections. Afterwards, a schedule is generated based on this order. To show the feasibility of our proposed protocol, we provide extensive numerical evaluations under different configurations. The evaluation results show that our approach has very good performance with respect to schedulability for frame-based and periodic real-time task systems, whereas the existing results applicable for sporadic task systems have worse performance under such a limited setting.
{"title":"Graph-Based Optimizations for Multiprocessor Nested Resource Sharing","authors":"Junjie Shi, Niklas Ueter, G. V. D. Brüggen, Jian-Jia Chen","doi":"10.1109/RTCSA52859.2021.00023","DOIUrl":"https://doi.org/10.1109/RTCSA52859.2021.00023","url":null,"abstract":"Multiprocessor resource synchronization and locking protocols are of great importance to utilize the computation power of multiprocessor real-time systems. Hence, in the past decades a large number of protocols have been developed and analyzed. The recently proposed dependency graph approach has significantly improved the schedulability for frame-based and periodic real-time task systems. However, the dependency graph approach only supports non-nested resource access, i.e., each critical section can only access one shared resource. In this paper, we develop a dependency graph based protocol that allows nested resource access, where a critical section can access multiple shared resources at the same time. First, constraint programming is applied to construct a dependency graph that determines the execution order of critical sections. Afterwards, a schedule is generated based on this order. To show the feasibility of our proposed protocol, we provide extensive numerical evaluations under different configurations. The evaluation results show that our approach has very good performance with respect to schedulability for frame-based and periodic real-time task systems, whereas the existing results applicable for sporadic task systems have worse performance under such a limited setting.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"13 1","pages":"129-138"},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77943494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/rtcsa52859.2021.00001
{"title":"[Title page i]","authors":"","doi":"10.1109/rtcsa52859.2021.00001","DOIUrl":"https://doi.org/10.1109/rtcsa52859.2021.00001","url":null,"abstract":"","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"181 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72423955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-01DOI: 10.1109/RTCSA52859.2021.00032
Marwan Wehaiba el Khazen, L. Cucu-Grosjean, A. Gogonel, Hadrien A. Clarke, Y. Sorel
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).
{"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":"https://doi.org/10.1109/RTCSA52859.2021.00032","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.7,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88626110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：