A context-switch reduction heuristic for power-aware off-line scheduling

  • Authors:
  • Biju Raveendran;Sundar Balasubramaniam;K Durga Prasad;S. Gurunarayanan

  • Affiliations:
  • Computer Science Group;Computer Science Group;Computer Science Group;BITS, Electronics & Instrumentation Group, Pilani, Rajasthan, India

  • Venue:
  • ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.