Switchbox routing by stepwise reshaping

Switchbox routing by stepwise reshaping

An algorithm for switchbox routing, called PACKER, is presented. In an initial phase, the connectivity of each net is established in a fast way without taking the other nets into account. In general this will give rise to conflicts (short circuits). In the second stage the conflicts are removed iteratively using Connectivity preserving local transformations (CPLT’s). They “reshape” a net by dis...

Routing Through a Generalized Switchbox

We present an algorithm for the routing problem for two-tenninal nets in generalized switchboxes. A generalized s\~itchbox is any subset R of the planar rectangular grid with no non-trivial holes, i.e. every finite face has exactly four incident vertices. A net is a pair of nodes of non-maximal degree on the boundary of R. A solution is a set of edge-disjoint paths, one for each net. Our algori...

Additive Approximation for Layer Minimization of Manhattan Switchbox Routing

Switchbox routing is one of the many problems arising in the field of VLSI routing. It requires interconnecting given sets of terminals that are placed on the boundaries of a rectangular circuit board using a 3-dimensional grid in a vertex-disjoint way. An important special case is the Manhattan Switchbox Routing problem. Here minimizing the number of layers of a routing (that is, the height of...

BEAVER: a computational-geometry-based tool for switchbox routing

CRACKER: a general area router based on stepwise reshaping