Scheduling algorithms significantly affect the performance of a real-time 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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Raveendran, B., Balasubramaniam, S., Prasad, K. D., & Gurunarayanan, S. (2006). A context-switch reduction heuristic for power-aware off-line scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4186 LNCS, pp. 437–444). Springer Verlag. https://doi.org/10.1007/11859802_41
Mendeley helps you to discover research relevant for your work.