RITUAL: a performance driven placement algorithm for small cell ICs
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An efficient algorithm, RITUAL (residual iterative technique for updating all Lagrange multipliers), for obtaining a placement of cell-based ICs subject to performance constraints is described. Using sophisticated mathematical techniques, one is able to solve large problems quickly and effectively. The algorithm is very simple and elegant, making it easy to implement. In addition, it yields very good results, as is shown on a set of real examples. The algorithm was tested on the ISCAS set of logic benchmark examples using parameters for 1 mu m CMOS technology. On average , there is a 25% improvement in the wire delay for these examples compared to TimberWolf-5.6 with a small impact on the chip area.<>Keywords
This publication has 4 references indexed in Scilit:
- RITUAL: a performance driven placement algorithmIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- GORDIAN: VLSI placement by quadratic programming and slicing optimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Performance-driven constructive placementPublished by Association for Computing Machinery (ACM) ,1990
- Performance-driven placement of cell based IC'sPublished by Association for Computing Machinery (ACM) ,1989