Bipartition for 2.5-D floorplanning based on corner block list representation

This paper investigates a 3D die-stacking based VLSI integration strategy, so-called 2.5D integration, which can potentially overcome many problems stumbling the development system-on-chip (SoC), such as interconnect delay of monolithic problems due to scaling and increasing chip area. We present an approach using bipartitioning for 2.5D floorplanning based on corner block list representation. Experimental results show significant wirelength reduction compared to monolithic floorplanning.

[1]  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.

[2]  Jeff Parkhurst,et al.  SRC physical design top ten problem , 1999, ISPD '99.

[3]  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).

[4]  Maolin Tang,et al.  A Slicing Structure Representation for the Multi-layer Floorplan Layout Problem , 2004, EvoWorkshops.

[5]  Erich Barke,et al.  An upper bound for 3D slicing floorplans , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[6]  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).

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

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

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