Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Engineering a hard real-time system: from theory to practice
Software—Practice & Experience
Improvement in feasibility testing for real-time tasks
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Fixed-Priority Sensitivity Analysis for Linear Compute Time Models
IEEE Transactions on Software Engineering
Schedulability Analysis of Window-Constrained Execution Time Tasks for Real-Time Control
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Graceful Degradation in Real-time Control Applications Using (m, k)-Firm Guarantee
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Scheduling Periodic Task Systems to Minimize Output Jitter
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Elastic Task Model for Adaptive Rate Control
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Jitter Compensation for Real-Time Control Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Guaranteeing fault tolerance through scheduling in real-time systems
Guaranteeing fault tolerance through scheduling in real-time systems
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems
Journal of Systems and Software
Optimal procrastination interval for constrained deadline sporadic tasks upon uniprocessors
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
Feasibility tests for hard real-time systems provide information about the schedulability of the task set. However, this information is a yes or a no answer, that is, whether the task set achieves the test or not. From the real-time system design point of view, having more information available would be useful. For example, how much the computation time can vary without jeopardising the system feasibility. This work specifically provides methods to determine off-line how much a task can increase its computation time, by maintaining the system feasibility under a dynamic priority scheduling. The extra time can be determined not only in all the task activations, but in n of a window of m invocations. This is what we call a window-constrained execution time system. The results presented in this work can be used in all kinds of real-time systems: fault tolerance management, imprecise computation, overrun handling, control applications, etc.