Metraipolis › archive › dc_7ebcf605d6aa

Partitioning-free 3D-IC Floorplanning — arXiv:2609.13157

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13157
License (as archived)
CC0-1.0
Archived
2026-10-16T02:23:31.366Z
SHA-256 of the archived text
cf6e6e31265b2c2402257c1764e70d5bd67b56e817e4b71279615922a7295634
Stable URL of this page
https://metraipolis.com/documento/dc_7ebcf605d6aa

How to cite

Partitioning-free 3D-IC Floorplanning — arXiv:2609.13157 — arXiv (en), https://arxiv.org/abs/2609.13157 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7ebcf605d6aa (Metraipolis archive dc_7ebcf605d6aa, sha256 cf6e6e31265b2c2402257c1764e70d5bd67b56e817e4b71279615922a7295634)
BibTeX
@misc{dc7ebcf605d6aa,
  title = {Partitioning-free 3D-IC Floorplanning — arXiv:2609.13157},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13157},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7ebcf605d6aa; sha256 cf6e6e31265b2c2402257c1764e70d5bd67b56e817e4b71279615922a7295634},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13157. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

3D integration with fine-pitch hybrid bonding offers a promising path to alleviate interconnect bottlenecks in conventional two-dimensional (2D) ICs, yet efficient 3D floorplanning remains challenging due to the enlarged solution space and non-uniform inter-die communication latency. Existing methods either extend 2D representations into 3D, leading to combinatorial complexity, or adopt partitioning-first pipelines that fix block-to-die assignments early and hinder joint optimization of floorplan, die assignment, and vertical connectivity. In this work, we present \textsc{Great3D}, a partitioning-free 3D floorplanning framework that directly optimizes a native 3D floorplan. \textsc{Great3D} formulates a unified objective that couples interconnect cost with a cycles-per-instruction (CPI)-derived latency term to capture the system-level impact of face-to-face (F2F) bonding. Algorithmically, it combines an SDP-based 3D global embedding with a dynamic-programming refinement for die assignment, followed by 2D continuous refinement with practical design constraints. \textcolor{blue}{Experiments on the GSRC and ATPlace benchmark suites show that \textsc{Great3D} consistently achieves strong wirelength and CPI quality against state-of-the-art 3D floorplanners. On GSRC, it reduces total wirelength by up to about $70\%$ (and by $2.40$--$2.74\times$ on average) over competing 3D-native floorplanners, and its dynamic-programming die-assignment stage further improves CPI by $9.5$--$17.8\%$, while maintaining competitive runtime on instances of up to a few hundred blocks.}

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-15 in cs.ET).
Categorie arXiv: Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2609.13157 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T01:57:28.245Z dalla pagina https://arxiv.org/catchup/cs.ET/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).