Parameter Extraction 4

!" #$%&'(" %'" )*+,$-.$" %&$" %&,'/0&1/%" '2" .%-%)+" ,$+/,.)3$ -40',)%&#." )." 1,$.$*%$(5" 6&$" .)0*-4724'8" 0,-1&" )." %,-*.7 2',#$(" 9:" 2),.%" #)*)#);)*0" %&$" */#9$," '2" ./##-%)'* 1')*%." )*" %&$" +'#1/%-%)'*-4" 4''1.5" !" .$+'*(" %,-*.2',#-7 %)'*" %'" ,$8,)%$" %&$" 2)<$(" +'$22)+)$*%" #/4%)14)+-%)'*." -." ./#"'2" 8$)0&%$(".)0*-4." )." %&$*" 2'44'8$("9:" -",$',($,)*0 '2" %&$" ./##-%)'*.5"...

...................................................................................................................................................4

OF THE DISSERTATION Parallel and Statistical Analysis and Modeling of Nanometer VLSI Systems

In this paper, we present efficient layouts for complete graphs and star graphs. We show that an N-node complete graph can be optimally laid out using LN2/4] tracks for a colinear layout, and can be laid out in N4/16 + o(N4) area for a 2D layout. We also show that an N-node star graph can be laid out in N2/16 + o(N2) area, which is smaller than any possible layout of a similar-size hypercube. T...