A multi-objective perspective for operator scheduling using finegrained DVS architectures

Mukherjee, Rajdeep ; Ghosh, Priyankar ; Dasgupta, Pallab ; Pal, Ajit (2013) A multi-objective perspective for operator scheduling using finegrained DVS architectures International Journal of VLSI Design & Communication Systems, 4 (1). pp. 105-122. ISSN 0976-1527

Full text not available from this repository.

Related URL: http://dx.doi.org/10.5121/vlsic.2013.4109

Abstract

The stringent power budget of fine grained power managed digital integrated circuits have driven chip designers to optimize power at the cost of area and delay, which were the traditional cost criteria for circuit optimization. The emerging scenario motivates us to revisit the classical operator scheduling problem under the availability of DVFS enabled functional units that can trade-off cycles with power. We study the design space defined due to this trade-off and present a branch-and-bound(B/B) algorithm to explore this state space and report the pareto-optimal front with respect to area and power. The scheduling also aims at maximum resource sharing and is able to attain sufficient area and power gains for complex benchmarks when timing constraints are relaxed by sufficient amount. Experimental results show that the algorithm that operates without any user constraint(area/power) is able to solve the problem for most available benchmarks, and the use of power budget or area budget constraints leads to significant performance gain.

Item Type:Article
Source:Copyright of this article belongs to Academy & Industry Research Collaboration Center.
Keywords:Scheduling; Pareto-optimal; Fine-grained DVS; Branch-and-Bound
ID Code:100855
Deposited On:12 Dec 2016 11:56
Last Modified:09 Mar 2018 10:17

Repository Staff Only: item control page