Tabu search based multiple voltage scheduling under both timing and resource constraints

Jianmo Ni, Nan Wang, Takeshi Yoshimura

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

In this work, we address the multiple voltage scheduling problem to minimize power consumption under both timing and resource constraints. We develop a tabu search-based algorithm with a general vector representation of solution and an effective performance estimation. Moreover, our approach tends to solve a series of scheduling problems with respect to multiple voltage designs. Specifically, our method represents each solution by a vector of operation types and solves the scheduling subproblem corresponding to a certain solution vector. To get feasible solutions of the subproblem, a two-stage method is presented by first adopting the PLNSM algorithm [3] to generate delay assignment satisfying the timing constraint and then performing delay adjustment iteratively until the resource constraints are met. A heuristic estimation is introduced to predict the total power and resource usage of the neighborhood. Our proposed method achieves near-optimal solutions with only an average power increase of 0.84% compared with ILP for small-size designs, and a 24.1% reduction over a previous tabu search-based algorithm [7] for a set of benchmarks.

本文言語English
ホスト出版物のタイトルProceedings - International Symposium on Quality Electronic Design, ISQED
出版社IEEE Computer Society
ページ118-122
ページ数5
2015-April
ISBN(印刷版)9781479975815
DOI
出版ステータスPublished - 2015 4 13
イベント16th International Symposium on Quality Electronic Design, ISQED 2015 - Santa Clara, United States
継続期間: 2015 3 22015 3 4

Other

Other16th International Symposium on Quality Electronic Design, ISQED 2015
国/地域United States
CitySanta Clara
Period15/3/215/3/4

ASJC Scopus subject areas

  • ハードウェアとアーキテクチャ
  • 電子工学および電気工学
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「Tabu search based multiple voltage scheduling under both timing and resource constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル