Variable voltage task scheduling algorithms for minimizing energy/power

Research output: Contribution to journalArticlepeer-review

42 Scopus citations


In this paper, we propose variable voltage task scheduling algorithms that minimize energy or minimize peak power for the case when the task arrival times, deadline times, execution times, periods, and switching activities are given. We consider aperiodic (earliest due date, earliest deadline first), as well as periodic (rate monotonic, earliest deadline first) scheduling algorithms. We use the Lagrange multiplier method to theoretically determine the relation between the task voltages such that the energy or peak power is minimum, and then develop an iterative algorithm that satisfies the relation. The asymptotic complexity of the existing scheduling algorithms change very mildly with the application of the proposed algorithms. We show experimentally (random experiments as well as real-life cases), that the voltage assignment obtained by the proposed low-complexity algorithm is very close to that of the optimal energy (0.1% error) and optimal peak power (1% error) assignment.

Original languageEnglish (US)
Pages (from-to)270-276
Number of pages7
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Issue number2
StatePublished - Apr 1 2003


  • Dynamic voltage scaling
  • Energy minimization
  • Lagrange multiplier method
  • Low power
  • Off line algorithms
  • On line
  • Peak power minimization
  • Task scheduling

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Electrical and Electronic Engineering


Dive into the research topics of 'Variable voltage task scheduling algorithms for minimizing energy/power'. Together they form a unique fingerprint.

Cite this