6533b7cffe1ef96bd12583ca

RESEARCH PRODUCT

Schedulability analysis of window-constrained execution time tasks for real-time control

Alfons CrespoPatricia BalbastreIsmael Ripoll

subject

Adaptive controlJob shop schedulingReal-time Control SystemComputer scienceControl systemReal-time computingSystems designFault toleranceDynamic priority schedulingScheduling (computing)

description

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. From the system design point of view, it would be useful to have more information, for example, how much can one vary some task parameters, such as computation time, without jeopardizing the system feasibility. The aim of the 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. In control applications, this information can be used to execute supervision activities, such as model updating which is not required to be executed in all the periods, or to determine new controller parameters for the current operating conditions. In fault tolerance, this information allows us to recover n faults in m activations.

yearjournalcountryeditionlanguage
2003-06-25Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002
https://doi.org/10.1109/emrts.2002.1019181