Optimization by simulated evolution with applications to standard cell placement

This paper presents a mathematical formulation of the Simulated Evolution algorithm, a novel optimization technique, followed by a thorough analysis of the associated Markovchain model. We show that the algorithm will reach a global minimum with probability one, and also introduce a novel hierarchical placement technique. Finally, we describe a Standard Cell placement program based on the new approach whose preliminary results are comparable to the best Simulated Annealing algorithms.

[1]  Sanjoy Mitter,et al.  Analysis of simulated annealing for optimization , 1985, 1985 24th IEEE Conference on Decision and Control.

[2]  James P. Cohoon,et al.  Genetic Placement , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Prithviraj Banerjee,et al.  ESP: A New Standard Cell Placement Package Using Simulated Evolution , 1987, 24th ACM/IEEE Design Automation Conference.

[4]  Yu-Chin Hsu,et al.  SILK: a simulated evolution router , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  J. Laurie Snell,et al.  Introduction to probability theory with computing , 1975 .

[6]  D. Mitra,et al.  Convergence and finite-time behavior of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  Carl Sechen,et al.  IMPROVED SIMULATED ANNEALING ALGORIHM FOR ROW-BASED PLACEMENT. , 1987 .

[9]  A. Sangiovanni-Vincentelli,et al.  The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.

[10]  Prithviraj Banerjee,et al.  ESp: Placement by simulated evolution , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Ernest S. Kuh,et al.  Proud: a fast sea-of-gates placement algorithm , 1988, DAC '88.

[12]  Youssef Saab,et al.  An Evolution-Based Approach to Partitioning ASIC Systems , 1989, 26th ACM/IEEE Design Automation Conference.