Sensitivity Analysis of Strictly Periodic Tasks in Multi-Core Real-Time Systems

In the design phase of real-Time systems, it cannot be expected that the timing attributes of all tasks are completely specified and never changed. The increased computation times or shortened periods in a schedulable system often cause deadlines to be missed. In such situations, sensitivity analysis is an effective approach to provide quantitative indications for the design modification, by identifying the borderlines on parameter variations while keeping the systems schedulable. In this paper, we propose a new approach to analyze the sensitivity of the timing parameters of tasks with strict periods in multi-core real-Time systems. We first analyze a schedulability condition to determine whether a task is schedulable on a given processor without changing the start times of the existing tasks. Then, following a game theory analogy, we design recursive algorithms to compute the permissible changes in the task timing parameters, by allowing each task to optimize its own start time and processor allocation. Finally, we conduct experiments with randomly generated tasks to show that our approach is more efficient than the existing solutions to solve the sensitivity problem. The proposed approach has a wide range of applications, only guiding the design of multi-core systems, but also improving the robustness of a design subject to future changes.