Avoiding Run-Time Infeasibility In Systems Containing Coupled Tasks
AXEL W. KRINGS, M.H. Azadmanesh · INFOR Information Systems and Operational Research · 1999
This paper investigates the problem of guaranteeing stability and run-time feasibility in real-time systems containing coupled tasks, in the context of non-preemptive priority scheduling. Instability is the result of so-called multiprocessor timing anomalies, where deadlines can be missed due to the reduction in task durations. Such reductions can also result in run-time infeasibility of coupled task pairs due to the inherent intertask timing constraints. A scheduling environment, feasibility conditions and a general algorithm are presented that avoid both phenomena at run-time.