An MCM/IC timing-driven placement algorithm featuring explicit design space exploration
Henrik Esbensen, E.S. Euh · 2002
A genetic algorithm for building-block placement of MCMs and ICs is presented which simultaneously minimizes layout area and an Elmore-based estimate of the maximum path delay while trying to meet a target aspect ratio. Explicit design space exploration is performed by using a vector-valued, S-dimensional cost function and searching for a set of distinct solutions representing the best tradeoffs of the cost dimensions. Designers can then choose from the output set of feasible solutions. In contrast to existing approaches such as simulated annealing, neither weights nor bounds are needed, thereby eliminating the inherent practical problems of specifying these quantities. Promising results are obtained for various placement problems, including a real-world MCM design.
Cited by 15 works. doi:10.1109/mcmc.1996.510790
Authors
References
- Genetic algorithms in search, optimization, and machine learning
- GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
- A New Algorithm for Floorplan Design
- Optimal orientations of cells in slicing floorplan designs
- AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING
- A New Algorithm for Floorplan Design
- Distributed genetic algorithms for the floorplan design problem
- Performance-driven placement of cell based IC's
- On area/depth trade-off in LUT-based FPGA technology mapping
- Optimal wire sizing and buffer insertion for low power and a generalized delay model