Thermodynamic Optimization of Block Placement

This paper presents the results of a systematic investigation of the thermodynamic ("simulated annealing") method applied to the placement of rectangular blocks on a chip. A new presentation of the fundamental ideas underlying this technique is proposed. It is shown that the analogies with physics, which have been at the origin of the method, may be partially forgotten, but that they are still useful to understand some results. Several simple examples are investigated, and the influence of various parameters is studied. Typical complex industrial applications are subsequently presented. Finally, an interactive implementation of the thermodynamic optimization algorithm, based on the results of the present investigation, is proposed.

[1]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[2]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[4]  G. Woodfin,et al.  An "Intelligent" Optical Design Program , 1984, Other Conferences.

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

[6]  Gérard Dreyfus,et al.  An application of physical methods to the computer aided design of electronic circuits , 1984 .

[7]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[8]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[11]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[12]  B. Gidas.  Nonstationary Markov chains and convergence of the annealing algorithm , 1985 .

[13]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[14]  Scott Kirkpatrick,et al.  Optimization by simulated annealing: Quantitative studies , 1984 .

[15]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

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

[17]  Ralph Linsker,et al.  An Iterative-Improvement Penalty-Function-Driven Wire Routing System , 1984, IBM J. Res. Dev..

[18]  E. Bonomi,et al.  The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .