Improvement in feasibility testing for real-time tasks
Real-Time Systems
Power conscious fixed priority scheduling for hard real-time systems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Engineering and Analysis of Fixed Priority Schedulers
IEEE Transactions on Software Engineering
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
Schedulability Analysis of Window-Constrained Execution Time Tasks for Real-Time Control
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Elastic Task Model for Adaptive Rate Control
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
MAST: Modeling and Analysis Suite for Real Time Applications
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Dynamic and Aggressive Scheduling Techniques for Power-Aware Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Speed Modulation in Energy-Aware Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Sensitivity Analysis for Fixed-Priority Real-Time Systems
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Computing the Minimum EDF Feasible Deadline in Periodic Systems
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Optimized Slowdown in Real-Time Task Systems
IEEE Transactions on Computers
Analysis of window-constrained execution time systems
Real-Time Systems
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
IEEE Transactions on Computers
The space of EDF deadlines: the exact region and a convex approximation
Real-Time Systems
Minimizing CPU energy in real-time systems with discrete speed management
ACM Transactions on Embedded Computing Systems (TECS)
Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems
Journal of Systems and Software
Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Schedulability Analysis for Real-Time Systems with EDF Scheduling
IEEE Transactions on Computers
Sensitivity Analysis for EDF Scheduled Arbitrary Deadline Real-Time Systems
RTCSA '10 Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications
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
Sensitivity analysis for arbitrary activation patterns in real-time systems
Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
The correctness of a real-time system depends on not only the system's output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set it is useful to know what changes can be made to a task that will result in a system that is borderline schedulable. It is also beneficial in an engineering context to know the minimum speed of a processor that will deliver a schedulable system. We address the following sensitivity analysis (parameter computations) for EDF-scheduled systems on a uniprocessor: task execution times, speed of the processor, task periods and task relative deadlines. We prove that an optimal (minimum or maximum) system parameter can be determined by a single run of the Quick convergence Processor demand Analysis (QPA) algorithm. This algorithm provides efficient and exact sensitivity analysis for arbitrary deadline real-time systems. We also improve the implementation of this sensitivity analysis by using various starting values for the algorithms. The approaches developed for task parameter computations are therefore as efficient as QPA, and are easily incorporated into a system design support tool.