An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems
Elastic Scheduling for Flexible Workload Management
IEEE Transactions on Computers
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
Real-Time Systems
Fixed-Priority Sensitivity Analysis for Linear Compute Time Models
IEEE Transactions on Software Engineering
Sensitivity Analysis of Real-Time Task Sets
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
VEST: An Aspect-Based Composition Tool for Real-Time Systems
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Task Period Selection and Schedulability in Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Improved Response-Time Analysis Calculations
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Time
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
MAST Real-Time View: A Graphic UML Tool for Modeling Object-Oriented Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Managing Quality-of-Control Performance Under Overload Conditions
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
Applying Sensitivity Analysis in Real-Time Distributed Systems
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Measuring the Performance of Schedulability Tests
Real-Time Systems
Optimal Task Rate Selection in Fixed Priority Systems
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Towards a simple meta-model for complex real-time and embedded systems
MEDI'11 Proceedings of the First international conference on Model and data engineering
A comparative study of rate monotonic schedulability tests
The Journal of Supercomputing
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
Preservation of timing properties with the ada ravenscar profile
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Reducing the gap between design and scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
Sensitivity analysis for arbitrary activation patterns in real-time systems
Proceedings of the Conference on Design, Automation and Test in Europe
Multi-mode monitoring for mixed-criticality real-time systems
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
Stability-aware analysis and design of embedded control systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
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.