Scheduling Analysis and Correction of Periodic Real Time Systems with Tasks Migration

Abstract

Satisfying a real-time system (RTS) timing constraints is a serious deal for the prevention or the decreasing of the human and economic possible problems. In this vein, multiprocessor RTS scheduling is increasingly difficult, especially since it became more complex and dynamic. In this context, scheduling correction turns out to be very necessary for a better schedulability. In fact once done at an early stage of the scheduling cycle, it can effectively reduce the potential temporal faults. It helps then avoiding the risk of a very expensive complete reiteration of the scheduling cycle, thus reduce the temporal cost. The present paper focuses on providing a scheduling correction solution that may be integrated into the scheduling analysis. The proposed correction method is based on rectifying the partitioning if the RTS is detected non-schedulable. This method is based on the migration of some tasks from the non-schedulable overloaded partitions toward the not loaded ones.