Scribd
Upload
62 views10 pages

Partitioning

The document discusses the circuit partitioning algorithm KLFM. It works by iteratively moving nodes between partitions to minimize the cutsize, which is the number of connections between partitions. It starts with an initial partition and then repeatedly moves the node that reduces the cutsize the most, locking nodes in place once moved, until no improvements can be found or size constraints are violated.

Uploaded by

Praveen Andrew
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
62 views10 pages

Partitioning

The document discusses the circuit partitioning algorithm KLFM. It works by iteratively moving nodes between partitions to minimize the cutsize, which is the number of connections between partitions. It starts with an initial partition and then repeatedly moves the node that reduces the cutsize the most, locking nodes in place once moved, until no improvements can be found or size constraints are violated.

Uploaded by

Praveen Andrew
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

Circuit Partitioning

Divides circuit into smaller partitions that can be efficiently handled Goal is generally to minimize communication between balanced partitions Kernighan-Lin Fiduccia-Mattheyses (KLFM) is popular algorithm

KLFM Algorithm

Basic Idea:

Start with initial partition Iteratively improves cutsize

Cutsize is number of edges between partitions Node that gives greatest reduction or least degradation

Moves one node at a time

Lock node after moving Continue moving nodes until all locked or size contraints are violated Find best partitioning, unlock all nodes Repeat until no improvement found

KLFM Algorithm
Initial Partition
Maximum Size = 4 Size = 3 Size = 3 Cutsize = 5

KLFM Algorithm
Maximum Size = 4 Size = 4 Size = 2 Cutsize = 3

KLFM Algorithm
Maximum Size = 4 Size = 3 Size = 3 Cutsize = 2

KLFM Algorithm
Maximum Size = 4 Size = 2 Size = 4 Cutsize = 2

KLFM Algorithm
Maximum Size = 4 Size = 3 Size = 3 Cutsize = 4

KLFM Algorithm
Maximum Size = 4 Size = 2 Size = 4 Cutsize = 4

KLFM Algorithm
Maximum Size = 4 Size = 3 Size = 3 Cutsize = 5

KLFM Algorithm
Backtrack to minimum cut size, unlock nodes, and repeat
Size = 3 Size = 3 Cutsize = 2

You might also like