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 language | English |
---|---|
Title of host publication | Proceedings of International Conference on ASIC |
Publisher | IEEE Computer Society |
ISBN (Print) | 9781467364157 |
DOIs | |
Publication status | Published - 2013 |
Event | 2013 IEEE 10th International Conference on ASIC, ASICON 2013 - Shenzhen Duration: 2013 Oct 28 → 2013 Oct 31 |
Other
Other | 2013 IEEE 10th International Conference on ASIC, ASICON 2013 |
---|---|
City | Shenzhen |
Period | 13/10/28 → 13/10/31 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering