betaFeedback

WorksComputer Science

CU-3D: A Scalable Legality-Aware RTL-to-GDS Flow for 3D-IC Physical Design

Abstract

Face-to-face (F2F) hybrid bonds shorten interdie connections, but data, clock, and power-grid (PG) connections must be realized together. CU-3D is a RTL-to-GDS physical design flow based on commercial EDA tools. It derives role-compatible hybrid-bond (HB) sites from a 17-metal ASAP7-based technology model, complete HB footprints, and constructed PG geometry. To coordinate partitioning with placement flexibility, Scaled refines an inherited 2D placement, whereas Fresh places the receiving die first and uses its pin locations and clock loads to guide placement of the other die. Data and clock HB assignments are jointly optimized while retaining alternative data sites and reserving capacity for subsequent PG assignment. The selected HB sites and stacks are preserved during 3D clock-tree synthesis, supply-aware cell insertion, and routing. Across eleven designs, including a 133-macro processor, the flow achieves zero backend DRC violations and passes signal-connectivity checks. Nine paired designs admit lower-footprint, lower-power implementations; four improve setup WNS. On JPEG, early joint planning gains 87 ps and mobility-aware partitioning gains 346 ps. Path analysis explains why cell-delay savings can outweigh net-delay increases.

Introduction

Face-to-face (F2F) hybrid bonding connects dies through their interconnect faces [3]. Submicron hybrid bonds (HBs) can replace long planar wires with short vertical connections [4]. The timing benefit depends on the wires from cell pins to the HB sites on both dies and on the clock paths to the launch and capture registers. Evaluating these effects requires a powered, clocked, and routed layout.

Prior work has developed methods for reusing 2D placement and routing engines [11, 15, 19], assigning nets to bonding sites [13, 20], synthesizing cross-die clock trees [12], and building power delivery networks [26]. These operations share physical resources. The constructed power grid (PG) can obstruct a DATA or CLOCK HB stack, and a DATA HB can occupy a site needed by a clock sink group. During clock-tree synthesis (CTS), a buffer placed in a legal row still needs continuous paths from both supply pins to the PG.

Figure 1 links planning to implementation: complete HB footprints must clear both dies’ obstructions, DATA and CLOCK HBs need distinct sites, and inserted buffers need connected VDD and VSS supplies. In (c), legal buffer placement does not ensure a ground connection.

Figure 1. Physical constraints that link early planning to downstream checks. (a) HB-PG conflict: PG overlaps the footprint, not its center. (b) HB-site conflict: DATA uu occupies CLOCK group gg's only site h1h_1; uu can move to h2h_2. Rectangles/dots: D flip-flops (DFFs)/clock pins. (c) PG connectivity: a macro interrupts M1 rails (solid); BUF's VSS rail is disconnected from M3 (dashed). Dots: layer connections. Filled/open timeline markers: planning/violation checks.

We present CU-3D, a legality-aware RTL-to-GDS physical design flow built on commercial EDA tools. CU-3D derives HB-site capacity from the constructed PG and uses placement information to allocate that capacity before CTS and routing. Its contributions are:

  • HB-site screening. CU-3D checks complete HB footprints on both dies and uses same-supply metal on both dies to identify candidate PG HB sites.

  • Partitioning and placement. Local area bounds support 2D placement reuse, while tier-wide bounds support top-die-first re-placement. In re-placement, top-die pin locations and clock loads guide provisional HB assignment and bottom-die placement.

  • Joint DATA/CLOCK HB assignment. CU-3D can reassign DATA HBs to accommodate CLOCK HBs while reserving capacity for subsequent PG HB assignment.

  • CTS, PG, and routing. CU-3D synthesizes the top-die clock subtrees before the bottom-die tree, checks supply access and

This work is licensed under a Creative Commons Attribution 4.0 International License.

ASPDAC ’27, Tokyo, Japan

© 2027 Copyright held by the owner/author(s).

ACM ISBN 979-8-4007-2923-2/2027/01

https://doi.org/10.1145/3840404.3860937 PG: constructed power grid; –: unspecified scope. MoL/LoL: memory-/logic-on-logic. DRC counts use each work’s backend checks.

connectivity for inserted cells, and preserves the selected HB sites and stacks through routing.

All ten post-route layouts, including a 133-macro processor, have zero backend design-rule violations and pass signal-connectivity checks.

Related Work

Reuse of 2D design tools. Shrunk-2D [15] scales cell and interconnect geometries to obtain a 2D placement for tier partitioning. Compact-2D [11] scales interconnect RC parasitics, contracts the resulting layout to the F2F footprint, and optimizes the design after partitioning. Snap-3D [19] contracts cell heights and encodes tiers as placement rows so that a commercial 2D placer can place cells across tiers. Cascade2D [2] and Pin-3D [17] address monolithic 3D physical synthesis, with Pin-3D supporting timing optimization across dies. Macro-3D [1] targets heterogeneous macro-on-logic F2F designs.

HB assignment, clocking, and power delivery. BTAssign [13] performs routing-aware assignment to legal HB sites. AnchorGrid [20] represents cross-die nets with paired anchor cells that can move during pre-route timing optimization and are later assigned to a bonding grid. Kim and Park [10] address fine-pitch HB assignment in a unified flow for homogeneous and heterogeneous integration. Jiang et al. [9] account for HB terminal demand during partitioning. FlexiCTS [12] coordinates clock buffer placement and HB allocation, while DPO-3D [26] and Zhu et al. [24] address power delivery. Related timing methods target early-stage timing prediction [22], timing-driven F2F placement [7], and concurrent clock–data optimization [6].

Implementation flows and benchmarks. Hetero-3D [23] integrates mixed-node floorplanning and power delivery. Patnaik et al. [16] report DRC-clean F2F layouts that use redistribution layers. Open3DFlow [14, 25] provides an open-source 3D design platform, and Open3DBench [18] supports evaluation from partitioning and placement through routing, RC extraction, and thermal analysis. RosettaStone [8] addresses reproducibility in physical design benchmarking.

Table 1 summarizes the structures implemented and checks reported by representative methods. CU-3D derives legal HB sites from the constructed power grid, assigns DATA and CLOCK HBs jointly while reserving capacity for PG HBs, and checks VDD/VSS access and connectivity when inserting cells. The assembled post-route

MethodInterface representationClock constructionPGMacrosReported DRC
Shrunk-2D [15]Monolithic 3D / MIVs2D CTS, tier split–Yes–
Compact-2D [11]Combined metal stack2D CTS, tier split–Yes–
Snap-3D [19]Tier rows / F2F viasCombined CTS–Yes–
Macro-3D [1]Macro-on-logicMeasured clock tree–Yes–
Hetero-3D [23]Mixed-node F2FCTSBuiltYes–
BTAssign [13]Legal HB mesh––––
FlexiCTS [12]HBT allocationCPPR-aware 3D CTS–––
AnchorGrid [20]Pad arrayRoot-balanced––224 (CPU2)
Open3DBench [18]Vias / virtual HBsMoL: CTS; LoL: ideal–Yesnot clean (LoL)
DPO-3D [26]F2F power network–Built–not clean
CU-3DHB + local-via stacksTOP then BOTTOMBuilt0–1330 (10 layouts)

Table 1. What representative 3D methods physically build and check.

layout is then checked for design-rule violations and connectivity with the routed clock trees, PG, and HB stacks in place.

Flow Overview

Figure 2 outlines CU-3D. Reference 2D placement and CTS measure timing and cell-area overhead.

CU-3D flow

Figure 2. CU-3D flow. Colors identify method chapters; gray marks shared steps. Provisional HBs use initial candidate sites; final assignment follows PG updates and HB-site re-screening. Dashed GDSII export requires complete stream and cell views.

F2F rules and HB-site screening check complete HB footprints against both dies’ geometry.

Partitioning and placement assign macros and cells to tiers. 2D placement reuse legalizes scaled reference coordinates; tier re-placement uses TOP pins and loads to guide provisional HBs and BOTTOM placement. Both update pins and PG before final HB-site screening.

Joint HB assignment selects DATA/CLOCK HBs jointly, then PG HBs at remaining legal sites. DATA includes control/I/O; PG connects VDD/VSS across dies. CTS, PG, and routing construct HBs, perform TOP-first CTS and PG-constrained cell insertion, then route and check the assembled layout. Post-route results include backend DRC, signal/PG connectivity, worst negative slack (WNS), and total negative slack (TNS).

F2F Rules and HB-Site Screening

F2F Technology Model

CU-3D uses an ASAP7-based technology model to screen candidate HB sites for spacing, enclosure, and access [5, 21]. The dies share an XY coordinate system and database, with separate routing layers and explicit cross-die nets in the timing graph. Figure 3(a) shows twelve intra-die and five interface metal layers; (b) shows HB geometry. TOP cell views map local M1–M6 to M12–M7 while retaining pin XY geometry. Layer order, preferred routing and PG directions, and instance orientation are specified separately.

Figure 3. F2F technology model. (a) F2F stack: layer order, preferred horizontal/vertical (H/V) routing, and minimum widths. DATA/CLOCK and PG use five and two local vias (squares), respectively, plus one HB (diamond) each. (b) HB geometry: XY cut, body, and clearance footprint. Dimensions use the 4× model except nominal pitch; vertical spacing is schematic.

DATA/CLOCK connects M6 to M7 through five local vias and one HB; PG connects B_TM2 to T_TM2 through two local vias and one HB. Both TM2 layers carry horizontal interface PG rails. Intra-die BOTTOM routing uses M2–M6 (three horizontal, two vertical layers); TOP uses M7–M11 (three vertical, two horizontal), with cell-pin access on M1 and M12, respectively. Vertical routing on BOTTOM and horizontal routing on TOP therefore have fewer intra-die routing layers, motivating direction-specific congestion analysis.

Rail widths and via enclosures set the required PG clearances. Final HB-site screening therefore uses the updated PG geometry. HB-interface timing arcs preserve driver-to-sink connectivity, and post-route RC extraction captures the realized interdie stack and the intra-die wires on both dies.

HB-Site Screening

Within the common die outline, grid H\mathcal{H} contains points ϕ+(kpx,lpy)\phi+(kp_x,lp_y), where ϕ\phi is its XY origin, px,pyp_x,p_y are pitches, and k,lk,l are integer indices. At site hh, HB type ρ\rho requires Fρ(h)∩Oρ=∅F_{\rho}(h) \cap O_{\rho} = \varnothing: its complete footprint Fρ(h)F_{\rho}(h) must avoid the applicable obstacle set OρO_{\rho}, including die boundaries, both dies’ macro-access exclusions, and PG clearances (Figure 4(a)). PG stripes can remove DATA/CLOCK eligibility while supplying power landings. For two-sided PG landing on supply net n∈{VDD,VSS}n \in\{\mathrm{VDD},\mathrm{VSS}\},

Figure 4. Physical design constraints. (a) HB-site screening against BOTTOM (B), TOP (T), and PG. (b) Two-sided PG landing on same-supply metal. (c) HB capacity and matching: S/PS/P denote DATA/CLOCK- and PG-compatible sets. (d) Placement and access: cell placement, HB access, and cell insertion use different constraints.

Pn⊆H∩(LBn⊖EB)∩(LTn⊖ET).(1)\mathcal{P}_{n} \subseteq\mathcal{H} \cap(L_{B}^{n} \ominus E_{B}) \cap(L_{T}^{n} \ominus E_{T}). \tag*{(1)}

Here Pn\mathcal{P}_{n} is the set of legal PG HB sites for supply net nn, and B/TB/T denote BOTTOM/TOP. The landing regions LBn,LTnL_{B}^{n},L_{T}^{n} contain metal for the same supply on the two dies. The erosion operator ⊖\ominus shrinks each region by its enclosure footprint (EBE_{B} or ETE_{T}), leaving candidate HB centers (Figure 4(b)). Clearance from the opposite supply and containment of the complete stack further restrict the intersection.

HB Capacity and Matching

Let S\mathcal{S} be DATA/CLOCK-compatible sites and P=⋃nPn\mathcal{P} = \bigcup_n \mathcal{P}_n. Physical capacity and capacity after reservation are

Cphys=∣S∪P∣,Calloc=⌊(1−γ)Cphys⌋+g.(2)C_{\mathrm{phys}} = \lvert\mathcal{S} \cup\mathcal{P} \rvert,\qquad C_{\mathrm{alloc}} = \lfloor(1-\gamma)C_{\mathrm{phys}}\rfloor+ g. \tag*{(2)}

Here ∣⋅∣\lvert\cdot\rvert counts distinct sites, 0≤γ≤10 \le\gamma\le1 is the reserved fraction, and gg an integer guard capacity, with 0≤g≤Cphys−⌊(1−γ)Cphys⌋0 \le g \le C_{\mathrm{phys}}-\lfloor(1-\gamma)C_{\mathrm{phys}}\rfloor. CU-3D deducts the reserve once, after obstacle filtering. To release capacity, it verifies that DATA and CLOCK HBs occupy distinct sites in S\mathcal{S} and that their total count plus the required PG minimum fits within CphysC_{\mathrm{phys}}. PG requests must also match distinct eligible sites. The assignment enforces CLOCK-count bounds and the PG minimum against the same site pool. For a subset U′\mathcal{U}' of fixed one-HB requests, let N(U′)N(\mathcal{U}') be their eligible-site union. Even with sufficient total capacity, ∣N(U′)∣<∣U′∣\lvert N(\mathcal{U}')\rvert< \lvert\mathcal{U}'\rvert prevents matching these requests to distinct sites (Figure 4(c)).

Partitioning and Placement

Macro Partitioning and Placement

CU-3D automatically partitions and places macros: connectivity and area constraints guide tier assignment, followed by bounded, legal shifts of each tier’s macro group. These rigid shifts increase cross-tier overlap of macro obstructions and HB clearances in the common XY plane, reducing the combined area unavailable to HBs. Macro dimensions, orientations, and internal pin, obstruction, and supply-rail geometry remain unchanged.

Available standard-cell area excludes same-tier blockages; HB sites must avoid both tiers’ obstructions. Figure 4(d) distinguishes placement and access: a BOTTOM macro can lie below a legal TOP cell yet block an HB. Cell insertion additionally requires VDD/VSS and signal-pin access.

Placement refinement accounts for connections between macro pins and surrounding standard cells on the complete netlist. In a separate local refinement study using pin capacitance and estimated wirelength, matched-pin distances decreased but pre-CTS WNS worsened by 12.4 ps on BOTTOM and 27.9 ps on TOP. Shorter connections alone do not ensure better timing.

Tier Partitioning

Partitioning uses local area bounds within the reference 2D placement bins for 2D placement reuse, and die-wide bounds for tier re-placement. For total standard-cell area AbA_b in region bb and usable tier areas Cb,BC_{b,B}, Cb,TC_{b,T}, the area assigned to BOTTOM, Ab,BA_{b,B}, must satisfy

max⁡(0,Ab−Cb,T)≤Ab,B≤min⁡(Ab,Cb,B)(3)\max(0, A_b - C_{b,T}) \le A_{b,B} \le\min(A_b, C_{b,B}) \tag*{(3)}

Tier-wide bounds allow cells to move across their original placement bins, so local balance need not split connected logic clusters. Fixed macros, placement rows, and access exclusions still limit usable area. Legalization and PG-access checks enforce these constraints at individual cell locations.

The partitioner compares HB-count violations, area-limit violations, non-CLOCK crossing demand, local area imbalance, and weighted cost, in that priority order. Lower-priority criteria break ties in higher-priority criteria. The final cost is

J=∑e:neHB>0(we+wet−wec+wHBneHB).(4)J = \sum_{e:n_e^{\mathrm{HB}}>0} \left(w_e + w_e^{t} - w_e^{c} + w_{\mathrm{HB}} n_e^{\mathrm{HB}}\right). \tag*{(4)}

For each crossing net ee, wew_e is the base cut weight, wetw_e^{t} is the timing-criticality penalty mapped to the partitioning netlist, wecw_e^{c} is the congestion discount, and wHBw_{\mathrm{HB}} is the per-HB weight. Its driver, direction, and net class determine the required HB count neHBn_e^{\mathrm{HB}}. This priority order favors resolving HB and area-limit violations over reducing JJ.

2D Placement Reuse

In 2D placement reuse, CU-3D scales reference coordinates, not cell or macro dimensions (Figure 5(a)). It legalizes cells in each tier’s rows, then locally refines placement on the full two-die netlist. Updated pin locations guide provisional HB reassignment within the fixed partition. Tight local area bounds can split connected clusters, increasing DATA crossings and consuming CLOCK-compatible sites. CU-3D reserves whitespace for the cell-area increase measured in the 2D CTS reference. DATA reassignment and candidate expansion resolve site conflicts while preserving capacity for PG HBs. Unlike 2D placement reuse, tier re-placement does not retain the reference 2D cell arrangement.

Figure 5. Placement and DATA reassignment. (a) 2D placement reuse changes XY seeds, not cell dimensions. (b) Tier re-placement: place TOP, read pins/loads, assign provisional HBs, place BOTTOM, refine tiers (5a/5b), update pins/loads/PG (6); T/B: TOP/BOTTOM. (c) DATA reassignment moves u1u_1 to admit CLOCK group g1g_1, retaining u2u_2, g2g_2, and a PG option; hih_i: site ii.

Tier Re-placement

Tier re-placement recomputes standard-cell locations within each assigned tier. The TOP-first schedule uses TOP pin locations and clock-sink loads to guide HB assignment and BOTTOM placement, with BOTTOM macros and I/O fixed (Figure 5(b)).

Steps 1–2 place TOP with unplaced BOTTOM cells temporarily disconnected, preserving macros, I/O, and PG-access reservations. Restoring connectivity yields TOP pin locations/capacitances and fixed BOTTOM macro/I/O pins. Steps 3–4 jointly assign provisional DATA/CLOCK HBs from the initial site inventory, excluding macro keepouts and retaining DATA candidates and PG capacity, then place BOTTOM toward these sites with TOP fixed.

Steps 5–6 refine BOTTOM then TOP on the complete netlist, fixing the other die, macros, HB interfaces, and PG-access reservations. Updated pin locations, loads, routing estimates, and PG geometry guide final HB-site screening and assignment. Costs account for pin spans, timing criticality, and displacement; timing analysis evaluates both dies’ wires after each HB move.

Joint HB Assignment

Joint HB Assignment Formulation

CU-3D jointly assigns DATA and CLOCK HBs to legal sites, allowing at most one HB per site and reserving capacity for subsequent PG HB assignment. A CLOCK candidate a=(d,s,h,Ga)a=(d,s,h,G_a) specifies a clock domain dd, a source ss, an HB site hh, and a sink set GaG_a. CU-3D screens candidates for fanout, diameter, reach, latency, skew, and capacitive load, estimated for direct fanout as

C^a=∑i∈GaCi+cw∑i∈Ga∥pi−h∥1.\widehat{C}_a = \sum_{i\in G_a} C_i + c_w \sum_{i\in G_a} \lVert p_i-h\rVert_1.

Here Ci,piC_i,p_i are sink ii’s current capacitance and XY location; hh also denotes the site’s XY location. The coefficient cwc_w is wire capacitance per unit length, and ∥⋅∥1\lVert\cdot\rVert_1 denotes Manhattan distance. Buffered-tree estimates include buffer input loads and branch lengths. Each DATA request uu needs one HB; its candidate set HuH_u retains the baseline site if legal. Binary variables xax_a and yu,hy_{u,h} select CLOCK candidate aa and assign DATA request uu to site hh, respectively. Writing h(a)h(a) for candidate aa’s site and setting yu,h=0y_{u,h}=0 outside HuH_u, we require

∑a:i∈Gaxa=1∀i,(5)\sum_{a:i\in G_a} x_a = 1 \quad\forall i, \tag*{(5)}
∑h∈Huyu,h=1∀u,(6)\sum_{h\in H_u} y_{u,h} = 1 \quad\forall u, \tag*{(6)}
∑a:h(a)=hxa+∑uyu,h≤1∀h.(7)\sum_{a:h(a)=h} x_a + \sum_u y_{u,h} \le1 \quad\forall h. \tag*{(7)}

Equations (5)–(7) cover each clock sink ii once, assign each DATA request uu once, and allow one occupant per physical site hh. The exact mixed-integer linear programming (MILP) mode applies CLOCK-count and regional limits, then prioritizes deviation of the selected CLOCK-HB count from its configured target, CLOCK timing, timing-critical DATA, remaining DATA, and control/I/O costs.

Joint HB Assignment Algorithm

DATA reassignment. With identical CLOCK choices and constraints, feasible sets Ffixed\mathcal{F}_{\mathrm{fixed}} (fixed DATA) and Fjoint\mathcal{F}_{\mathrm{joint}} (movable DATA) satisfy Ffixed⊆Fjoint\mathcal{F}_{\mathrm{fixed}}\subseteq\mathcal{F}_{\mathrm{joint}} when every legal DATA baseline is retained. Setting yu,baseline(u)=1y_{u,\mathrm{baseline}(u)}=1, where baseline(u)\mathrm{baseline}(u) is uu’s retained site, recovers each fixed solution. Solver mode governs how the enlarged feasible set is searched.

Figure 5(c) contrasts DATA fixed and DATA reassigned. Its CLOCK groups g1,g2g_1,g_2 define candidate sink sets GaG_a. Moving DATA u1u_1 from h1h_1 to h2h_2 frees the only site for g1g_1; g2g_2 and u2u_2 retain h3h_3 and h4h_4. Site h6h_6 remains available for subsequent PG HB assignment. The requests and site pool are unchanged.

Algorithm 1 Joint DATA/CLOCK and subsequent PG HB assignment

Input: Legal sites, pin locations/capacitances, demand, limits

  1. Build CLOCK/DATA candidate graph; retain legal baselines

  2. Select size-adaptive mode; solve sink coverage and site occupancy

  3. In spatial matching, add legal candidates and rematch

  4. If incomplete, report unmet constraints or a search limit

  5. Enforce capacity/count limits; assign PG HBs to remaining sites

  6. return Feasible assignment or failed condition

Solver selection. Algorithm 1 jointly selects CLOCK candidates and DATA sites. By model size, CU-3D selects exact MILP with ordered objective priorities, search-limited MILP, or spatial grouping with sparse site matching. Search-limited MILP fixes the target CLOCK count and retains legality constraints. For fixed CLOCK groups, spatial matching traces alternating paths from unmatched requests to a subset U′U' with ∣N(U′)∣<∣U′∣|N(U')| < |U'|; it adds legal candidate sites and rematches. The solver distinguishes proven infeasibility from an incomplete search.

PG HB Assignment

Joint DATA/CLOCK assignment reserves capacity for PG HBs. PG HB assignment then matches supply requests to distinct unoccupied legal sites within regional and distance limits. Let NDN_D, NCN_C, NPN_P count assigned DATA, CLOCK, and PG HBs, respectively, and let NP,min⁡N_{P,\min} be the required PG count. An accepted assignment must satisfy ND+NC+NP≤CallocN_D + N_C + N_P \le C_{\mathrm{alloc}} and NP≥NP,min⁡N_P \ge N_{P,\min}. Each PG HB connects the same supply on both dies.

CTS, PG, and Routing

HB Construction

HB construction preserves assigned locations, orientations, pins, and conductor stacks. Interface cells connect SRC/Y to DST/A through an interdie net; SRC/A and DST/Y connect upstream/downstream. PG stacks join same-supply landings. Routing may refine tier-local pin-to-HB wires while preserving HB geometry, connectivity, and TOP clock routes (Figure 6(a)).

Figure 6. CTS, PG, and routing. (a) HB construction: interdie net SRC/Y–DST/A. (b) TOP-first CTS: synthesize TOP subtrees and check latency ℓg\ell_g/skew σg\sigma_g, then synthesize BOTTOM. (c) PG-constrained cell insertion: intersect row-legal origins R\mathcal{R} with supply-access origins IVDD,IVSSI_{\mathrm{VDD}}, I_{\mathrm{VSS}} to obtain D\mathcal{D}. (d) Routing and checks in one database. Dashed: GDSII export with complete stream and cell views.

TOP-First CTS

The BOTTOM clock tree drives TOP subtrees through CLOCK HBs. CTS builds TOP first, with each subtree rooted at DST/Y. For group gg, ℓg\ell_g is the longest root-to-sink delay and σg\sigma_g the longest-minus-shortest delay (Figure 6(b)). These measurements, load, and geometry determine acceptance. Failed checks permit one replan: exclude the failed CLOCK-HB site, recompute the joint plan, and rebuild subtrees. BOTTOM CTS uses their delays on the full clock netlist, preserving TOP subtrees and HB interfaces.

For launch register ii and capture register jj, let δLi,δLj\delta L_i,\delta L_j denote clock-latency changes. With other terms fixed, setup/hold slack changes are

Δi→jsetup=δLj−δLi,Δi→jhold=δLi−δLj.(8)\Delta_{i\to j}^{\mathrm{setup}}=\delta L_j-\delta L_i,\qquad\Delta_{i\to j}^{\mathrm{hold}}=\delta L_i-\delta L_j. \tag*{(8)}

In register chain i→j→ki \to j \to k, delaying jj helps incoming setup but hurts outgoing setup; a shared branch affects every descendant. Physical sizing also changes upstream load and slew. Skew optimization must therefore evaluate all affected incoming and outgoing paths, including hold, in the complete clock graph rather than optimize each TOP subtree independently.

PG-Constrained Cell Insertion

Clock buffers and other standard cells added during timing optimization need legal VDD and VSS connections. For a candidate cell and orientation in row rr, let R(r)\mathcal{R}(r) be legal cell-origin positions and IVDD(r),IVSS(r)I_{\mathrm{VDD}}(r), I_{\mathrm{VSS}}(r) the positions with legal local supply access. The insertion domain is D(r)=R(r)∩IVDD(r)∩IVSS(r)\mathcal{D}(r)=\mathcal{R}(r)\cap I_{\mathrm{VDD}}(r)\cap I_{\mathrm{VSS}}(r), with signal-pin access additionally required. Fixed placeholders and placement blockages reserve power-access space (Figure 6(c)). Local pin access does not imply PG connectivity: a contacted rail may remain disconnected.

Routing and Checks

Routing obeys tier-specific layer ranges around assigned HB stacks and PG (Figure 6(d)). Final checks evaluate backend DRC, signal/PG connectivity, HB-stack integrity, and clock-sink coverage in the assembled post-route database, followed by layout reload and recheck in a new Innovus session. Timing-coverage, setup/hold, and electrical-constraint reports remain separate. GDSII export uses complete stream and cell views.

Experimental Evaluation

Setup

Ten designs cover logic and macro-rich processors: Rocket, JPEG, RISC-V32i, AES, Dynamic, Mini, s35932, gcd, Ariane133, and Swerv. Synopsys Design Compiler and Cadence Innovus implement the designs on the ASAP7-based F2F model at TT, 0.70 V, 25 °C. Nominal lengths and areas divide the 4× model values by 4 and 16; nominal HB pitch is 0.5 μm. Both 2D and 3D flows use placement optimization, CCOpt, post-CTS setup optimization, timing-driven routing, and post-route setup optimization. Reported timing uses RC parasitics extracted from the routed layout.

We compare 2D placement reuse and tier re-placement. JPEG variants change tier placement order and HB assignment, not TOP-first CTS. Backend DRC and connectivity checks use assembled post-route databases. Footprint is per die; power uses recorded activity. Wirelength sums routed segments: nominal mm for the 2D/3D PPA comparison, and 10310^3 model μm for JPEG variants (each unit equals 0.25 nominal mm). Layouts use final DEF coordinates and LEF dimensions; supply HB centers are checked against VDD/VSS nets.

Post-Route Layouts and PPA

All ten post-route designs have zero backend DRC violations and pass signal-connectivity checks; these checks include clock trees, PG, and HB stacks. Figure 7 shows four representative layouts.

Post-route layouts for JPEG, RISC-V32i, Swerv, and Ariane133, showing bottom and top dies

Figure 7. Post-route layouts: HB centers and selected PG centerlines. BOTTOM/TOP scales match within each column. Our flow can guarantee the generated layout is DRC-clean and passes connectivity checks in the post-route implementation database.

The layouts span 0–133 macros. Swerv has 3,544 DATA/CLOCK and 6,302 PG HBs (9,846 total), plus 56 macro PG terminals; Ariane133 has 4,379 DATA/CLOCK and 7,218 PG HBs (11,597 total). HBs are counted once across dies; macro PG terminals are not extra HBs. Both designs pass signal/PG connectivity. Swerv’s tall macros narrow channels; Ariane’s banks distribute access boundaries.

Each row uses one implementation. Cell/net shares pool its 20 lowest-slack data paths; cell delay includes clock-to-output.

Table 2 shows five 2D/3D comparisons improving reported setup WNS, per-die footprint, and tool-reported power. With 2D reuse, Rocket/Mini gain 18/22 ps and AES reaches zero; re-placement gains 28 ps for s35932 and 1 ps for Ariane133 at the reported precision. Rocket/Mini improve WNS but worsen TNS across setup endpoints. WNS measures the worst endpoint; TNS captures the aggregate setup deficit. Mini improves WNS with 11.0% less routed wirelength. AES and s35932 also improve WNS, with 3.9% and 15.4% more wirelength, respectively. These aggregate results do not isolate which physical changes improve timing.

DesignPlacementWNS (ns)TNS (ns)PP (mW)AA (μm2\mathrm{\mu m}^{2})WL (mm)Cell (%)Net (%)
Rocket2D-0.428-321.40042.4135,971.3204.5664.036.0
2D reuse-0.410-455.57337.1123,843.0203.7964.135.9
AES2D-0.003-0.0056.9111,672.547.3186.313.7
2D reuse0.0000.0006.5731,060.349.1687.512.5
Mini2D-0.290-38.10912.1542,218.962.3575.424.6
2D reuse-0.268-51.34010.2941,404.555.5076.923.1
s359322D0.0230.0006.7831,315.517.0778.221.8
Re-placement0.0510.0005.851797.619.6961.438.6
Ariane1332D-2.877-10,388.600233.44571,074.41,632.5138.161.9
Re-placement-2.876-18,240.000215.13142,640.61,489.8337.162.9

Table 2. 2D/3D PPA and top-20 path composition. PP: tool-reported power; AA: per-die footprint; WL: wirelength.

Critical-Path Delay Analysis

We independently select each 2D/3D report’s 20 lowest-slack paths. Data delay comprises cell delay (including clock-to-output) and net delay, excluding clock latency and input arrival. Shares use pooled delays. Mini/AES reduce mean data delay by 56.2/19.7 ps; Ariane remains net-dominated in 2D/3D (61.9%/62.9% of data delay). For matched comparisons, we select the connection with the lowest 2D slack present in both reports. Matches require identical start/end pins, transition polarities, path type, analysis view, and path group. Mini/AES cell delay falls 71.1/63.8 ps while net delay rises 9.2/13.5 ps. Internal logic may differ; these measurements do not isolate the cause.

The top-20 sets can contain different connections; matched comparisons fix endpoints and analysis conditions. Rocket’s matched data delay falls 28.9 ps although its top-20 mean grows as input–register paths replace input–output paths. s35932’s former worst connection moves to rank 82 in the 3D report.

JPEG Placement and HB Assignment

Bottom-first, top-first DATA-only, and early joint HB assignment reach −1.580, −0.551, and −0.464-ns WNS (Table 3). Joint assignment gains 87 ps despite 0.53% more routed wirelength; total wirelength alone cannot explain timing.

VariantWNSTNSWLPP
Bottom-first-1.580-541.766959.252.90
Top-first, DATA only-0.551-212.371723.745.66
Early joint HB assignment-0.464-167.780727.645.63
+ Tier-wide area bounds-0.118-54.046573.941.81
Timing-weighted-0.175-139.920606.141.73
Fixed-sink refinement-0.132-140.240578.041.93
Independent initializations-0.219-203.370628.843.83

Table 3. JPEG variants. WNS/TNS: ns; WL: 10310^3 model μ\mum; raw PP: mW. All report DRC/connectivity 0/0.

Tier-wide area bounds reach −0.118 ns: WNS improves 346 ps, TNS 113.734 ns, wirelength 21.12%, and raw power 8.38%. DATA HBs (excluding control/I/O) fall from 6,211 to 561; CLOCK HBs rise from 293 to 471; PG is unchanged. Two 50-model–um clampings reduce peak occupancy from 313/325 to 129/129. Fewer cut nets free sites without fixing the CLOCK-HB count. Fixed-sink refinement and independent initialization lose 14 and 101 ps, respectively: early HB assignment needs subsequent cell-placement refinement. Further refinement reaches −0.101 ns; 18/20 worst low-HB paths stay within one die, shifting optimization toward cell delay, load, and clock latency.

buffers, one per path. HB assignment selects roots; TOP CTS builds branches.

Congestion and Assignment Size

Table 4 reports tier-isolated routing replay. Re-placement reduces non-CLOCK requests 5.9–14.5× and TOP horizontal overflow in all six designs versus 2D reuse. Horizontal dominates all twelve TOP records; vertical dominates or ties in eleven BOTTOM records, consistent with layer counts and PG occupancy. H/V totals fall 53 to 26 for JPEG and 178 to 3 for RISC-V32i; Rocket BOTTOM vertical overflow rises 50 to 83.

DesignRequests R/PBOTTOM R → PTOP R → P
Rocket5,532/4687/50 → 4/83150/28 → 62/11
JPEG6,230/5780/1 → 0/647/5 → 20/0
RISC-V32i2,257/35495/62 → 0/019/2 → 3/0
AES1,593/2691/10 → 0/658/2 → 30/0
Dynamic1,998/3100/3 → 0/928/2 → 19/4
Mini1,926/1330/2 → 0/530/1 → 28/0

Table 4. 2D reuse (R) versus re-placement (P): non-CLOCK interface requests and tier-isolated horizontal/vertical (H/V) routing overflow. Same-stage global-route replay; entries give H/V overflow.

The assignment contains 1,661 candidate variables for gcd, 3,043,683 for JPEG with 2D placement reuse, and 528,181 for JPEG with tier re-placement. They encode DATA request–site or CLOCK sink-group–site choices, not physical HBs. Sparse storage retains only candidates and connections. JPEG re-placement reduces model size 5.8× and routing demand.

Clock and PG Structures

Figure 8(a) shows clock routing across dies to five TOP DFFs. Figure 8(b) shows a separate seven-DFF TOP subtree: two parallel buffers, one per path. HB assignment selects roots; TOP CTS builds branches.

Figure 8. Clock and PG structures in JPEG. (a,c,d) Measured 6-by-6-μ\mum XY window. (a) Clock across dies: tier routes projected; Z schematic. Squares: five local vias; diamond: one HB. (b) Buffered TOP subtree: two parallel buffers serve seven DFFs, one buffer per path. (c,d) BOTTOM/TOP PG; (d) open/filled HB sites: eligible/occupied; crosses: excluded.

Figure 8(c,d) show BOTTOM PG and TOP PG with HB sites in (a)’s XY window. Of 144 sites, 56 support DATA/CLOCK, 48 PG, and 40 are excluded; 33 are occupied: 11 DATA, 4 CLOCK, 8 VDD, and 10 VSS HBs. Site eligibility differs from HB occupancy.

Conclusion

CU-3D carries HB-site and cell supply constraints through partitioning, placement, CTS, and routing. Constructed geometry determines HB capacity; pin locations and loads guide joint DATA/CLOCK assignment; CTS and routing preserve HB sites, stacks, and PG connections. All ten designs, including eight and 133-macro processors, have zero backend DRC violations and pass signal-connectivity checks. JPEG shows timing gains from DATA reassignment and tier-wide partitioning area bounds. In the Mini/AES matched-endpoint comparisons, cell-delay savings outweigh net-delay increases. Cell- and net-dominated paths motivate different optimization priorities. Site matching checks HB-assignment feasibility; post-route timing evaluates its benefit. Neither fewer bonds nor shorter total wirelength is a universal 3D objective. Future work will feed matched-path cell, interconnect, and clock-phase costs into partitioning, HB selection, and macro placement refinement, and extend the physical design flow to multicorner timing, power integrity, and thermal constraints.

Acknowledgments

This work is partially supported by The Research Grants Council of Hong Kong SAR (No. CUHK14211824 and T46-415/25-R).

References

  1. [1]Lennart Bamberg, Alberto García-Ortiz, Lingjun Zhu, Sai Pentapati, Da Eun Shim, and Sung Kyu Lim. 2020. Macro-3D: A Physical Design Methodology for Face-to-Face-Stacked Heterogeneous 3D ICs. In Proceedings of DATE. IEEE, Piscataway, NJ, USA, 37–42. doi:10.23919/DATE48585.2020.9116297DOI
  2. [2]Kyungwook Chang, Saurabh Sinha, Brian Cline, Raney Southerland, Michael Doherty, Greg Jeric, and Sung Kyu Lim. 2016. Cascade2D: A Design-Aware Partitioning Approach to Monolithic 3D IC with 2D Commercial Tools. In Proceedings of ICCAD. Association for Computing Machinery, New York, NY, USA, 1–8. doi:10.1145/2966986.2967013DOI
  3. [3]Ming-Fa Chen, Fang-Chen Cheng, Wen-Chih Chiou, and Doug C. H. Yu. 2019. System on Integrated Chips (SoIC) for 3D Heterogeneous Integration. In Proceedings of ECTC. IEEE, Piscataway, NJ, USA, 594–599. doi:10.1109/ECTC.2019.00095DOI
  4. [4]Soon-Aik Chew, Boyao Zhang, Kris Vanstreels, Emmanuel Chery, Joke De Messemaeker, Liesbeth Witters, Koen Van Sever, Serena Iacovo, Sven Dewilde, Michele Stucchi, Joeri De Vos, Gerald Beyer, Andy Miller, and Eric Beyne. 2023. The Challenges and Solutions of Cu/SiCN Wafer-to-Wafer Hybrid Bonding Scaling Down to 400nm Pitch. In Proceedings of EMD. IEEE, Piscataway, NJ, USA, 1–4. doi:10.1109/IEMD45741.2023.10413829
  5. [5]Lawrence T. Clark, Vinay Vashishta, Lucian Shifren, Aditya Gujja, Saurabh Sinha, Brian Cline, Chandrasekaran Ramamurthy, and Greg Yeric. 2016. ASAP: A 7-nm FinFET Predictive Process Design Kit. Microelectronics Journal 53 (2016), 105–115. doi:10.1016/j.mejo.2016.04.006DOI
  6. [6]Yuhao Ji, Yuntao Lu, Zuodong Zhang, Zizheng Guo, Yibo Lin, and Bei Yu. 2025. DiffCCT: Differentiable Concurrent Clock and Data Optimization. In Proceedings of ICCAD. IEEE, Piscataway, NJ, USA, 1–9. doi:10.1109/ICCAD62669.2025.11240631DOI
  7. [7]Yuhao Ji, Yunqi Shi, Tianshu Hou, Yuxuan Zhao, Chunyuan Zhao, Peiyu Liao, Zizheng Guo, Chao Qian, Yibo Lin, and Bei Yu. 2026. Integrated Timing-driven Placement for Hybrid-Bonding-based Face-to-Face 3D ICs. In Proceedings of DAC. Association for Computing Machinery, New York, NY, USA. doi:10.1145/3770743.3804060DOI
  8. [8]Liwen Jiang, Andrew B. Kahng, Zhiangi Wang, and Zhiyu Zheng. 2026. Invited: Toward Sustainable and Transparent Benchmarking for Academic Physical Design Research. arXiv:2601.17520 doi:10.48550/arXiv.2601.17520DOI
  9. [9]Liew Jin, Zhiyi Ruong Xiao, Huang Xuan, Ruijun Jiang, Zhiung Wang, and Keren Zhu. 2026. Differentiable Partitioning With Dual-Max 3D Wirelength Model and Hybrid Bonding Terminal Awareness for Optimized 3D Placement. arXiv:2609.06408v2. doi:10.48550/arXiv.2609.06408
  10. [10]Gyumin Kim and Heechun Park. 2025. A Unified Design Flow for Homogeneous and Heterogeneous 3D Integration with Fine-Pitch Hybrid Bonding. In Proceedings of ICCAD. IEEE, Piscataway, NJ, USA, 1–9. doi:10.1109/ICCAD62669.2025.11240974
  11. [11]Bon Woong Ku, Kyungwook Chang, and Sung Kyu Lim. 2018. Compact-2D: A Physical Design Methodology to Build Commercial-Quality Face-to-Face-Bonded 3D ICs. In Proceedings of ISPD. Association for Computing Machinery, New York, NY, USA, 90–97. doi:10.1145/3177550.3178244DOI
  12. [12]Shanyi Li, Leilei Jin, Siyuan Liang, Zhen Zhuang, Rongmei Chen, Bei Yu, and Tsung-Yi Ho. 2026. FlexiCTs: CPPR-Aware 3D Clock Tree Synthesis for Face-to-Face Bonded ICs. In Proceedings of DAC. Association for Computing Machinery, New York, NY, USA, 7 pages. doi:10.1145/3770743.3803984DOI
  13. [13]Siting Liu, Jiaxi Jiang, Zhuolun He, Ziyi Wang, Yibo Lin, Bei Yu, and Martin Wong. 2024. Routing-aware Legal Hybrid Bonding Terminal Assignment for 3D Face-to-Face Stacked ICs. In Proceedings of ISPD. Association for Computing Machinery, New York, NY, USA, 75–82. doi:10.1145/3626184.3633322
  14. [14]Open3DFlow Authors. n.d. Open3DFlow: Open-Source Project and Demonstrations. https://github.com/b224hsil/Open3DFlow Project artifact; accessed October 28, 2026.
  15. [15]Shreepad Panth, Kambiz Samadi, Yang Du, and Sung Kyu Lim. 2017. Shrunk-2-D: A Physical Design Methodology to Build Commercial-Quality Monolithic 3-D ICs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 36, 10 (2017), 1716–1724. doi:10.1109/TCAD.2017.2648839
  16. [16]Satwik Patnaik, Mohammed Ashraf, Ozgur Sinanoglu, and Johann Knechtel. 2018. Best of Both Worlds: Integration of Split Manufacturing and Camouflaging into a Security-Driven CAD Flow for 3D ICs. In Proceedings of ICCAD. Association for Computing Machinery, New York, NY, USA, 1–8. doi:10.1145/3240765.3240784DOI
  17. [17]Sai Surya Kiran Pentapati, Kyungwook Chang, Vassilios Gerousis, Rwik Sengupta, and Sung Kyu Lim. 2020. Pin-3D: A Physical Synthesis and Post-Layout Optimization Flow for Heterogeneous Monolithic 3D ICs. In Proceedings of ICCAD. Association for Computing Machinery, New York, NY, USA, Article 4, 9 pages. doi:10.1145/3400302.3415720
  18. [18]Yunqi Shi, Chengrui Gao, Wanqi Ren, Peng Xie, Siyuan Xu, Ke Xue, Mingxuan Yuan, Chao Qian, and Zhi-Hua Zhou. 2026. Open3DBench: Open-Source Benchmark for 3D-IC Backend Implementation and PPA Evaluation. arXiv:2503.12946 [cs.AR]. doi:10.48550/arXiv.2503.12946 Version 2, April 5, 2026.DOI
  19. [19]Pruek Vanna-ampikul, Chengjia Shao, Yi-Chen Lu, Sai Pentapati, and Sung Kyu Lim. 2021. Snap-3D: A Constrained Placement-Driven Physical Design Methodology for Face-to-Face-Bonded 3D ICs. In Proceedings of ISPD. Association for Computing Machinery, New York, NY, USA, 39–46. doi:10.1145/3439706.3447049
  20. [20]Pruek Vanna-ampikul, Junsik Yoon, Chaeryung Park, Gary Yeap, and Sung Kyu Lim. 2025. Placement-Aware 3D Net-to-Pad Assignment for Array-Style Hybrid Bonding 3D ICs. In Proceedings of ISPD. Association for Computing Machinery, New York, NY, USA, 200–208. doi:10.1145/3698364.3705357
  21. [21]Vinay Vashishta, Manoj Vangala, and Lawrence T. Clark. 2017. ASAP7 Predictive Design Kit Development and Cell Design Technology Co-Optimization: Invited Paper. In Proceedings of ICCAD. IEEE, Piscataway, NJ, USA, 992–998. doi:10.1109/ICCAD.2017.8203889
  22. [22]Mingjun Wang, Lancheng Zou, Guanqi Li, Feng Gu, Yuntao Lu, Tianmeng Yang, Boyu Han, Jianan Mu, Huawei Li, Sung Kyu Lim, and Bei Yu. 2026. Distill3D: Cross-Stage Knowledge Distillation for Early-Stage 3D IC Timing Prediction. In Proceedings of ICCAD. https://lanchengzou.github.io/ To appear.
  23. [23]Lingjun Zhu, Jiawei Hu, Gauthaman Murali, and Sung Kyu Lim. 2024. Hetero-3D: Maximizing Performance and Power Delivery Benefits of Heterogeneous 3D ICs. In Proceedings of ISLPED. Association for Computing Machinery, New York, NY, USA, 1–6. doi:10.1145/3665314.3670850DOI
  24. [24]Lingjun Zhu, Chanmin Jo, and Sung Kyu Lim. 2022. Power Delivery Solutions and PPA Impacts in Micro-Bump and Hybrid-Bonding 3D ICs. IEEE Transactions on Components, Packaging and Manufacturing Technology 12, 12 (2022), 1969–1982. doi:10.1109/TCPMT.2022.3221025DOI
  25. [25]Yifei Zeng, Dawei Feng, Zhenxuan Luan, Lei Ren, Weiwei Chen, and Zhangxi Tan. 2025. Open3DFlow: An Open-Source EDA Platform for 3D Chip Design with AI Enhancement. In Proceedings of ICCAD. IEEE, Piscataway, NJ, USA, 1–9. doi:10.1109/ICCAD62669.2025.11240886DOI
  26. [26]Zhen Zhuang, Zheng Yang, Yuxuan Zhao, Jiawei Hu, Bei Yu, Sung Kyu Lim, and Tsung-Yi Ho. 2026. DPO-3D: Differentiable Power Delivery Network Optimization via Flexible Modeling for Routability and IR-Drop Tradeoff in Face-to-Face 3D ICs. In Proceedings of ASP-DAC. IEEE, Piscataway, NJ, USA, 1273–1279. doi:10.1109/ASPDAC66049.2026.11420394DOI

Paper details

vlnc:W_pv9rq2m7
Version
v2 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents