Kernighan–Lin Algorithm (K-L Algorithm)

Embedded Systems Design and Implementation (EMBS) · HW / SW Co-Design Partitioning
Dr Steven Xiaotian Dai
Explore: Drag any node across the centre line to reassign it between SW ↔ HW — D values and cut cost update live.  |  Algorithm: Click Start KL Pass to step through the algorithm from the current partition.
✓ Converged — cut cost is locally optimal. No further improvement possible.
No improvement found in this pass — partition is already a local optimum from here.
Cut cost
14
D values  (ext − int)
NodePartDIntExt
Best swap candidate
KL Pass — Step Log
No pass in progress. Click "Start KL Pass" to begin.
Iteration Log
No passes completed yet.