This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors
January 1990 (vol. 1 no. 1)
pp. 91-106

A discussion is presented of two ways of mapping the cells in a two-dimensional area of a chip onto processors in an n-dimensional hypercube such that both small and large cell moves can be applied. Two types of move are allowed: cell exchanges and cell displacements. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support such a parallel cost evaluation. A novel tree broadcasting strategy is presented for the hypercube that is used extensively in the algorithm for updating cell locations in the parallel environment. A dynamic parallel annealing schedule is proposed that estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control. The performance on an Intel iPSC-2/D4/MX hypercube is reported.

[1] K. T. Tam, "Parallel processing for CAD applications,"IEEE Design Test, pp. 13-17, Oct. 1987.
[2] P. Banerjee, "The use of parallel processing for VLSI CAD applications: A tutorial," inProc. Int. Conf. Computer-Aided Design, Nov. 1988.
[3] B. T. Preas and P. G. Karger, "Automaticplacement a review of current techniques," inProc. 23rd Design Automat. Conf., 1986, pp. 622-629.
[4] M. Hanan and J. M. Kurtzberg, "Placement techniques," inDesign Automation of Digital Systems: Theory and Techniques, M. A. Breuer, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1972, pp. 213- 282.
[5] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing,"Science, vol. 220, pp. 671-680, May 1983.
[6] C. Sechen and A. Sangiovanni-Vincentelli, "TimberWolf3.2: A new standard cell placement and global routing package," inProc. 23rd Design Automation Conf., June 1986, pp. 432-439.
[7] M. D. Huang, F. Romeo, and A. Sangiovanni-Vincentelli, "An efficient general cooling schedule for simulated annealing," inProc. Int. Conf. Computer-Aided Design, Nov. 1986, pp. 381-384.
[8] C. Sechen and A. Sangiovanni-Vincentelli, "The TimberWolf placement and routing package," inProc. Custom Integrated Circuits Conf., May 1984, pp. 522-527.
[9] L. K. Grover, "A new simulated annealing algorithm for standard cell placement," inProc. Int. Conf. Computer-Aided Design, Nov. 1986, pp. 378-380.
[10] S. R. White, "Concepts of scale in simulated annealing," inProc. Int. Conf. Computer Design, Oct. 1984, pp. 646-650.
[11] D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, "Convergence and finite-time behavior of simulated annealing," inProc. 24th Conf. Decision Contr., Fort Lauderdale, FL., Dec. 1985.
[12] R. H. J. M. Otten and L. P. P. P. van Ginnekan, "Floor plan design using simulated annealing," inProc. Int. Conf. Computer-Aided Design, Nov. 1984, pp. 96-98.
[13] J. W. Greene and K. J. Supowit, "Simulated annealing without rejected moves," inProc. Int. Conf. Computer Design (ICCD84), Oct. 1984, pp. 658-663.
[14] M. Jones and P. Banerjee, "An improved simulated annealing algorithm for standard cell placement," inProc. Int. Conf. Computer Design, New York, NY, Oct. 1987, pp. 83-86.
[15] S. A. Kravitz and R. A. Rutenbar, "Multiprocessor-based placement by simulated annealing," inProc. 23rd Design Automat. Conf., June 1986, pp. 567-573.
[16] R. A. Rutenbar and S. A. Kravitz, "Layout by annealing in a parallel environment," inProc. Int. Conf. Computer Design, Oct. 1986, pp. 434-437.
[17] S. Kravitz and R. Ruttenbar, "Placement by Simulated Annealing on a Multiprocessor,"IEEE Trans. Computer-Aided Design, Vol. CAD-6, No. 4, July 1987, pp. 534-549.
[18] E.H.L. Aarts et al., "Parallel Implementations of the Statistical Cooling Algorithm,"Integration, Vol. 4, 1986, pp. 209-238.
[19] F. Darema and G. F. Pfister, "Multiple parallelism for VLSI CAD on the RP3,"IEEE Design and Test Computers, vol. 4, pp. 19-27, Oct. 1987.
[20] J. S. Rose, D. R. Blythe, W. M. Snelgrove, and Z. G. Vranesic, "Fast, high quality VLSI placement on a MIMD multiprocessor," inProc. Int. Conf. Computer-Aided Design, Nov. 1986, pp. 42-45.
[21] J. Rose, W. Snelgrove, and Z. Vranesic, "Parallel Standard Cell Placement Algorithms with Quality Equivalent to Simulated Annealing,"IEEE Trans. Computer-Aided Design, Vol. CAD-7, No. 3, Mar. 1988, pp. 387-396.
[22] P. Banerjee and M. Jones, "Parallel simulated annealing for standard cell placement on a hypercube computer," inProc. Int. Conf. Computer-Aided Design, Nov. 1986, pp. 34-31.
[23] M. Jones and P. Bannerjee, "Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube,"Proc. Design Automation Conf., 1987, pp. 807-813.
[24] J. Sargent and P. Banerjee, "A parallel row-based algorithm for standard cell placement with integrated error control," inProc. 26th Design Automation Conf., Las Vegas, NV, June 1989, pp. 590-594.
[25] A. Casotto and A. Sangiovanni-Vincentelli, "Placement of standard cells using simulated annealing on the connection machine," inProc. Int. Conf. Computer-Aided Design, Nov. 1987, pp. 350-353.
[26] C. P. Wong and R. D. Fiebrich, "Simulated annealing-based circuit placement on the connection machine system," inProc. Int. Conf. Computer Design, Oct. 1987, pp. 78-82.
[27] A. Casotto, F. Romeo, and A. Sangiovanni-Vincentelli, "A parallel simulated annealing algorithm for the placement of macro-cells," inProc. Int. Conf. on Computer-Aided Design, Nov. 1986, pp. 30-33.
[28] A. Casotto, F. Romeo, and A. Sangiovanni-Vincentelli, "A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells,"IEEE Trans. Computer-Aided Design, Vol. CAD-6, No. 5, Sept. 1987, pp. 838-847.
[29] R. Jayaraman and R. Rutenbar, "Floorplanning by annealing on a hypercube multiprocessor," inProc. Int. Conf. Computer-Aided Design, Nov. 1987, pp. 346-349.
[30] R. Arlauskas, "iPSC/2 System: A Second Generation Hypercube,"Proc. Third Conf. Hypercube Concurrent Computers and Applications, 1988, pp. 33-36.
[31] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[32] T. F. Chan and Y. Saad, "Multigrid algorithms on the hypercube multiprocessor,"IEEE Trans. Comput., vol. C-35, no. 11, pp. 969-977, Nov. 1986.
[33] N. Deo,Graph Theory with Applications to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1974.
[34] G. A. Geist and M. T. Heath, "Matrix factorization on a hypercube multiprocessor, " inProc. SIAM 1st Conf. Hypercube Multiprocessors, Knoxville, TN, Aug. 1985.
[35] Jonathan S. Turner, "Almost all k-colorable graphs are easy to color,"J. Algorithms, vol. 9, pp. 63-82, Mar. 1988.
[36] D. Brelaz, "New methods to color the vertices of a graph,"Commun. ACM, vol. 22, no. 4, pp. 251-256, 1979.
[37] J. S. Sargent, "A parallel row-based algorithm with error control for standard-cell placement on a hypercube multiprocessor, CSG Tech. Rep., Urbana, IL, July, 1988.
[38] C. Sechen and K. W. Lee, "An improved simulated annealing algorithm for row-based placement, " inProc. Int. Conf. Computer-Aided Design, pp. 478-481, Nov. 1987.
[39] B. Hajek, "A tutorial survey of theory and applications of simulated daAnnealing, " inProc. 24th Conf. Decision Contr., Fort Lauderdale, FL., Dec. 1985.
[40] M. D. Durand, "Parallel simulated annealing: Accuracy versus speed in placement,"IEEE Design and Test, pp. 8-34, June 1989.
[41] R. Jayaraman and F. Darema, "Error tolerance in parallel simulated annealing techniques, " inProc. Int. Conf. Computer Design, New York, NY, Oct. 1988, pp. 545-548.
[42] N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equations of state calculations by fast computing machines,"J. Chem. Physics, vol. 21, pp. 1087-1091, 1953.

Index Terms:
Index Termsmessage passing; distributed memory; simulated annealing; cell placement; hypercube multiprocessors; two-dimensional area; n-dimensional hypercube; cell exchanges; cell displacements; cost function; distributed data structure; parallel cost evaluation; tree broadcasting strategy; dynamic parallel annealing schedule; errors; synchronization; parallel algorithms; heuristic cell coloring; adaptive sequence control; Intel iPSC-2/D4/MX hypercube; circuit layout CAD; optimisation; parallel algorithms; performance evaluation
Citation:
P. Banerjee, M.H. Jones, J.S. Sargent, "Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 1, pp. 91-106, Jan. 1990, doi:10.1109/71.80128
Usage of this product signifies your acceptance of the Terms of Use.