Inverse Rate Monotonic Technique for reduced energy consumption of weakly hard real time systems

This paper proposes a simple scheduling algorithm to minimize the energy consumption in weakly hard real time systems. It uses the (m, k)-model, which requires at least m out of k consecutive instances of a task meet their deadlines. In the first phase real time jobs are partitioned into mandatory and optional to satisfy weakly hard real time constraint. While, the second phase, introduces a scheduling policy based on Inverse Rate Monotonic scheduling to effectively reduce the energy consumption. The proposed approach combined with the existing techniques outperforms the rate monotonic priority scheduling and EDF in several practical problems. A theorem has been proved to indicate that the energy consumption is reduced by the proposed technique as compared to conventional techniques. The simulation results indicate an average reduction of approximately 11% by the proposed technique as compared to conventional techniques.