Scheduling algorithm with energy-response trade-off considerations for mixed task sets
Chin‐Fu Kuo, Lieng-Cheng Chien, Yung-Feng Lu · 2013
This paper aims to investigate the scheduling problem of a mixed task set consisting of periodic tasks and aperiodic jobs in a real-time system. When a mixed task set is executed, a scheduling algorithm has to consider not only the system energy consumption but also the response time of the aperiodic jobs which do not want to be prolonged seriously. This paper proposes the Ratio Reclaim Algorithm (RRA) that reclaims the unused execution time for periodic jobs based on a user-defined ratio. For the convenience of maintaining effectively unused execution time left by early completed jobs, the earliness-queue is presented to reduce the memory space that the earliness-queue occupies. A series of experiments are conducted to evaluate the proposed algorithm. The experimental results demonstrate that the RRA scheme with a suitable user-defined value has a better performance than the compared scheme.