

























Abstract:3D-IC netlist partitioning is commonly optimized using proxy objectives, while final PPA is treated as a costly evaluation rather than an optimization signal. This proxy-driven paradigm makes it difficult to reliably translate additional PPA evaluations into better PPA outcomes. To bridge this gap, we present DOPP (D-Optimal PPA-driven partitioning selection), an approach that bridges the gap between proxies and true PPA metrics. Across eight 3D-IC designs, our framework improves PPA over Open3DBench (average relative improvements of 9.99% congestion, 7.87% routed wirelength, 7.75% WNS, 21.85% TNS, and 1.18% power). Compared with exhaustive evaluation over the full candidate set, DOPP achieves comparable best-found PPA while evaluating only a small fraction of candidates, substantially reducing evaluation cost. By parallelizing evaluations, our method delivers these gains while maintaining wall-clock runtime comparable to traditional baselines.
| Subjects: | Machine Learning (cs.LG); Hardware Architecture (cs.AR) |
| Cite as: | arXiv:2604.18806 [cs.LG] |
| (or arXiv:2604.18806v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.18806 arXiv-issued DOI via DataCite (pending registration) |
From: Shang Wang [view email]
[v1]
Mon, 20 Apr 2026 20:24:36 UTC (1,633 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。