Research Article

A New Length-Based Algebraic Multigrid Clustering Algorithm

Table 4

Placement wire length and runtime results comparing one- and two-level AMG-LE clustering with length-driven unclustering to baseline placements without using clustering with three placers on the ISPD05 benchmark suite.
(a) HPWL

CircuitCapoFastplacemPL
AMG-LEAMG-LEAMG-LE
Baseline (×106) 1Lvl (%) 2Lvl (%) Baseline (×106) 1Lvl (%) 2Lvl (%) Baseline (×106) 1Lvl (%) 2Lvl (%)

adaptec1 911.5 2.3 878.6 8.7 81−1.1 −1.1
adaptec2 12014.2 14.5 1084.0 9.6 97 −0.1 −0.1
adaptec3 2546.4 5.7 28715.4 17.2 2240.6 0.6
adaptec4 2308.6 12.7 195 −0.5 −0.5
bigblue1 1144.0 3.3 1075.5 7.8 1010.0 0.0
bigblue2 1672.7 2.3 1818.5 12.3 152 −0.3−0.3
bigblue3 4393.6 6.4 66337.0 40.1 4921.7 1.7

Average5.4 5.7 12.5 15.5 0.0 0.0

(b) Runtime

CircuitCapoFastplacemPL
AMG-LEAMG-LEAMG-LE
Baseline (× 102 s) 1Lvl (%) 2Lvl (%) Baseline (× 102 s) 1Lvl (%) 2Lvl (%) Baseline (× 102 s) 1Lvl (%) 2Lvl (%)

adaptec1 30 −24−73 5 −79−109 18−80 −109
adaptec2 44 2 −49 13 −15 −4 17 −134 −211
adaptec3 81 −32 −107 28 −136 −77 65 −89−135
adaptec4 21−208 −184 45 −258−199
bigblue1 54 11 −36 6 −158 −141 18 −128−173
bigblue2 92 −64 −100 23 −299 −278 49 −235−286
bigblue3 254 −24 −49 139−45 −78 123 −323 −365

Average −22 −69 −134 −125 −178 −211