A Parallel Simulated Annealing Approach for Floorplanning in VLSI

One of the critical issues in floorplanning is to minimize area and/or wire length of a given design with millions of transistors while considering other factors which may influence the success of design flow or even manufacturing. To deal with the floorplan design with enormous amount of interconnections and design blocks, we adopt a parallel computing environment to increase the throughput of solution space searching. Also, we include the fractional factorial analysis to further reduce the time needed to search the acceptable solution. The experimental results indicate that our approach can obtain better space utility rate and it takes less time than the traditional method and parallel method do.

[1]  Shankar Krishnamoorthy,et al.  Estimating routing congestion using probabilistic analysis , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Raymond Y. K. Lau,et al.  A Parallel Genetic Algorithm for Floorplan Area Optimization , 2007, Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007).

[3]  Sao-Jie Chen,et al.  Simultaneous routing and buffering in floorplan design , 2003, 2003 International Symposium on VLSI Technology, Systems and Applications. Proceedings of Technical Papers. (IEEE Cat. No.03TH8672).

[4]  Kyung-Geun Lee,et al.  Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains , 1996, IEEE Trans. Parallel Distributed Syst..

[5]  D. Janaki Ram,et al.  Parallel Simulated Annealing Algorithms , 1996, J. Parallel Distributed Comput..

[6]  Evangeline F. Y. Young,et al.  Congestion estimation with buffer planning in floorplan design , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[7]  Hsuan Ren,et al.  A simulated annealing band selection approach for hyperspectral imagery , 2006, SPIE Optics East.

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

[9]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

[10]  Ibrahim N. Hajj,et al.  Simulation and optimization of the power distribution network in VLSI circuits , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[11]  Hung-Ming Chen,et al.  Integrated power supply planning and floorplanning , 2001, ASP-DAC '01.

[12]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

[13]  Shinn-Ying Ho,et al.  An orthogonal simulated annealing algorithm for large floorplanning problems , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[14]  Sao-Jie Chen,et al.  Simultaneous routing and buffering in SOC floorplan design , 2004 .

[15]  Sao-Jie Chen,et al.  An Enhanced BSA for Floorplanning , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[16]  Hsuan Ren,et al.  A Simulated Annealing Feature Extraction approach for hyperspectral images , 2007, 2007 IEEE International Geoscience and Remote Sensing Symposium.

[17]  Yao-Wen Chang,et al.  B*-Trees: a new representation for non-slicing floorplans , 2000, DAC.

[18]  Enrique Alba,et al.  Heterogeneous Computing and Parallel Genetic Algorithms , 2002, J. Parallel Distributed Comput..