Variable voltage task scheduling for minimizing energy or minimizing power

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Citations (Scopus)

Abstract

In this paper we propose task scheduling algorithms that minimize energy or minimize power for the case when the tasks have different arrival times, deadline times, execution times and switching activities. We theoretically determine the relation between the operating voltages for the minimum energy (power) assignment and develop a polynomial time scheduling algorithm that uses this relation. We show experimentally that the voltage assignment obtained by our algorithm is very close to that of the optimal assignment.

Original languageEnglish (US)
Title of host publicationICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
PublisherIEEE
Pages3239-3242
Number of pages4
Volume6
StatePublished - 2000
Event2000 IEEE Interntional Conference on Acoustics, Speech, and Signal Processing - Istanbul, Turkey
Duration: Jun 5 2000Jun 9 2000

Other

Other2000 IEEE Interntional Conference on Acoustics, Speech, and Signal Processing
CityIstanbul, Turkey
Period6/5/006/9/00

Fingerprint

scheduling
Scheduling algorithms
Scheduling
Electric potential
electric potential
Polynomials
energy
arrivals
polynomials

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Acoustics and Ultrasonics

Cite this

Manzak, A., & Chakrabarti, C. (2000). Variable voltage task scheduling for minimizing energy or minimizing power. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings (Vol. 6, pp. 3239-3242). IEEE.

Variable voltage task scheduling for minimizing energy or minimizing power. / Manzak, A.; Chakrabarti, Chaitali.

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Vol. 6 IEEE, 2000. p. 3239-3242.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Manzak, A & Chakrabarti, C 2000, Variable voltage task scheduling for minimizing energy or minimizing power. in ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. vol. 6, IEEE, pp. 3239-3242, 2000 IEEE Interntional Conference on Acoustics, Speech, and Signal Processing, Istanbul, Turkey, 6/5/00.
Manzak A, Chakrabarti C. Variable voltage task scheduling for minimizing energy or minimizing power. In ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Vol. 6. IEEE. 2000. p. 3239-3242
Manzak, A. ; Chakrabarti, Chaitali. / Variable voltage task scheduling for minimizing energy or minimizing power. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Vol. 6 IEEE, 2000. pp. 3239-3242
@inproceedings{a091c3ee7a8249ff9c1363fe866d67ba,
title = "Variable voltage task scheduling for minimizing energy or minimizing power",
abstract = "In this paper we propose task scheduling algorithms that minimize energy or minimize power for the case when the tasks have different arrival times, deadline times, execution times and switching activities. We theoretically determine the relation between the operating voltages for the minimum energy (power) assignment and develop a polynomial time scheduling algorithm that uses this relation. We show experimentally that the voltage assignment obtained by our algorithm is very close to that of the optimal assignment.",
author = "A. Manzak and Chaitali Chakrabarti",
year = "2000",
language = "English (US)",
volume = "6",
pages = "3239--3242",
booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Variable voltage task scheduling for minimizing energy or minimizing power

AU - Manzak, A.

AU - Chakrabarti, Chaitali

PY - 2000

Y1 - 2000

N2 - In this paper we propose task scheduling algorithms that minimize energy or minimize power for the case when the tasks have different arrival times, deadline times, execution times and switching activities. We theoretically determine the relation between the operating voltages for the minimum energy (power) assignment and develop a polynomial time scheduling algorithm that uses this relation. We show experimentally that the voltage assignment obtained by our algorithm is very close to that of the optimal assignment.

AB - In this paper we propose task scheduling algorithms that minimize energy or minimize power for the case when the tasks have different arrival times, deadline times, execution times and switching activities. We theoretically determine the relation between the operating voltages for the minimum energy (power) assignment and develop a polynomial time scheduling algorithm that uses this relation. We show experimentally that the voltage assignment obtained by our algorithm is very close to that of the optimal assignment.

UR - http://www.scopus.com/inward/record.url?scp=0033709471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033709471&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033709471

VL - 6

SP - 3239

EP - 3242

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

PB - IEEE

ER -