Hagen-Kahng EIG Partitioning

„ Perform EIG partitioning and minimize ratio cut cost.

ƒ Clique-based graph model: dotted edge has weight of 0.5, and
solid edge with no label has weight of 0.25.

Practical Problems in VLSI Physical Design EIG Algorithm (1/11)

Adjacency Matrix

Practical Problems in VLSI Physical Design EIG Algorithm (2/11)

Degree Matrix

Practical Problems in VLSI Physical Design EIG Algorithm (3/11)

Laplacian Matrix
„ We obtain Q = D − A

Practical Problems in VLSI Physical Design EIG Algorithm (4/11)

Eigenvalue/vector Computation

Practical Problems in VLSI Physical Design EIG Algorithm (5/11)

EIG Partitioning

Practical Problems in VLSI Physical Design EIG Algorithm (6/11)

EIG Partitioning (cont)

Practical Problems in VLSI Physical Design EIG Algorithm (7/11)

EIG Partitioning (cont)

Practical Problems in VLSI Physical Design EIG Algorithm (8/11)

EIG Partitioning (cont)

Practical Problems in VLSI Physical Design EIG Algorithm (9/11)

Summary
„ Good solution found:
ƒ {(a,f,d,g,i), (j,b,h,e,c)} is well-balanced and has low RC cost.

Practical Problems in VLSI Physical Design EIG Algorithm (10/11)

Theorem

Practical Problems in VLSI Physical Design EIG Algorithm (11/11)