Loading...
Please wait, while we are loading the content...
Similar Documents
Multi-voltage floorplan design with optimal voltage assignment (2009).
| Content Provider | CiteSeerX |
|---|---|
| Author | Zaichen, Qian |
| Description | This content is published in ISPD'09 |
| Abstract | In this paper, we study the multiple voltage assignment (MVA) problem under timing constraints in floorplanning, which is generally an NP-hard problem. We will present an effective value-oriented branch-and-bound based algorithm to solve it optimally in a reasonable amount of time. A convex cost integer dual network flow approach is used to obtain a feasible upper bound solution, while a lower bound is obtained by a linear relaxation of a general formulation of the problem. We then adopt a value-oriented breadth-first branch-and-bound method with upper and lower bounds as described above to search for the optimal solution. Favorable results can be obtained in comparison with previous methods using a general linear programming solver. We integrate this algorithm into a multi-stage floorplanner. At the first stage, an initial floorplan is obtained by simulated annealing using the convex cost integer dual network flow approach as an evaluator. We then perform optimal voltage assignment to this initial floorplan. Finally, a post-processing step is done to modify the floorplan slightly to optimize the power network routing resource before invoking once more the optimal voltage assignment step at the end. Experimental results show that we can improve over the most updated work on this problem [7] by further reducing 6 % of power consumption while maintaining the performance on other factors |
| File Format | |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Conference Proceedings |
