Non-preemptive scheduling for critical and hard real-time applications on embedded platforms

Abstract

The problem of providing high predictability when scheduling critical and hard realtime applications on embedded and DSP-based platforms is studied in this paper. A model of hard real-time tasks, the ModX (executable module), is presented and a set of non-preemptive scheduling techniques are discussed, based on this model. Extensive evaluation tests have been performed to simulate and analyze the proposed scheduling algorithms and their comparative performance. The main evaluation results are also discussed in this work.