Schedulability Analysis of Window-Constrained Execution Time Tasks for Real-Time Control

Authors:
Patricia Balbastre;Ismael Ripoll;Alfons Crespo
Affiliations:
-;-;-
Venue:
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Year:
2002

Citing 0
Cited 7

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
Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling

Real-Time Systems
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Other issues

Embedded Systems Design
Preservation of timing properties with the ada ravenscar profile

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm

International Journal of Advanced Pervasive and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Feasibility tests for hard real-time systems provide information about the schedulability of a set of tasks. However, this information is a yes or no answer, whether the task set achieves the test or not [13 ]. From the system design point of view, it would be useful to have more information, for example, how much can vary some task parameters, such as computation time, without jeopardize the system feasibility. The aim of this work is to provide a method to determine how much a task can increase its computation time, maintaining the system feasibility under a dynamic priority scheduling. This extra time can be determined not only in all the task activations, but in n of a window of m task invocations. This is what we call a window-constrained execution time system. This can be very useful in several fields: complex control algorithms, fault tolerance management, imprecise computation, etc. In control applications, this information can be used to execute supervision activities, such as model updating which is not required to be executed all the periods, or to determine new controller parameters for the current operating conditions. In fault tolerance, this information allows to recover n faults in m activations.