Genetic Placement
- 1 November 1987
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 6 (6) , 956-964
- https://doi.org/10.1109/tcad.1987.1270337
Abstract
A placement algorithm, Genie, is presented for the assignment of modules to locations on chips. Genie is an adaptation of the genetic algorithm technique that has traditionally been a tool of the artificial intelligence community. The technique is a paradigm for examining a state space. It produces its solutions through the simultaneous consideration and manipulation of a set of possible solutions. The manipulations resemble the mechanics of natural evolution. For example, solutions are "mated" to produce "offspring" solutions. Genie has been extensively run on a variety of small test instances. Its solutions were observed to be quite good and in several cases optimal.Keywords
This publication has 8 references indexed in Scilit:
- Proceedings of the First International Conference on Genetic Algorithms and their ApplicationsPublished by Taylor & Francis ,2014
- The placement problem as viewed from the physics of classical mechanicsPublished by Association for Computing Machinery (ACM) ,1988
- Optimization of Control Parameters for Genetic AlgorithmsIEEE Transactions on Systems, Man, and Cybernetics, 1986
- The TimberWolf placement and routing packageIEEE Journal of Solid-State Circuits, 1985
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Module Placement Based on Resistive Network OptimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- Optimization by Simulated AnnealingScience, 1983
- A Review of the Placement and Quadratic Assignment ProblemsSIAM Review, 1972