A divide-and-conquer 2.5-D floorplanning algorithm based on statistical wirelength estimation

An efficient and effective divide-and conquer 2.5D floorplanning algorithm is proposed for wirelength optimization. Modules are pre-partitioned into different dies with respect to the statistical wirelength estimation result. Then a floorplan is generated on each die for wirelength optimization. The new partitioning method successfully solves the conflict between wirelength minimization and inter-die via constraints. Experimental results show that our algorithm could provide noticeable improvement in the total wirelength compared to both 2D design and the previous 2.5D floorplanning algorithm.

[1]  Andrew B. Kahng,et al.  On wirelength estimations for row-based placement , 1998, ISPD '98.

[2]  Kaushik Roy,et al.  Stochastic interconnect modeling, power trends, and performance characterization of 3-D circuits , 2001 .

[3]  A. Chandrakasan,et al.  Design tools for 3-D integrated circuits , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[4]  Nisha Checka,et al.  Technology, performance, and computer-aided design of three-dimensional integrated circuits , 2004, ISPD '04.

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

[6]  Kaustav Banerjee,et al.  3-D ICs: a novel chip design for improving deep-submicrometer interconnect performance and systems-on-chip integration , 2001, Proc. IEEE.

[7]  Yici Cai,et al.  Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[8]  A. Nahman,et al.  Wire-length distribution of three-dimensional integrated circuits , 1999, Proceedings of the IEEE 1999 International Interconnect Technology Conference (Cat. No.99EX247).

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