Reliability-constrained area optimization of VLSI power/ground networks via sequence of linear programmings
Authors:
- C.-J.R. ShiCSC.-J.R. Shi
- D. LungeanuDLD. Lungeanu
- Jyh-Chwen LeeJLJyh-Chwen Lee
- Li-Pen YuanLYLi-Pen Yuan
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 78-83
Abstract
This paper presents a new method for determining the widths of the power and ground routes in integrated circuits so that the area required by the routes is minimized subject to the reliability constraints. The basic idea is to transform the resulting constrained nonlinear programming problem into a sequence of linear programs. Theoretically, we show that the sequence of linear programs always converges to the optimum solution of the relaxed convex problem. Experimental results demonstrate that the sequence-of-linear-programming method is orders of magnitude faster than the best-known method based on conjugate gradients, with constantly better optimization solutions.Keywords
This publication has 7 references indexed in Scilit:
- Power and ground network topology optimization for cell based VLSIs2003
- Optimum design of reliable IC power networks having general graph topologies1989
- Optimum design of IC power/ground nets subject to reliability constraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Minimal area design of power/ground nets having graph topologiesIEEE Transactions on Circuits and Systems, 1987
- A survey of optimization techniques for integrated-circuit designProceedings of the IEEE, 1981
- Electromigration failure modes in aluminum metallization for semiconductor devicesProceedings of the IEEE, 1969
- A Nonlinear Programming Technique for the Optimization of Continuous Processing SystemsManagement Science, 1961