Two-Way Partitioning(Fiduccia & Mattheyses)

• Steps:

(1) Choose a cell

(2) Move it

(3) Update the g(i)’s of the neighbors

• O(n) neighbors, each cell recomputed each time neighbor moved, and must recompute for each pin (assume #pins=K.n, Amdahl 470 K~2.7)

Previous slide

Next slide

Back to first slide

View graphic version