Abstract: In this paper, work in progress about two original on-line algorithms to solve the problem of scheduling a mix of periodic hard real-time and aperiodic soft and non real-time tasks in a single processor is presented. The proposed methods perform well when compared to other methods that address the same problem.
Index terms: k-schedulability; priority inversions; hard, soft and non real-time mix; periodic and aperiodic mix
