Building Block Layout by Parallel Simulated

The Building Block Layout (BBL) becomes a more and more important approach for VLSI physical design. In this paper, based on the BBL floorplan problem, we discussed several parallel Simulated Annealing (SA) strategies. Two parallel simulated annealing algorithms are realized, using sequence- pair (SP) as the representation. Parallel algorithm can be used either to speed up a problem or to achieve a higher accuracy of solutias to a problem. In this work we are interested in the latter goal. The results from the experiment indicate that the proposed method parallelizes the routine of state transitions in SA to obtain better states efficiently.

[1]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

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

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

[4]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

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

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