Via assignment algorithm for hierarchical 3D placement

Three-dimensional (3D) packaging technologies are now emerging to alleviate the interconnect delay problem, increase transistor packing density and reduce chip area. In 3D integration, vertical vias are utilized to realize interconnections between stacked layers. Route planning for these vertical wires by via assignment are of great importance for wirelength reduction, congestion alleviation and thermal optimization. Different via assignment algorithms are proposed for wirelength optimization. These methods are integrated in a hierarchical 3D design flow for mixed-mode placement (MMP). The experimental results show that total wirelength can be reduced by 8% with sacrifice on the runtime. Our algorithms are proved to be very effective and efficient.

[1]  Yangdong Deng,et al.  Interconnect characteristics of 2.5-D system integration scheme , 2001, ISPD '01.

[2]  Anantha Chandrakasan,et al.  Design tools for 3-D integrated circuits , 2003, ASP-DAC '03.

[3]  Yici Cai,et al.  A divide-and-conquer 2.5-D floorplanning algorithm based on statistical wirelength estimation , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[4]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[5]  Said F. Al-Sarawi,et al.  A Review of 3-D Packaging Technology , 1998 .

[6]  Vipin Kumar,et al.  Multilevel k-way hypergraph partitioning , 1999, DAC '99.

[7]  M. Ohmura,et al.  An initial placement algorithm for 3-D VLSI , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[8]  Yongqiang Lyu,et al.  Recursively combine floorplan and Q-place in mixed mode placement based on circuit's variety of block configuration , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).