Академический Документы
Профессиональный Документы
Культура Документы
KL Partitioning (1/6)
Clustering
KL Partitioning (2/6)
KL Partitioning (3/6)
Cut 1=4
Cut 2=4
Size 1=15 Size 2=16
Size 3=17
[Sherwani]
Hierarchical Partitioning
Levels of partitioning:
System-level partitioning:
Each sub-system can be designed as a single PCB
Board-level partitioning:
Circuit assigned to a PCB is partitioned into subcircuits
each fabricated as a VLSI chip
Chip-level partitioning:
Circuit assigned to the chip is divided into
manageable sub-circuits
[Sherwani]
System Hierarchy
Levels of Partitioning
System
System Level Partitioning
PCBs
Board Level Partitioning
Chips
Chip Level Partitioning
Subcircuits
/ Blocks
x
B
10x
D
C
PCB1
PCB2
20x
[Sherwani]
Circuit partitioning
KL Partitioning (9/6)
Problem Definition
Definition: Given a graph G(V, E) edge weighted undirected graph, where each vertex
v V has a size s(v), and each edge e E has a weight w(e), the problem is to divide
the set V into k subsets Vl, V2, . . . , Vk, such that an objective function is optimized,
subject to certain constraints.
KL Partitioning (10/6)
KL Partitioning (11/6)
KL Partitioning (12/6)
s
(
v
)
k
k vV
Vi s (v)
vVi
where |Vi| and |V| are the sizes of the set Vi and V respectively.
KL Partitioning (15/6)
KL Algorithm
Limitations
KL Partitioning (18/6)
Kernighan-Lin Algorithm
First Swap
gD
2C
x
y
xy
Cut size or cost function= 5
KL Partitioning (20/6)
Second Swap
Cut size = 3
KL Partitioning (21/6)
Third Swap
Cut Size = 3
KL Partitioning (22/6)
Fourth Swap
Cut size = 4
Cut size = 5
KL Partitioning (23/6)
Summary
Give the cutsize after each swap? What are the initial, the
final and the best cutsizes covered during the pass.
Two best solutions found (solutions are always area-balanced)
If gain > 0; cut cost
If gain < 0; cut cost
Known as look ahead Algo.
KL Partitioning (24/6)
Cii = Cjj =0
2
3
Assume network with
same sizes and each
edge has a weight
assign to 1.
0 10000
101100
C36
C46
C56
C66
01000 0
010011
00010 1
00011 0
If all connections are equal in importance the elements of the cost matrix are
1 or 0, costs may be higher than 1 also.
KL Partitioning (25/6)
An edge weighted graph is not the exact model of a network for partitioning
n4
n1
n2
n3
n5
KL Partitioning (26/6)
KL Partitioning (27/6)
Hypergraph
(Ref. Wikipedia)
A hypergraph is a generalization of a
graph in which an edge can connect
any number of vertices. A hypergraph H
is a pair H(X, E), where X is a set of
elements called nodes or vertices and E
is a set of non empty subsets of X
called hyper edges or edges.
KL Partitioning (28/6)
References
1.
2.
3.
4.
5.
6.
KL Partitioning (29/6)