Abstract
Face-to-face (F2F) stacked 3D IC is a promising alternative for scaling beyond Moore’s Law. In F2F 3D ICs, dies are connected through bonding terminals whose positions can significantly impact routing performance. Further, there exists resource competition among all the 3D nets due to the constrained bonding terminal number. In advanced technology nodes, traditional bonding terminal planning may also introduce legality challenges of bonding terminals, as the metal pitches can be much smaller than the sizes of bonding terminals. Previous works attempt to insert bonding terminals automatically using existing 2D commercial P&R tools and then consider inter-die connection legality, but they fail to take the legality and routing performance into account simultaneously. In this paper, we provide a novel bonding terminal assignment formulation for effective routing-aware bonding terminal planning. We explore the generalized assignment formulation and provide the routability guidance in our hybrid bonding terminal assignment problem. Our framework, BTAssign, offers a strict legality guarantee and an iterative solution. We provide two versions of the BTAssign framework, BTAssign-WL [1] and BTAssign-R, which BTAssign-R extends BTAssign-WL [1] by considering routability. The experiments are conducted on 18 open-source designs with various 3D net densities and the most advanced bonding scale. The results reveal that all the testing cases with different partitioning and placement strategies could gain benefits from our BTAssign framework.
Original language | English |
---|---|
Journal | ACM Transactions on Design Automation of Electronic Systems |
DOIs | |
Publication status | E-pub ahead of print - 6 Mar 2025 |
User-Defined Keywords
- 3D ICs
- Bonding Terminal Planning
- Routing
- Generalized Assignment Problem
- Divide and Conquer