A Context-Switch Reduction Heuristic for Power-Aware Off-Line Scheduling

Abstract. Scheduling algorithms significantly affect the performance of a realtime system. In systems with power constraints, context switches in a schedule result in wasted power consumption. We present a scheduling algorithm and a heuristic for reducing the number of context switches. The algorithm executes in near linear time in terms of the number of jobs, finds a feasible schedule in most cases if it exists, and reasonably reduces the number of context switches. Thus it is a power-aware scheduling algorithm.

• Type: Conference
• Year: 2006
• Where: APCSAC
• Authors: Biju K. Raveendran, Sundar Balasubramaniam, K. Durga Prasad, S. Gurunarayanan
• Keywords: APCSAC 2006, Context Switches, Power-aware Scheduling Algorithm, Scheduling Algorithm