講演抄録/キーワード |
講演名 |
2013-03-05 16:25
[記念講演]Network Simplex Method Based Multiple Voltage Scheduling in Power-Efficient High-Level Synthesis ○Cong Hao・Song Chen・Takeshi Yoshimura(Waseda Univ.) VLD2012-153 |
抄録 |
(和) |
In this work, we focus on the problem of latencyconstrained
scheduling with consideration of multiple voltage
technologies in High-level synthesis minimizing both power consumption
and resource usage. We first solve the problem with only
power optimization, and then minimize the power and resource
in a semi-simultaneous way. Without the resource concern, we
first propose an Integer Linear Programming (ILP) formulation.
It is further relaxed to a piecewise Linear Programming (LP)
problem and transferred to the mobility allocation problem, which
is optimally solved using the efficient piecewise-linear extended
network simplex method (PLNSM). It shows 80X+ speedup than
the general LP formulation. Considering the resource usage, we
propose a two-stage heuristic Network Simplex Method based
Power-efficient Multiple Voltage Scheduling (NPMVS) method.
Firstly, the above mobility allocation problem is extended to minimize
the power and to uniformly distribute the resource density
in each control step as well. The extended mobility allocation is
also solved by PLNSM and iteratively performed to minimize
the variation of resource densities. Secondly, with the allocated
operation mobilities, dependency-free operation scheduling is
applied to minimize the resource usage. Experimental results
show that the proposed NPMVS algorithm can produce optimum
solutions for all 6 benchmarks with 14 groups of data. The
maximum CPU time is 0.25 second under the FFT benchmark
with the mobility graph size of 122 vertices and 201 edges. |
(英) |
In this work, we focus on the problem of latencyconstrained
scheduling with consideration of multiple voltage
technologies in High-level synthesis minimizing both power consumption
and resource usage. We first solve the problem with only
power optimization, and then minimize the power and resource
in a semi-simultaneous way. Without the resource concern, we
first propose an Integer Linear Programming (ILP) formulation.
It is further relaxed to a piecewise Linear Programming (LP)
problem and transferred to the mobility allocation problem, which
is optimally solved using the efficient piecewise-linear extended
network simplex method (PLNSM). It shows 80X+ speedup than
the general LP formulation. Considering the resource usage, we
propose a two-stage heuristic Network Simplex Method based
Power-efficient Multiple Voltage Scheduling (NPMVS) method.
Firstly, the above mobility allocation problem is extended to minimize
the power and to uniformly distribute the resource density
in each control step as well. The extended mobility allocation is
also solved by PLNSM and iteratively performed to minimize
the variation of resource densities. Secondly, with the allocated
operation mobilities, dependency-free operation scheduling is
applied to minimize the resource usage. Experimental results
show that the proposed NPMVS algorithm can produce optimum
solutions for all 6 benchmarks with 14 groups of data. The
maximum CPU time is 0.25 second under the FFT benchmark
with the mobility graph size of 122 vertices and 201 edges. |
キーワード |
(和) |
High-Level Synthesis / Scheduling / Power-Efficient / Multiple Supply Voltage / / / / |
(英) |
High-Level Synthesis / Scheduling / Power-Efficient / Multiple Supply Voltage / / / / |
文献情報 |
信学技報, vol. 112, no. 451, VLD2012-153, pp. 93-98, 2013年3月. |
資料番号 |
VLD2012-153 |
発行日 |
2013-02-25 (VLD) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
VLD2012-153 |
|