Home Knowledge Base Global Routing and Detail Routing

Global Routing and Detail Routing are the two-stage process that determines the physical paths of all metal wires connecting logic cells on a chip — where global routing plans coarse wire paths across the chip to manage congestion, and detail routing assigns exact metal tracks, vias, and spacing that satisfy all design rules in the final layout.

Two-Stage Routing

StagePurposeResolutionSpeed
Global RoutingPlan wire paths across chip regionsGrid tiles (~10×10 μm)Fast (minutes)
Detail RoutingAssign exact metal tracks and viasMetal pitch (~20-40 nm)Slow (hours)

Global Routing

1. Chip divided into rectangular grid tiles (GCells — Global Cells). 2. Each tile has limited routing capacity (tracks per metal layer). 3. Global router assigns each net to a sequence of tiles — minimizing total wire length and congestion. 4. Congestion map: Shows which tiles are over-capacity — guides cell placement optimization. 5. Algorithms: Maze routing (Lee's algorithm), Steiner tree, A* search, negotiation-based (PathFinder).

Detail Routing

1. Within each tile, assign nets to specific metal tracks. 2. Insert vias for layer transitions. 3. Satisfy all DRC rules: spacing, width, enclosure, minimum area. 4. Handle obstacles: Blockages, pre-routed power rails, clock nets. 5. Optimize: Minimize via count (vias add resistance), reduce wirelength, fix DRC violations.

Routing Challenges at Advanced Nodes

EDA Router Tools

Routing Metrics

Global and detail routing are where the abstract logic design becomes physical metal on silicon — the router's ability to find valid paths for millions of nets while satisfying thousands of design rules determines whether a chip can be manufactured and whether it meets its performance targets.

global routing detail routingrouting algorithmrouting resourcemaze routingrouting stages

Explore 500+ Semiconductor & AI Topics

From EUV lithography to CUDA optimization — search the full knowledge base or chat with our AI assistant.