Multilevel large-scale modules placement with refined neighborhood exchange

Kuan Chung Wang*, Hung-Ming Chen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In SoC era, it is necessary to have a good and efficient large-scale modules placement for better performance estimation in chip implementation or rapid prototyping. Good representation for non-slicing floorplan/placement and ability to solve large-scale modules packing are Key components. MB*-tree [10] adopted very good and well-known representation B*-tree and modern multilevel framework to handle large-scale modules floorplanning/placement. However the simulated annealing approach in declustering stage paid more time to find candidate solutions with lower cost. In this paper, we transform the ε-neighborhood and λ-exchange [11] to fit in the large-scale modules placement and use it in the refinement stage of MB*-tree algorithm. The results are encouraging. We have obtained comparable or better results in area and wirelength metrics in less time spent (up to 30% improvement), compared with original MB*-tree framework.

Original languageEnglish
Title of host publication2006 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2006 - Proceedings of Technical Papers
Pages235-238
Number of pages4
DOIs
StatePublished - 1 Oct 2007
Event2006 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2006 - Hsinchu, Taiwan
Duration: 26 Apr 200728 Apr 2007

Publication series

Name2006 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2006 - Proceedings of Technical Papers

Conference

Conference2006 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2006
CountryTaiwan
CityHsinchu
Period26/04/0728/04/07

Fingerprint Dive into the research topics of 'Multilevel large-scale modules placement with refined neighborhood exchange'. Together they form a unique fingerprint.

Cite this