Power and resource aware scheduling with multiple voltages

Haoran Zhang, Cong Hao, Nan Wang, Song Chen, Takeshi Yoshimura

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

1 Citation (Scopus)

Abstract

In this paper, we address the problem of timing-constrained scheduling with resources operating at multiple voltages. Without the resource concern, a dual piecewise-linear programming formulation is proposed which can be transformed into a min-cost flow problem on a simplified flow graph. We present a two-stage method to minimize power and resource usage. In the first stage, an optimal dual piecewise-linear network simplex method (DPLNSM) is proposed to minimize the power consumption. The method is efficient, especially when the given maximum control step is large. In the second stage, a tabu-search based scheduling method is proposed to decrease the resource usage on the basis of power optimization, where tree transformation and list scheduling are done in each iteration. Experimental results show that our proposed method generates optimal solutions on the given benchmarks in a short time.

Original languageEnglish
Title of host publicationProceedings of International Conference on ASIC
PublisherIEEE Computer Society
ISBN (Print)9781467364157
DOIs
Publication statusPublished - 2013
Event2013 IEEE 10th International Conference on ASIC, ASICON 2013 - Shenzhen
Duration: 2013 Oct 282013 Oct 31

Other

Other2013 IEEE 10th International Conference on ASIC, ASICON 2013
CityShenzhen
Period13/10/2813/10/31

Fingerprint

Scheduling
Electric potential
Flow graphs
Linear networks
Tabu search
Linear programming
Electric power utilization
Costs

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Zhang, H., Hao, C., Wang, N., Chen, S., & Yoshimura, T. (2013). Power and resource aware scheduling with multiple voltages. In Proceedings of International Conference on ASIC [6811931] IEEE Computer Society. https://doi.org/10.1109/ASICON.2013.6811931

Power and resource aware scheduling with multiple voltages. / Zhang, Haoran; Hao, Cong; Wang, Nan; Chen, Song; Yoshimura, Takeshi.

Proceedings of International Conference on ASIC. IEEE Computer Society, 2013. 6811931.

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

Zhang, H, Hao, C, Wang, N, Chen, S & Yoshimura, T 2013, Power and resource aware scheduling with multiple voltages. in Proceedings of International Conference on ASIC., 6811931, IEEE Computer Society, 2013 IEEE 10th International Conference on ASIC, ASICON 2013, Shenzhen, 13/10/28. https://doi.org/10.1109/ASICON.2013.6811931
Zhang H, Hao C, Wang N, Chen S, Yoshimura T. Power and resource aware scheduling with multiple voltages. In Proceedings of International Conference on ASIC. IEEE Computer Society. 2013. 6811931 https://doi.org/10.1109/ASICON.2013.6811931
Zhang, Haoran ; Hao, Cong ; Wang, Nan ; Chen, Song ; Yoshimura, Takeshi. / Power and resource aware scheduling with multiple voltages. Proceedings of International Conference on ASIC. IEEE Computer Society, 2013.
@inproceedings{de355bf8ef9f475c82698be2fd3163ff,
title = "Power and resource aware scheduling with multiple voltages",
abstract = "In this paper, we address the problem of timing-constrained scheduling with resources operating at multiple voltages. Without the resource concern, a dual piecewise-linear programming formulation is proposed which can be transformed into a min-cost flow problem on a simplified flow graph. We present a two-stage method to minimize power and resource usage. In the first stage, an optimal dual piecewise-linear network simplex method (DPLNSM) is proposed to minimize the power consumption. The method is efficient, especially when the given maximum control step is large. In the second stage, a tabu-search based scheduling method is proposed to decrease the resource usage on the basis of power optimization, where tree transformation and list scheduling are done in each iteration. Experimental results show that our proposed method generates optimal solutions on the given benchmarks in a short time.",
author = "Haoran Zhang and Cong Hao and Nan Wang and Song Chen and Takeshi Yoshimura",
year = "2013",
doi = "10.1109/ASICON.2013.6811931",
language = "English",
isbn = "9781467364157",
booktitle = "Proceedings of International Conference on ASIC",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Power and resource aware scheduling with multiple voltages

AU - Zhang, Haoran

AU - Hao, Cong

AU - Wang, Nan

AU - Chen, Song

AU - Yoshimura, Takeshi

PY - 2013

Y1 - 2013

N2 - In this paper, we address the problem of timing-constrained scheduling with resources operating at multiple voltages. Without the resource concern, a dual piecewise-linear programming formulation is proposed which can be transformed into a min-cost flow problem on a simplified flow graph. We present a two-stage method to minimize power and resource usage. In the first stage, an optimal dual piecewise-linear network simplex method (DPLNSM) is proposed to minimize the power consumption. The method is efficient, especially when the given maximum control step is large. In the second stage, a tabu-search based scheduling method is proposed to decrease the resource usage on the basis of power optimization, where tree transformation and list scheduling are done in each iteration. Experimental results show that our proposed method generates optimal solutions on the given benchmarks in a short time.

AB - In this paper, we address the problem of timing-constrained scheduling with resources operating at multiple voltages. Without the resource concern, a dual piecewise-linear programming formulation is proposed which can be transformed into a min-cost flow problem on a simplified flow graph. We present a two-stage method to minimize power and resource usage. In the first stage, an optimal dual piecewise-linear network simplex method (DPLNSM) is proposed to minimize the power consumption. The method is efficient, especially when the given maximum control step is large. In the second stage, a tabu-search based scheduling method is proposed to decrease the resource usage on the basis of power optimization, where tree transformation and list scheduling are done in each iteration. Experimental results show that our proposed method generates optimal solutions on the given benchmarks in a short time.

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

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

U2 - 10.1109/ASICON.2013.6811931

DO - 10.1109/ASICON.2013.6811931

M3 - Conference contribution

AN - SCOPUS:84901371757

SN - 9781467364157

BT - Proceedings of International Conference on ASIC

PB - IEEE Computer Society

ER -