Fair Slack-Reclamation for Scheduling Periodic Tasks

In the past decades, many methods have been proposed for power-aware scheduling. This paper proposes a novel scheduling algorithm with fair slack reclaiming schemes, where tasks have the same arrival time and share a common deadline. Tasks are assigned to processor with priorities according to worst-case and average-case execution time of tasks, and the slack time is fairly reclaimed to slow down the following tasks for saving energy. Simulation results were performed to provide insights.