New Optimal Solutions for Real-Time Reconfigurable Periodic Asynchronous OS Tasks with Minimizations of Response Times
New Optimal Solutions for Real-Time Reconfigurable Periodic Asynchronous OS Tasks with Minimizations of Response Times
复制标题
DOI:
10.4018/978-1-4666-3922-5.ch012
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
H. Gharsellaoui;Atef Gharbi;O. Mosbahi;M. Khalgui;A. Valentini
中科院分区:
文献类型:
--
作者:
H. Gharsellaoui;Atef Gharbi;O. Mosbahi;M. Khalgui;A. Valentini
This research work deals with Reconfigurable Uniprocessor embedded Real-Time Systems to be classically implemented by different OS tasks that we suppose independent, asynchronous and periodic in order to meet functional and temporal properties described in user requirements. We define in the book chapter a schedulability algorithm for preemptable, asynchronous and periodic reconfigurable task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm based on the EDF principles and on the dynamic reconfiguration. Two forms of automatic reconfigurations which are assumed to be applied at run-time: Addition-Remove of tasks or just modifications of their temporal parameters: WCET and/or Periods. Nevertheless, when such a scenario is applied to save the system at the occurrence of hardwaresoftware faults, or to improve its performance, some real-time properties can be violated. We define a new semantic of the reconfiguration where a crucial criterion to consider is the automatic improvement of the system's feasibility at run-time by using an Intelligent Agent that automatically checks the system's feasibility after any reconfiguration scenario to verify if all tasks meet the required deadlines. Indeed, if a reconfiguration scenario is applied at run-time, then the Intelligent Agent dynamically provides otherwise precious technical solutions for users to remove some tasks according to predefined heuristic (based on soft or hard task), or by modifying the worst case execution times (WCETs), periods, and/or deadlines of tasks, that violate corresponding constraints by new ones, in order to meet deadlines and to minimize their response time. To handle all possible reconfiguration solutions, we propose an agent-based architecture that applies automatic reconfigurations in order to re-obtain the system’s feasibility and to satisfy user requirements. Therefore, we developed the tool RT-Reconfiguration to support these contributions that we apply to a Blackberry Bold 9700 and to a Volvo system as running example systems and we apply the Real-Time Simulator Cheddar to check the whole system behavior and to evaluate the performance of the algorithm (detailed descriptions are available at the website: http://beru.univ-brest.fr/~singhoff/ cheddar). We present simulations of this architecture where we evaluate the agent that we implemented. Also, we present and discuss the results of experiments that compare the accuracy and the performance of our algorithm with others. INTRODUCTION Real-Time systems are playing a crucial role in our society, and in the last two decades, there has been an explosive growth in the number of real-time systems being used in our daily lives and in industry production. Systems such as chemical and nuclear plant control, space missions, flight control systems, military systems, telecommunications, multimedia systems, and so on all make use of real-time technologies. The most important attribute of real-time systems is that the correctness of such systems depends on not only the computed results but also on the time at which results are produced. In other words, real-time systems have timing requirements that must be guaranteed. Scheduling and schedulability analysis enables these guarantees to be provided.