Faster and more accurate wiring evaluation in interconnect-centric floorplanning

Hung-Ming Chen*, D. F. Wong, W. K. Mak, H. H. Yang

*此作品的通信作者

    研究成果: Conference article同行評審

    1 引文 斯高帕斯(Scopus)

    摘要

    In deep submicron (DSM) era, the communication between different components is increasing significantly. It is not uncommon to see floorplanning problems with a relatively small number of blocks (e.g., 50) but has a large number of nets (e.g. 20K). Since existing floorplanning algorithms use simulated annelaing which needs to examine a large number of floorplans, the increasing number of nets has made interconnect-centric floorplanning computaionally very expensive. Moreover, there is almost no systematic way to resolve the congestion problem in such magnitude of number of nets in a given floorplan. In this paper, we present a simple yet effective idea to significantly reduce the runtime of interconnect-centric florplanning algorithms. Our idea is to group common nets between two blocks into a single net. This faster wiring evaluation technique is very effective. We also present a more accurate global router for wiring evaluation based on Lagrangian Relaxation. The new router helps further congestion reduction while doing interconnect planning in floorplanning. We have incorporated our algorithms into [2] and observed dramatic improvement in runtime. For a 33-block 15K-net problem, we reduced runtime from over 23 hours to less than 50 minutes.

    原文English
    頁(從 - 到)62-67
    頁數6
    期刊Proceedings of the IEEE Great Lakes Symposium on VLSI
    DOIs
    出版狀態Published - 1 一月 2001
    事件11th Great Lakes Sysmposium on VLSI (GLSVLSI 2001) - West Lafayette, IN, United States
    持續時間: 22 三月 200123 三月 2001

    指紋

    深入研究「Faster and more accurate wiring evaluation in interconnect-centric floorplanning」主題。共同形成了獨特的指紋。

    引用此