A genetic approach to standard cell placement using meta-genetic parameter optimization

作者: K. Shahookar , P. Mazumder

DOI: 10.1109/43.55180

关键词: Mutation (genetic algorithm)Genetic algorithmAlgorithmCrossoverSimulated annealingPopulation-based incremental learningMutation operatorPremature convergenceComputer sciencePopulationMathematical optimizationLocal optimum

摘要: The genetic algorithm applies transformations on the chromosonal representation of physical layout. works a set configurations constituting constant-size population. are performed through crossover operators that generate new configuration assimilating characteristics pair existing in current Mutation and inversion also used to increase diversity population, avoid premature convergence at local optima. Due simultaneous optimization large population configurations, there is logical concurrency search solution space which makes an extremely efficient optimizer. Three techniques compared, parameters optimized for cell-placement problem by using meta-genetic process. resulting was tested against TimberWolf 3.3 five industrial circuits consisting 100-800 cells. results indicate placement comparable quality can be obtained about same execution time as TimberWolf, but needs explore 20-50 times fewer than does TimberWolf. >

参考文章(20)
Arnold C. Englander, Machine Learning of Visual Recognition Using Genetic Algorithms international conference on genetic algorithms. pp. 197- 201 ,(1985)
D. J. Smith, J. R. C. Holland, I. M. Oliver, A study of permutation crossover operators on the traveling salesman problem international conference on genetic algorithms. pp. 224- 230 ,(1987)
Ralph Michael Kling, Placement by Simulated Evolution Coordinated Science Laboratory, University of Illinois at Urbana-Champaign. ,(1987)
Brian J. Rosmaita, John J. Grefenstette, Dirk Van Gucht, Rajeev Gopal, Genetic Algorithms for the Traveling Salesman Problem international conference on genetic algorithms. pp. 160- 168 ,(1985)
Lawrence Davis, Job Shop Scheduling with Genetic Algorithms international conference on genetic algorithms. pp. 136- 140 ,(1985)
Stewart W. Wilson, Adaptive 'Cortical' Pattern Recognition international conference on genetic algorithms. pp. 188- 196 ,(1985)
Lawrence Davis, Applying adaptive algorithms to epistatic domains international joint conference on artificial intelligence. pp. 162- 164 ,(1985)
Irene Stadnyk, Schema recombination in pattern recognition problems international conference on genetic algorithms. pp. 27- 35 ,(1987)
A.E. Dunlop, B.W. Kernighan, A Procedure for Placement of Standard-Cell VLSI Circuits IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 4, pp. 92- 98 ,(1985) , 10.1109/TCAD.1985.1270101
M. Jones, P. Banerjee, Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube design automation conference. pp. 807- 813 ,(1987) , 10.1145/37888.38015