Dynamic Local Usage: An Accurate Model for Usage of Tile-Internal Wiring in Global Routing

Traditional global routing simplifies routing as a Steiner Tree packing problem on a grid graph, often neglecting the need to account for tile-internal wiring connections to pin shapes. Local wiring usage is typically pre-estimated, leading to inaccuracies. To address this gap, we introduce the Dyna...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2025 62nd ACM/IEEE Design Automation Conference (DAC) S. 1 - 6
Hauptverfasser: Bihler, Tilmann, Blankenburg, Daniel
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 22.06.2025
Schlagworte:
Approximation algorithms
Heuristic algorithms
Measurement
Physical Design
Pins
Placement and routing
Routing
Shape
Steiner trees
Timing
VLSI
Wire
Wiring
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Traditional global routing simplifies routing as a Steiner Tree packing problem on a grid graph, often neglecting the need to account for tile-internal wiring connections to pin shapes. Local wiring usage is typically pre-estimated, leading to inaccuracies. To address this gap, we introduce the Dynamic Local Usage (DLU) model, which evaluates wiring usage based on exact wire shapes and optimizes routes up to detailed pin shapes. Key innovations include tip-to-tip penalty extensions to accurately model packing density and new algorithms to optimize routes according to the DLU congestion model. We demonstrate the superiority of the Dynamic Local Usage model by comparing results after global and detailed routing to an industrial global router on the 3 nm and 5 nm technology nodes. Our model achieves significant improvements in the number of vias, scenic routes, design rule violations, and timing metrics after detailed routing. Furthermore, the DLU provides a better support for incremental design changes, such as pin movements, by dynamically updating local wiring usage during routing.
DOI:10.1109/DAC63849.2025.11132507