LACLMLn1

W |acement
W |acement Goa|s and Cb[ect|ves
W Measurement of |acement Goa|s and
Cb[ect|ves
W |acement A|gor|thms
W L|genva|ue |acement w|th Lxamp|e
W Iterat|ve |acement Improvement
Cvervlew
WhaL ls placemenL?
W lacemenL deflnes Lhe locaLlon of Lhe loglc
cells wlLhln Lhe flexlble blocks and seLs aslde
space for Lhe lnLerconnecL Lo each loglc cell
W lacemenL ls a key sLep ln physlcal deslgn cycle
W 1he lnpuL Lo Lhe placemenL phase ls a seL of
blocks Lhe number of Lermlnals for each block
and Lhe neLllsL
An example of Lhe lnLerconnecL
sLrucLure for a C8lC
lnLerconnecL sLrucLure (a) 1he Lwolevel meLal C8lC floorplan (b) A channel from
Lhe flexlble block A 1hls channel has a channel helghL equal Lo Lhe maxlmum
channel denslLy of 7 (Lhere ls room for seven lnLerconnecLs Lo run horlzonLally ln
m1) (c) A channel LhaL uses C1C (overLhecell) rouLlng ln m2
|acement Goa|s and Cb[ect|ves
W oal of a placemenL Lool ls Lo arrange all Lhe loglc cells
wlLhln Lhe flexlble blocks on a chlp
W 1he ob[ecLlves of Lhe placemenL sLep are Lo
uaranLee Lhe rouLer can compleLe Lhe rouLlng sLep
Mlnlmlze all Lhe crlLlcal neL delays
Make Lhe chlp as dense as posslble
Mlnlmlze power dlsslpaLlon
Mlnlmlze cross Lalk beLween slgnals
W Cb[ecLlves such as Lhese are dlfflculL Lo deflne ln a way LhaL
can be solved wlLh an algorlLhm and even harder Lo
acLually meeL 1he mosL commonly used placemenL
ob[ecLlves are one or more of Lhe followlng
Mlnlmlze Lhe LoLal esLlmaLed lnLerconnecL lengLh
MeeL Lhe Llmlng requlremenLs for crlLlcal neLs
Mlnlmlze Lhe lnLerconnecL congesLlon
Measurement of |acement Goa|s
and Cb[ect|ves
W ln order Lo deLermlne Lhe quallLy of a placemenL we need Lo be
able Lo measure lL We need an approxlmaLe measure of
lnLerconnecL lengLh closely correlaLed wlLh Lhe flnal lnLerconnecL
lengLh LhaL ls easy Lo calculaLe
W 1he graph sLrucLures LhaL correspond Lo maklng all Lhe connecLlons
for a neL are known as trees on graphs (or [usL trees ) Speclal
classes of Lrees Ste|ner trees mlnlmlze Lhe LoLal lengLh of
lnLerconnecL and Lhey are cenLral Lo ASlC rouLlng algorlLhms 1hls
Lype of Lree uses dlagonal connecLlonswe wanL Lo solve a
resLrlcLed verslon of Lhls problem uslng lnLerconnecLs on a
recLangular grld 1hls ls called rect|||near rout|ng or Manhattan
rout|ng We say LhaL Lhe Luc||dean d|stance beLween Lwo polnLs ls
Lhe sLralghLllne dlsLance (as Lhe crow flles") 1he Manhattan
d|stance (or recLangular dlsLance) beLween Lwo polnLs ls Lhe
dlsLance we would have Lo walk ln new ?ork
lacemenL uslng Lrees on graphs (a) 1he floorplan (b) An expanded vlew of Lhe
flexlble block A showlng four rows of sLandard cells for placemenL 1o flnd Lhe lengLh
of Lhe neL shown wlLh four Lermlnals W Lhrough Z glven Lhe placemenL of four loglc
cells (labeled A211 A19 A43 A23) (c) 1he problem for neL (W x ? Z) drawn as a
graph 1he shorLesL connecLlon ls Lhe mlnlmum SLelner Lree (d) 1he mlnlmum
recLlllnear SLelner Lree uslng ManhaLLan rouLlng 1he recLangular (ManhaLLan)
lnLerconnecLlengLh measures are shown for each Lree
Measurement of |acement Goa|s and Cb[ect|ves
Measurement of |acement Goa|s and Cb[ect|ves
W 1he m|n|mum rect|||near Ste|ner tree ( M8S1 ) ls Lhe shorLesL lnLerconnecL
uslng a recLangular grld 1he deLermlnaLlon of Lhe M8S1 ls ln general an n
compleLe problemwhlch means lL ls hard Lo solve lor small numbers of
Lermlnals heurlsLlc algorlLhms do exlsL buL Lhey are expenslve Lo compuLe
lorLunaLely we only need Lo esLlmaLe Lhe lengLh of Lhe lnLerconnecL
W 1he comp|ete graph has connecLlons from each Lermlnal Lo every oLher
Lermlnal 1he comp|etegraph measure adds all Lhe lnLerconnecL lengLhs of
Lhe compleLegraph connecLlon LogeLher and Lhen dlvldes by o $2 where o ls
Lhe number of Lermlnals
lnLerconnecLlengLh measures
(a) CompleLegraph measure
(b) PalfperlmeLer measure
1he bound|ng box ls Lhe smallesL recLangle LhaL encloses all Lhe Lermlnals 1he ha|f
per|meter measure ls onehalf Lhe perlmeLer of Lhe boundlng box lor a clrculL
wlLh m neLs uslng Lhe halfperlmeLer measure corresponds Lo mlnlmlzlng Lhe cosL
funcLlon
where b
l
ls Lhe halfperlmeLer measure for neL l
lL does noL really maLLer lf our approxlmaLlons are lnaccuraLe lf Lhere ls a good
correlaLlon beLween acLual lnLerconnecL lengLhs (afLer rouLlng) and our
approxlmaLlons now our wlrlng lengLh approxlmaLlons are funcLlons noL [usL of Lhe
Lermlnal poslLlons buL also of Lhe number of Lermlnals and Lhe slze of Lhe boundlng
box Cne pracLlcal example ad[usLs a SLelnerLree approxlmaLlon uslng Lhe number of
Lermlnals 1hls Lechnlque ls used ln Lhe Cadence aLe Lnsemble placemenL Lool for
example
CorrelaLlon beLween LoLal lengLh of
chlp lnLerconnecL and Lhe half
perlmeLer and compleLegraph
measures
M8S1 drawback
WM8S1 may only approxlmaLe Lhe lnLerconnecL LhaL wlll be compleLed by Lhe deLalled rouLer
W1he M8S1 LhaL mlnlmlzes LoLal neL lengLh may noL mlnlmlze neL delay
W1here ls no polnL ln mlnlmlzlng Lhe lnLerconnecL lengLh lf we creaLe a placemenL LhaL ls Loo
congesLed Lo rouLe
lf we use mlnlmum |nterconnect congest|on as an addlLlonal placemenL ob[ecLlve we need some
way of measurlng lL Cne measure of lnLerconnecL congesLlon uses Lhe max|mum cut ||ne
lmaglne a horlzonLal or verLlcal llne drawn anywhere across a chlp or block 1he number of
lnLerconnecLs LhaL cross Lhls llne ls Lhe cut s|ze 1he maxlmum cuL llne has Lhe hlghesL cuL slze
1he problem wlLh Lhls approach ls LhaL a loglc cell may be placed a long way from anoLher loglc
cell Lo whlch lL has [usL one connecLlon 1hls loglc cell wlLh one connecLlon ls less lmporLanL as far
as Lhe LoLal wlre lengLh ls concerned Lhan oLher loglc cells Lo whlch Lhere are many connecLlons
Powever Lhe one long connecLlon may be crlLlcal as far as Llmlng delay ls concerned As
Lechnology ls scaled lnLerconnecLlon delays become larger relaLlve Lo clrculL delays and Lhls
problem geLs worse
lnLerconnecL congesLlon for
Lhe cellbased ASlC
(a) MeasuremenL of
congesLlon
(b) An expanded vlew of
flexlble block A shows a
maxlmum cuL llne
|acement A|gor|thms
W 1here are Lwo classes of placemenL algorlLhms commonly used ln
commerclal CAu Lools consLrucLlve placemenL and lLeraLlve placemenL
lmprovemenL
W A construct|ve p|acement method uses a seL of rules Lo arrlve aL a
consLrucLed placemenL 1he mosL commonly used meLhods are varlaLlons
on Lhe mlocot olqotltbm ooJ Lhe elqeovoloe metboJ
W As ln sysLem parLlLlonlng placemenL usually sLarLs wlLh a consLrucLed
soluLlon and Lhen lmproves lL uslng an |terat|ve a|gor|thm 1hese
algorlLhms modlfy Lhe lnlLlal placemenL ln search of a beLLer placemenL ln
an lLeraLlve manner unLll no lmprovemenL ls posslble
W 1he m|ncut p|acement meLhod uses successlve appllcaLlon of
parLlLlonlng 1he followlng sLeps are shown ln flgure
CuL Lhe placemenL area lnLo Lwo pleces
Swap Lhe loglc cells Lo mlnlmlze Lhe cuL cosL
8epeaL Lhe process from sLep 1 cuLLlng smaller pleces unLll all Lhe loglc cells
are placed
MlncuL placemenL (a) ulvlde Lhe chlp lnLo blns uslng a grld (b) Merge all connecLlons Lo Lhe
cenLer of each bln (c) Make a cuL and swap loglc cells beLween blns Lo mlnlmlze Lhe cosL of
Lhe cuL (d) 1ake Lhe cuL pleces and Lhrow ouL all Lhe edges LhaL are noL lnslde Lhe plece
(e) 8epeaL Lhe process wlLh a new cuL and conLlnue unLll we reach Lhe lndlvldual blns
1he e|genva|ue p|acement a|gor|thm
1he e|genva|ue p|acement a|gor|thm uses Lhe cosL maLrlx or welghLed connect|v|ty
matr|x ( elgenvalue meLhods are also known as spectra| methods ) 1he measure we use
ls a cosL funcLlon LhaL we shall mlnlmlze glven by
where c
l[
ls Lhe (posslbly welghLed) connecLlvlLy maLrlx and J
lj
ls Lhe Luclldean
dlsLance beLween Lhe cenLers of loglc cell l and loglc cell j We can rewrlLe Lhe cosL
funcLlon ln maLrlx form
ls a symmeLrlc maLrlx Lhe d|sconnect|on matr|x (also called Lhe Laplaclan)
We may express Lhe Laplaclan ln Lerms of Lhe connecLlvlLy maLrlx and a dlagonal
maLrlx (known as Lhe degree maLrlx) deflned as follows
1he e|genva|ue p|acement a|gor|thm
W We can slmpllfy Lhe problem by noLlclng LhaL lL ls symmeLrlc ln Lhe
and coordlnaLes 8efore we solve Lhls problem we lnLroduce a
consLralnL LhaL Lhe coordlnaLes of Lhe loglc cells musL correspond Lo valld
poslLlons (Lhe cells do noL overlap and Lhey are placed ongrld) We make
anoLher slmpllfylng assumpLlon LhaL all loglc cells are Lhe same slze and
we musL place Lhem ln flxed poslLlons We can deflne a vecLor p conslsLlng
of Lhe valld poslLlons
W lor a valld placemenL Lhe coordlnaLes of Lhe loglc cells
W musL be a permuLaLlon of Lhe flxed poslLlons p We can show LhaL
requlrlng Lhe loglc cells Lo be ln flxed poslLlons ln Lhls way leads Lo a serles
of o equaLlons resLrlcLlng Lhe values of Lhe loglc cell coordlnaLes lf we
lmpose all of Lhese consLralnL equaLlons Lhe problem becomes very
complex lnsLead we choose [usL one of Lhe equaLlons
1he e|genva|ue p|acement a|gor|thm
W Slmpllfylng Lhe problem ln Lhls way wlll lead Lo an approxlmaLe soluLlon Lo Lhe
placemenL problem We can wrlLe Lhls slngle consLralnL on Lhe coordlnaLes ln
maLrlx form
W where ls a consLanL We can now summarlze Lhe formulaLlon of Lhe problem
wlLh Lhe slmpllflcaLlons LhaL we have made for a onedlmenslonal soluLlon We
musL mlnlmlze a cosL funcLlon q (analogous Lo Lhe cosL funcLlon ) where
W sub[ecL Lo Lhe consLralnL
W 1hls ls a sLandard problem LhaL we can solve uslng a Lagranglan mulLlpller
W 1o flnd Lhe value of x LhaL mlnlmlzes q we dlfferenLlaLe L parLlally wlLh respecL
Lo x and seL Lhe resulL equal Lo zero We geL Lhe followlng equaLlon
1he e|genva|ue p|acement a|gor|thm
W 1hls lasL equaLlon ls called Lhe character|st|c equat|on for Lhe dlsconnecLlon
maLrlx and occurs frequenLly ln maLrlx algebra 1he soluLlons Lo Lhls equaLlon are
Lhe e|genvectors and e|genva|ues of MulLlplylng above Lq by x
1
we geL
W Powever slnce we lmposed Lhe consLralnL x
1
x and x
1
x q Lhen
W 1he elgenvecLors of Lhe dlsconnecLlon maLrlx are Lhe soluLlons Lo our placemenL
problem lL Lurns ouL LhaL (because someLhlng called Lhe rank of maLrlx ls o 1)
Lhere ls a degeneraLe soluLlon wlLh all coordlnaLes equal ( l )Lhls makes
some sense because puLLlng all Lhe loglc cells on Lop of one anoLher cerLalnly
mlnlmlzes Lhe lnLerconnecL 1he smallesL nonzero elgenvalue and Lhe
correspondlng elgenvecLor provldes Lhe soluLlon LhaL we wanL ln Lhe Lwo
dlmenslonal placemenL problem Lhe and coordlnaLes are glven by Lhe
elgenvecLors correspondlng Lo Lhe Lwo smallesL nonzero elgenvalues
L|genva|ue |acement Lxamp|e
W Conslder Lhe followlng connecLlvlLy maLrlx and lLs dlsconnecLlon maLrlx calculaLed
from Lq 8 u C
W Pere ls a MaLLab scrlpL Lo flnd Lhe elgenvalues and elgenvecLors of
C 1 1 1 1 1 1
u1 2 1 2
8uC
xu elg(8)
0 0 0 1
0 0 1 1
0 1 0 0
1 1 0 0
1 0 0 0 0 0 0 1 1 0 0 1
0 2 0 0 0 0 1 1 0 2 1 1
0 0 1 0 0 1 0 0 0 1 1 0
0 0 0 2 1 1 0 0 1 1 0 2
L|genva|ue |acement Lxamp|e
Llgenvalue placemenL (a) An example neLwork (b) 1he onedlmenslonal placemenL 1he
small black squares represenL Lhe cenLers of Lhe loglc cells (c) 1he Lwodlmenslonal
placemenL 1he elgenvalue meLhod Lakes no accounL of Lhe loglc cell slzes or acLual locaLlon
of loglc cell connecLors (d) A compleLe layouL We snap Lhe loglc cells Lo valld locaLlons
leavlng room for Lhe rouLlng ln Lhe channel
L|genva|ue |acement Lxamp|e
W 8unnlng Lhls scrlpL we flnd Lhe elgenvalues of are 3838 2 and 34142
1he correspondlng elgenvecLors of are
W lor a onedlmenslonal placemenL ln flgure (b) we use Lhe elgenvecLor (6333
276 6333 276) correspondlng Lo Lhe smallesL nonzero elgenvalue
(whlch ls 3838) Lo place Lhe loglc cells along Lhe axls 1he Lwodlmenslonal
placemenL flgure (c) uses Lhese same values for Lhe coordlnaLes and Lhe
elgenvecLor (3 3 3 3) LhaL corresponds Lo Lhe nexL largesL elgenvalue
(whlch ls 2) for Lhe coordlnaLes noLlce LhaL Lhe placemenL shown ln flgure (c)
whlch shows loglccell ouLllnes (Lhe loglccell abuLmenL boxes) Lakes no accounL of
Lhe cell slzes and cells may even overlap aL Lhls sLage 1hls ls because ln Lq
we dlscarded all buL one of Lhe consLralnLs necessary Lo ensure valld soluLlons
0.5000 0.5000 0.2706
0.2706 0.5000 0.5000 0.6533
0.6533 0.5000 0.5000 0.2706
0.2706 0.5000 0.5000 0.6533
Iterat|ve |acement Improvement
W An |terat|ve p|acement |mprovement algorlLhm Lakes an exlsLlng placemenL and
Lrles Lo lmprove lL by movlng Lhe loglc cells 1here are Lwo parLs Lo Lhe algorlLhm
1he selecLlon crlLerla LhaL decldes whlch loglc cells Lo Lry movlng
1he measuremenL crlLerla LhaL decldes wheLher Lo move Lhe selecLed cells
W 1here are several |nterchange or |terat|ve exchange meLhods LhaL dlffer ln Lhelr
selecLlon and measuremenL crlLerla
palrwlse lnLerchange
forcedlrecLed lnLerchange
forcedlrecLed relaxaLlon and
forcedlrecLed palrwlse relaxaLlon
W All of Lhese meLhods usually conslder only palrs of loglc cells Lo be exchanged A
source loglc cell ls plcked for Lrlal exchange wlLh a desLlnaLlon loglc cell 1he mosL
wldely used meLhods use group mlgraLlon especlally Lhe kernlghanLln algorlLhm
1he pa|rw|se|nterchange a|gor|thm ls slmllar Lo Lhe lnLerchange algorlLhm used
for lLeraLlve lmprovemenL ln Lhe sysLem parLlLlonlng sLep
SelecL Lhe source loglc cell aL random
1ry all Lhe oLher loglc cells ln Lurn as Lhe desLlnaLlon loglc cell
use any of Lhe measuremenL meLhods Lo declde on wheLher Lo accepL Lhe lnLerchange
1he process repeaLs from sLep 1 selecLlng each loglc cell ln Lurn as a source loglc cell
lnLerchange (a) Swapplng Lhe source loglc cell wlLh a desLlnaLlon loglc cell ln
palrwlse lnLerchange (b) SomeLlmes we have Lo swap more Lhan Lwo loglc cells aL a
Llme Lo reach an opLlmum placemenL buL Lhls ls expenslve ln compuLaLlon Llme
LlmlLlng Lhe search Lo nelghborhoods reduces Lhe search Llme Loglc cells wlLhln a
dlsLance e of a loglc cell form an enelghborhood (c) A onenelghborhood (d) A Lwo
nelghborhood
lorcedlrecLed placemenL (a) A neLwork wlLh nlne loglc cells (b) We make a grld (one
loglc cell per bln) (c) lorces are calculaLed as lf sprlngs were aLLached Lo Lhe cenLers
of each loglc cell for each connecLlon 1he Lwo neLs connecLlng loglc cells A and l
correspond Lo Lwo sprlngs (d) 1he forces are proporLlonal Lo Lhe sprlng exLenslons
lorcedlrecLed lLeraLlve placemenL lmprovemenL (a) lorcedlrecLed lnLerchange
(b) lorcedlrecLed relaxaLlon (c) lorcedlrecLed palrwlse relaxaLlon
1PAnk ?Cu