Reducibility
Glossary Contents
← Ch XV
Chapter XVI Steiner Tree
Ch XVII →
  1. 46 — The cheapest connection
  2. 47 — Metric closure in TypeScript
  3. 48 — Wires on a chip
48

Wires on a chip

VLSI layout routes signal nets through a sea of obstacles. The cheapest route is a Steiner tree.

On a chip, a net is a set of pins that all need to be connected to the same signal. The router lays metal wires connecting them, often choosing intermediate via points to keep total wire length short and avoid blocked regions. That is rectilinear Steiner tree on a grid graph. Cadence Innovus and Synopsys IC Compiler run Steiner-tree solvers as inner loops, optimizing total wirelength across millions of nets per chip. The same problem runs in multicast routing — IP multicast trees are Steiner trees on the network graph, with routers as potential Steiner points — and in fiber buildout planning, where ISPs decide which streets to trench given which neighborhoods they have to reach.

In plain terms

When a chip designer wires up a circuit, they have to connect a few specific pins. The wires can pass through unused regions of the chip if that makes them shorter. Routing them with the least total wire is exactly Steiner tree.

Scan to come back to page 48

End of Chapter XVI
Chapter XVII 3-Dimensional Matching →
← 47 Metric closure in TypeScript
3/3 · 48/63
49 Two sides easy, three sides hard →