CRACKER: a general area router based on stepwise reshaping

Sabih H. Gerez; O.E. Herrmann

doi:10.1109/ICCAD.1989.76901

CRACKER: a general area router based on stepwise reshaping

Sabih H. Gerez, O.E. Herrmann

Research output: Contribution to conference › Paper

2 Citations (Scopus)

216 Downloads (Pure)

Abstract

CRACKER is an algorithm able to handle a large class of routing problems. Operating on a grid and using two wiring layers, it can deal with floating and fixed terminals, arbitrarily located in the routing area, and with obstacles in either of the two layers. The routing process consists of two stages. In the first stage, all nets are interconnected quickly, without avoiding conflicts with previously routed nets or obstacles. In the iterative second stage, connectivity-preserving local transformations are applied in a systematic way, such that, eventually, a solution without conflict is reached. There is no rip-up and reroute. The same algorithm is able to solve well-known examples of switchbox routing, routing with irregular boundaries, L-shaped channels, three-sided channels, etc

Original language	Undefined
Pages	44-47
DOIs	https://doi.org/10.1109/ICCAD.1989.76901
Publication status	Published - 1989
Event	IEEE International Conference on Computer-Aided Design, ICCAD 1989, Digest of Technical Papers - Santa Clara, CA Duration: 5 Nov 1989 → 9 Nov 1989

Conference

Conference	IEEE International Conference on Computer-Aided Design, ICCAD 1989, Digest of Technical Papers
Period	5/11/89 → 9/11/89
Other	5-9 Nov. 1989

Keywords

IR-56089

Access to Document

10.1109/ICCAD.1989.76901

00076901

Cite this

@conference{95ff621bc490449aa5b321f531d8cf24,

title = "CRACKER: a general area router based on stepwise reshaping",

abstract = "CRACKER is an algorithm able to handle a large class of routing problems. Operating on a grid and using two wiring layers, it can deal with floating and fixed terminals, arbitrarily located in the routing area, and with obstacles in either of the two layers. The routing process consists of two stages. In the first stage, all nets are interconnected quickly, without avoiding conflicts with previously routed nets or obstacles. In the iterative second stage, connectivity-preserving local transformations are applied in a systematic way, such that, eventually, a solution without conflict is reached. There is no rip-up and reroute. The same algorithm is able to solve well-known examples of switchbox routing, routing with irregular boundaries, L-shaped channels, three-sided channels, etc",

keywords = "IR-56089",

author = "Gerez, {Sabih H.} and O.E. Herrmann",

year = "1989",

doi = "10.1109/ICCAD.1989.76901",

language = "Undefined",

pages = "44--47",

note = "IEEE International Conference on Computer-Aided Design, ICCAD 1989, Digest of Technical Papers ; Conference date: 05-11-1989 Through 09-11-1989",

}

TY - CONF

T1 - CRACKER: a general area router based on stepwise reshaping

AU - Gerez, Sabih H.

AU - Herrmann, O.E.

PY - 1989

Y1 - 1989

N2 - CRACKER is an algorithm able to handle a large class of routing problems. Operating on a grid and using two wiring layers, it can deal with floating and fixed terminals, arbitrarily located in the routing area, and with obstacles in either of the two layers. The routing process consists of two stages. In the first stage, all nets are interconnected quickly, without avoiding conflicts with previously routed nets or obstacles. In the iterative second stage, connectivity-preserving local transformations are applied in a systematic way, such that, eventually, a solution without conflict is reached. There is no rip-up and reroute. The same algorithm is able to solve well-known examples of switchbox routing, routing with irregular boundaries, L-shaped channels, three-sided channels, etc

AB - CRACKER is an algorithm able to handle a large class of routing problems. Operating on a grid and using two wiring layers, it can deal with floating and fixed terminals, arbitrarily located in the routing area, and with obstacles in either of the two layers. The routing process consists of two stages. In the first stage, all nets are interconnected quickly, without avoiding conflicts with previously routed nets or obstacles. In the iterative second stage, connectivity-preserving local transformations are applied in a systematic way, such that, eventually, a solution without conflict is reached. There is no rip-up and reroute. The same algorithm is able to solve well-known examples of switchbox routing, routing with irregular boundaries, L-shaped channels, three-sided channels, etc

KW - IR-56089

U2 - 10.1109/ICCAD.1989.76901

DO - 10.1109/ICCAD.1989.76901

M3 - Paper

SP - 44

EP - 47

T2 - IEEE International Conference on Computer-Aided Design, ICCAD 1989, Digest of Technical Papers

Y2 - 5 November 1989 through 9 November 1989

ER -