Virtual platforms and timing analysis: status, challenges and future directions
Proceedings of the 44th annual Design Automation Conference
Sensitivity analysis of complex embedded real-time systems
Real-Time Systems
Proceedings of the conference on Design, automation and test in Europe
Design and Development of Component-Based Embedded Systems for Automotive Applications
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
The space of EDF deadlines: the exact region and a convex approximation
Real-Time Systems
Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems
Journal of Systems and Software
An analysis of the AUTOSAR OS timing protection mechanism
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Correctness by construction for high-integrity real-time systems: a metamodel-driven approach
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
A metamodel-driven process featuring advanced model-based timing analysis
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Computing robustness of FlexRay schedules to uncertainties in design parameters
Proceedings of the Conference on Design, Automation and Test in Europe
High performance dynamic voltage/frequency scaling algorithm for real-time dynamic load management
Journal of Systems and Software
Optimization of task allocation and priority assignment in hard real-time distributed systems
ACM Transactions on Embedded Computing Systems (TECS)
Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Hi-index | 0.00 |
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Later in the development cycle, schedulability analysis can be used to check the feasibility of the task set. However, the knowledge of the worst-case response times of tasks is often not sufficient to precisely determine the actions that would correct a non-schedulable design. In these situations, sensitivity analysis provides useful information for changing the implementation, by giving a measure of those computation times that must be reduced to achieve feasibility, or those that can be increased in case of a product extension, or providing the range of feasible periods for selecting the proper task activation rates. In this work, we exploit the concept of feasibility region to propose a faster and more concise solution to the sensitivity analysis problem with respect to existing techniques based on binary search. Furthermore, we show how the formalization of other problems in the feasibility domain, such as managing overloads through elastic scheduling, can be extended to the exact analysis.