Tnbroduction to.

Routrng
+Global n0urtng physicas gestgn Flouw
poutingL. perailed rsouting
ponttoninq/
slobal nouttng
pins Dith the elechic Chip planntng /
potential ane Copnecttd
plaament /
uing o1e Seqrnent
Aftet plaument ; the layout Clock, Tree synthesis
anea s nepreserttd as the
nouting neqton Sqrat Routng
General Routrg problerm : Toing Clocune
plaumunt Wesut
N, Cu De Bs

-0, B

iechro loqy rto (Qestgnuly) Hoionta

. ARC nuly ot metal Jayess
+ Verti cal meta
full Chip Routing is Generally Via
Pi tormud io 3 steps
Global 1oufng: Coonse - Gain assigoment of noute
to

7outngnegtonu
Toticg: fine-Grai) asstqnment of 0utts to
Qetaid
nDuing, thacks

iiming htven Routiq: Net topoloqy optimizaton g

allo alTon to coitt cal hett.

tHogi7ont at vesticat muta 6Via otthout thee

1inu dnaon then ft is Global ouring
 Plaame wne backe Global nouting etauud
olp Routin9
albbal Routing onqes ton map tautl
Rottng.
Global Routng:
whe Segments used by et topolagies aeae ttntar
assiqned Cenbedded) oittin the chtip Layout
a coase DTng
nepierented by a

pvailable noutig 1es0UES ane eperenting by

tdqu with
with tapacrttes qtd path
>NetS ane ass iqned to theie
these oouti o
g ng u
neabunley.
o
Seraitnd Routing :
whe Segments 0ne
assigrcd to Spectdic noutl ng
hacky
- Ner ordtatng
pin ordening

Teninoloqy: available hoizonld

oA routing tiacr (aolam) s an
Cverttcal) otring parh
Ahoutihq egion contains outing tacks EJo
toluns
’A unitorm rotinq neqion 1 toimd by evenly
3paud husizontal& Nestical qidliny that
incute a unitorm i d ove the chip area.

pNOn unitoTn qoutng Teqion' t formed by

Vestical boundanfes thot ane
hoigontal extin al pib
aliqnud to

mar -Cl boundanta) (noh tvenly spaud)

Ahannel: n ectanqutan nottn) neqton wtth pio
ptns on othe Sidy

chanhel
Pin

arale

capactt epreienn the no-o4 availabl

noting hacks colum:

aye1 nouting the capactty tr the

fo stnqle by the pteh
channel dtvided
heignt h o thet bsg dpt
-for Mutilaye nouting the capacity ts the
Am of the Capacitic: of au layea

dpiteh CAouei
Aayert Layeis
one channt copactty
dpiteh (Aaye)
Channd meets
T-junctíon bccuns when . a venttcal
With hotzonta
Channed in a 'macno lacemnt,

haijontat
Channel

Chorn functto)
Cnsestton o.hoiizontal A
Veittcal chonneb
 RO-30 SwittheoX
BoHom Pip
onnecton
Mud!

30 S wflehbox
AfI bit
measay
warch
hec-36
7op
tot
moe

Bot
Metals
Metal Connecitb
Mural
buttom

rnel bourdany

9 sotteh Bon H bounday

Botom, kedt Right

3-&witch Bo : 6 Boundony
op, Botto m Left tRights uP Boon
 eptmization oali
’petesmin whethe 7 a qiveo plaumeQt goutal,
Determine coarse noutingfor a!
a het

uoithin availabk outng egjogs

Minimiztng 1olal one ength y
Reduang Stgnal Qelays on hets
a) Feul Cultor Destqn:
non-uniform often ath
’ he vouting eqioy n ae

diffenent shapes heiqht lotdths

F
5) Channel
OTdnfnq
B

) Standord
Ccye )
of imited metal Iaes,
feed thnough cels ne uied
the oCCYOSS
to oe a net
muliple
’For muti-pin TOng
ne
ectIineor Steinen tiees
Commony ued
5 pins - feedthough cally--(3)
we dow

’not ued

3teiner bee Sol wit te fner bree so

min wimeeangth wtth feubeit fT Suly
 Size ot the
he size ot the cet the
coLls (7outing apacitey)
nouting negion bBw the
ane fid.

possibl outng
'hr c tenemainy
unNoiq

Channel helqht = 4

Representattons of Touting egtons

E),
mid gaph s deatned as id (v,
whene the
the, nodu e v epresent
nouing 9td
id cells (qcells)
nemesents Connecttons of giid Cetl paT s(;N)

-’ A channel onnectirtty Gaph G (V,E) the

nodeu NEN nepesents channel the edqes E
epiesents adfacencies ot the channel.
 SwrtChboi (DnDe cttViky Cchannel fn teose cti Cn)
goaph 6: (.e), the neprescnt the
nodes
4pitCh box fn edge enists btw a node the
Co1esponding Suwttchbo7cS ane on Oppostte Stdes o
the Same channel.
Sample Layout wfth tis conesponding guo1tchbbox
onnectivity giaph

’A 9uoitch box fs the fntesectibn ot hor izontat

Veiticl channels

Global Rouiing
Global
-loo
Douting
dtiining. the ouing neqions :
an ea divíded
- qhe Aayout Tegtons.
me fomed ay
Ihe nouing egioni
" 2 Chapnelssuoitchboncs tothe Y

Nqfon types
thefn apaçtíee Conne ctiou ene
Coqjons
epie se ntd by graph
2: Mapping net to the iguing Teqiong :
auigned
*Each net of the deign i tentatively $o ay to
to one Sevey al souing eqions
Connect all of rs pns
ajtect
Ihe nouting capacity , ttmin, 2 Congestion
net
the path chasen on each
3y astarîng Caospofnts (Mtdoay routing
doattons 07
3Routes ane austqne d to iaed
Chosspoints, along the dges o! the routing
edges of negions.
global 2 detaiud
Enables Scaling of
nouting handlid
" Stnte the nouttng neqions can be
tndipendently in dut aud nouttng
Tectlinea Routing
teominals
Rectilinear spanoing Tee: Connect al composed
Connecions that qie
uitng only pin tot0 pio
ptn
b4 Neattcal hoizontal Seqent
only at a pin.
’ pin to pin Conne cttons Can meet
to Ceate
’74 total Lamth o4 eq ment ued tiee s
the sparntng tiee ts minimal theo the tee
ton mininum spanbing ee (PMs)"
CRMST)
a mectilintan minimum
dotatT Dns
Steine hee: onne cts al p' pin
Rectilina
Some addittonal Aocations (Steines poin
9tefnes minimum Thee
a necti linc an
o4 et segrncnt
CRsMT) 1 the total ength
mioimal.
to omect all p pins is
factS about RSMT;
a p'pin nel ha btw b p
Cincuriwe) Steiner points
duqee of any teiminal pin is 2j3,4.
he
The deqsee o4 a Steine point is eithey 3 0 4
ehclosed n the Dioimu)
bo (MIBB) 0f the het
kourding
Lhe total edge tngth (Ln) o1 the RS
fs atleart hhit the pemeea of the mib bounti
bo of the
RsNY LMBB

hars loaning n irit tal

P: RSIMI
Gten: R MST

RSr
Tar: hanstbam the RMST fmto a heuntstie
p: P-2 Steine pointPa te DOe SP

Fin al Tee CRSm)

P1 (net cost mio)
Lonstact L-Shape bhu St etne point
points wth Cmost)
ovenlap o4 nu Segibentt
lanan Gatd that
’ t consists o the Atnes 7 p y:yp
on (ap. 9p).
passes though tach pio oatt
Steine points
points dotated at the
Conside) oniy Ste that
a hoirzoot al 1nes
otisectton3 of Veaticat
Pass tinough teiminal plns Steiner
PCinks

H+++1
Cntensect ian tHanan
Terminad pontt
contso)
(o)
 Recttneon Routtng

etnirg nouting Pin assigncd

Pin conreato to grid Celly
Gegtons
A Sequentíal ste ine hee Heuaistc
> find the close t ( în tctm ot Nett lineas distan
" pin par, onstuct the Mipimum boundling bod

2 frrd the ny
Closest point paii (PmBB P) bro anY
point Pmes on the MBB P fpm the set of
Pins to CohsideY

3Y Conshuct the MBB of P Pe

4nde the L-Shape that PmB Lies on to
T' (deleting the ethe -shape) Ti Pmee i
a pin then. iadd any Lshape oft MBe toT.
5 Go to Step-2 untt) the St of pins to
Consi d7

thetn ooidtnate.
a: Seven pin P, to P+
Rto6), ,5), Pa (4), Py (S/4), Ps(&y2), fal3,2)
P4 (;0)
tonstct hunistte Steines
minimsm tiee
uing the Sequuntal Steiner Tree heunitte
 PmB

6 5

Steinen
poirts.

alhecton
bo t chanaing diection
Crot q0od

(ombines Suoitchboes $ channels g handles

non-ne ctangula Bock shape. muti- chip
o Jul-custom desiqn
modules:

"channel connectwity qiaph:

ethe av,e)

Chord

Susitcb bo connecvity qaph:

Iatt
 nlqontthm
Up: nettist Netlist LA
Jayout Netlist
outng toplogies for each het fo
1 RR= Ildettne noutirg
pEFINE-2001INGRE61ONS (LA)
2 C- =
S net =
DEFINE_CONNECTIVITY-GAAPH(RR} Iaettne corcs
graph
NETORDER IN 6(Netii Ildtermine net
4 ASSIGN TeACK CRe,Neti
ovdering
lassico tacrs toz
all pio Conne Ction io
5 -foy (i=1 to lnets ) N consider each net
6.
for nets pin.
FREE TRA CKS(nct) nfee oneiponding tacks
Snets SUBNETS (net) Il oluompose net no
Rpin Sub nets
for (y=1 to |snesb])
Snet- Snets[i]
Spath= ttoRTEST- PATH( S0netyCG) ), frd the
JShorlet i path to
12
shatet sent in onnectvr
Continu. path qraph C :
else
lothesotse, asstn shet to
ROUTE (snetippath,c6) M0ode of spath
8 update rouring
Capacrffe)

$
step: Dcsine (he

he vestical & honf3ental nouting gions n

Shetch the So undng bo1 ot cells to each
dire ctron unttl a cel 0 chtp bounday is
7eachtd.
otontal

Ventl Cal macyb

Layour lua with Honigontal macro
maiD- bloc ks
e edqes teil edqe

skep-> Qefroing the conoecttvi! 9 graph

Note: Represent the

(26)
aouting egions 6
btw the
Edqe: connection
tutng cgion (ontnuiy
contalns
of the owing tal
venttcal
the honizon
Capactieu oJ the nouting

bgontat capacily
Veattcat copoctg 20

5
 tep:3 : eternioiog the net order
Nets an be iosftfzed baied mans
horo ping , sze. o4 bourding bor (aarge
hiqher pitost ) elechtcal operte s
alqosithms dynamically upánte priostties
based on Jauour Propertres

Atep:4: Assiqnimg taacks for al pio

’for each pin pin a hoiigonta track Ea
\eTttccu track ase Teseved ottb1o pin's qouti
eqton
Step:5: Global 10utgng of a neb
Net o Qubnet oduring
Tack a ssiqnment in thr onocctiyTy naph
Cmaze -outing)
’ opacity update to the Conne ctriEY graph.
FAamp'- Global nouting în a connectiy gaph
Given: () nets AB
(e) the Aayout eqton ofth qourtrq geqionu
and Obstacu Cleft), e
1)the Cori esponding onect
onectt gophlhtgj
B

8IB
12

hoifjontaj
Veitttal
 haK.
tieijohtal 4.1-
3 2
8
2
3
5
3
B lteynoutabi theiCmine
Qetemine Detatk
(atghy ghaph tNity conne
rg the left) C
(9) GCbstaclu netons
eoith on
eaAayout the 13) B nnets Giens
litye aDeteimiing
bl etoute1min+ng Buample
6)
3
 souce
-nds soitet paths hom a specfdtd wtth
hocde tu othe baten in a gph

hodes In the 0utiy gph te,

fom oa 40uTa t0 a pontictan tongee
thts is oten nctened to a mxye

0a naph G(t) wnth non ate nige ueyhy

() a 4ounu (stant+og) noxte S. 9
) a tonget Centing) node t
(he a0 mantans qarups of

conskdeacd,f

-> Gnoup aontan the nody thhe hae hot yet

been vred
Cn tatty al note! be lerg1 to thit qpeuP
Gooup2: Centans the hote ttt have beeh
Yted bt for obteh the sheotet Mth
ott om the
heen ourxd
tontthg hedt hu not yer
-6ap3 tontans t hodes that tye been
\sited 4 foy tohteh the
kheitet pth
tost om te stentny te har beeh
found.
ip: oe1gnted qraph 6(v,e) th edqe weights 0)
nod s, tarqet hode t
3 to t
ob: thoitest path toro

qr oups qoups Path =

foreach Cnode node ¬qoupJ
ponent (node= UNKNOWN
uncoon, înitial
cost (s] (nodeJ oo h coSt tom Sto aRy
nocle mar.
6. Cost (S) [s
(s =o
leicapt the s-scost to)
s t1 the Stantingnoda.
MOVE (s,qoup, qioup,) I more 's fom Gnoup, to
whtle Cu-node !t) ohile not t
foi each (nejghbotng nod o un-nod)
I ahorte t pats ti alauddy
knon
13 tail- tost Cest [SJ (aTi-nod] +w feumnod Jodj
11 Cnoc Eqcup, ) I) node hat not been Vtd.
15
MoVE Cnoda qioupi, groupa) Imask a
viSTted
6 eost (3] (nou] = trãäl_Cost M Ser ost fro)

ponent [nodJ m-node

edse it (thal -cotc ostfs] (roda])
tost (s] [node) al cat s DDpath
Porsent Cpode]= orm-nau Cum_nody
20.
aur-nod =BEST (qYoup 25 um.nad s
MOVE Cum- noda, qhoup grups) paent[am nod)
23 while Cu node J =s)
 DI Kshas l¡ó
tindinq shostejt bth oith (tonveptuonad sigle
cueight
Both
. r. but i0 VLSI -
hoyi vey Capacttu,
3,2.1 Leighis)
ventiorda - Odge ane
not to a-adútbr

45
here ,Oun fntronneCt
Vevtical
ofll be eithes
`3 hontgontal,
Fnd the shartest path fiom souia 'sto
torget t' ohee the path cost(so, +Sw)
is mipirnal.A
nitiatly
Sol: A nody re in

Gnoup 2
umr-node = |
Neiq -nodey =2, 4
imin ces t i G- : node 4.
Cum-noda 4
N-N= 5) tX
CI+)(4t) in ost in 6-2: Hod, 2

NNOde = 5)3
8+2)(6 t6) in o! t in 6-20c 3

wk6A[N8Nt 34.
Cet1t9),(64J -noe = 6

a4. taK node 50777eumn0d 5

N6J[12,19)
T44+ 5
 Cum -no de
w[s]{nN): 26
w[s3{iD: -[9,2) Y-NOcu- 8
6-2:8
mio cost tn

enate hom tof8] 1optimal

(D parh -4s
fom S to t wiH,
4 to s
acumulattd

C12,19)

Zouing by intaqes linecn pacquavoing(u)

of constiaints an optional
ebjunc
Obj func is mantmige d mibiolzed
’conrhaintse Objecttue must be lintan
Corsnaints tom a Systm of inca eqn
> tnequatHja.
vaniablu Can
tnteqti LP aa LpLp ohee eve4
onty assume ntege Va
Valle

caie: wnelingth eductton are -2: Tmporing ped

jetimizario prob
-CPtimatien paob
Mhimijaron peb Maning atin prab
3. ilps

) Rouring cdge cancitte

3) Nalist
 Boolean aniables
-fst set tontato k Boole
hetk each of obich
ner k paths or
indícatt one spciftc
Det e Neti1st
opttons , -foy each net
Vantabk wnet)
- Second Set contatns k' eal nepiesep8 a net
each oH ohtch
wight ton Jpeciftcaoue optiun to)
¬ Nettist.

AuO onsh aints 3

0ute
’1*,each het mut lelect a sinqle
Clutu al encuton
overHtows the nbbt
Becend to prevent
nouter assignedto
assignea each ede Ctotal usage)
can't e1teed

height Ht ot nouting id 6
wH:oidth
9n1d cell at Lo tatt en (S) GU, ya
d¯ec ton

s'aC3) G (itis)): Capacty o hoitzontal edge

r(alijJaG(tJ)D. : opacity of
veattcal edqe 6lij) ~6 (41) aG3)
Netttst

Naniables
Anet, *)2nety :* Boclan path yanlably to1
het ntt E Neii st

Wk)e*y Whet nt wciqht cnt foy ead net

net E Netltyt
Mazinie

Whety 'Xnet, t t Wnet yXnet

net ENetti!t

Subject to
Yantable noges: net c Netlist

Net conshhaints

Capactly in drection
vevttcal

INet conshalnts.

(Xnet,+Xnetr) s rlai)Glijt)
Znet e'Netitst
tha. we
Nnetr

(Knet yt+*netr)=T(6i3)~Gl)
Netlis t

tnetk that ue 6(ij)w G,(ttiyj) capacíiy

0ew, osje H-! honigont ai
dinection.

¬namplu
Gtven, (o)

. hets A-c (nc)

(o, )
"Tc)-), ee G,
L-shapes have cight of .00 f Z-shaper haye
weight o.49 The Looy oY -upt CoYDey is (0o)

Tast: o1te the TLp to oute the nets In the qaph.

for ner Athe routeS Ye
posstble
Net onstraintt |Ai
A

yantabu Constaint
A3
4

for nt D the
possible 70utey ane Lshapy
one
I-shape (B3)
Net ohshraint:

\onta bl conshaintd 3

B
B3

for t the possiblo 1oute ae

and
Q-2thpe CCa,C2)
2I-shapes (Cs,Cy)
Net Conshaints:

yant able onstoaints

 gontal Cdge pacity onshaio i
G(o0) 6C,o) :
KeitKcs
G(i,0) ~6(2/0) e r(G Cvo) ~ Gl2,0)) :
G(2,o) G(3J0):
63/0) 6(4/0): Xa
G(O)) N6 ) : XA2+Xcy
6)e, (2) : XatXastoys

SL3)~Gl9) : XBT +X&3

2)~6 (2,2): Xny+Xcgt Xcy

a[o,3) Glu3): XAItXA3
elu3)G(213):
Ohstoaints:
Vestical Cdge capa ay
Glo,o) ~6l01l)? Xe, t Xty

a(30)~ 631) : Xba

G(4/0) & (9):
S(o)G(o12): Xe2+ X¢a

4(2,1) G(2/): x Aj Xyt Xeit Xey E

G(a,3) ~G(2,3): X I
k func: Manimige
KA
hapDi99

Rip-vp and Rescute (RRR)

’ Rip-up Reroute (RRP) ameo or focu bn

probematie hets
otten du to
cant be 0abl, i

* phyricat Obsracles or
othei TOuted neks bein to the oduf
’ Kuy idua i5 to alow tmpOTary Volati on,
80 that al nets but

(teYaYeuy nemove Some neH (1pup)£

Route them aifferentty (ie-oute)
decTeae the noof. V+olatoo

D
A

Routing otout Routirg ttb

altootng vtolaton allow in Vio\atol
Beyt