Processor voltage scheduling for real-time tasks with non-preemptible sections

As mobile computing becomes more popular, there is increasing interest in techniques that can minimize energy consumption and prolong the battery life of mobile devices. Processor voltage scheduling is an effective way of reducing energy dissipation by reducing processor speed. We study voltage scheduling for real-time periodic tasks with non-preemptible sections. Three schemes are proposed to address this problem. The static speed algorithm derives a static feasible speed based on the stack resource policy (SRP). As worst-case blocking does not always occur, the novel dual speed algorithm switches processor speed to a lower value whenever possible. The dynamic reclaiming algorithm deploys a reservation-based approach to reclaim unused run time for redistribution. It effectively decreases processor idle time and further reduces processor speed Feasibility conditions are given and proved. Simulation results show that the two dynamic algorithms can reduce processor energy consumption by up to 80 percent over the static speed scheme.