GENETIC SIMULATED ANNEALING AND APPLICATION TO NON-SLICING FLOORPLAN DESIGN

We propose a new optimization method, named genetic simulated annealing (GSA), which combines the local stochastic hill climbing features from simulated annealing (SA) and the global crossover operations from genetic algorithm (GA). We demonstrated the advantages of GSA by solving one of the most difficult problems in layout --- the non-slicing floorplan design problem. Given the same amount of computing resources, our experimental results showed that GSA consistently obtained better results than SA, in terms of both the chip area and the total wire length. We also applied GSA to timing driven floorplan design and experimental results indicated that it achieved the specified wire length bounds for the critical nets with small penalty on the chip area and the total wire length.

[1]  D. Adler,et al.  Genetic algorithms and simulated annealing: a marriage proposal , 1993, IEEE International Conference on Neural Networks.

[2]  J. Ben Rosen,et al.  An analytical approach to floorplan design and optimization , 1990, 27th ACM/IEEE Design Automation Conference.

[3]  Israel Koren,et al.  Analysis of strategies for constructive general block placement , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Pinaki Mazumder,et al.  A genetic approach to standard cell placement using meta-genetic parameter optimization , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[6]  Chang-Sheng Ying,et al.  An analytical approach to floorplanning for hierarchical building blocks layout [VLSI] , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Hironori Hirata,et al.  Floorplanning by Improved Simulated Annealing Based on Genetic Algorithm , 1992 .

[8]  Ernest S. Kuh,et al.  Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Stephen W. Director,et al.  Mason: A Global Floorplanning Approach for VLSI Design , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[12]  Thomas Lengauer,et al.  Robust and accurate hierarchical floorplanning with integrated global wiring , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Maciej J. Ciesielski,et al.  Digraph Relaxation for 2-Dimensional Placement of IC Blocks , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Cheng-Yan Kao,et al.  Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..

[15]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[16]  Hironori Hirata,et al.  Block placement by improved simulated annealing based on genetic algorithm , 1992 .

[17]  Dana S. Richards,et al.  Distributed genetic algorithms for the floorplan design problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[19]  Yen-Tai Lai,et al.  Algorithms for floorplan design via rectangular dualization , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..