VLSI Design Partitioning - Very Large Scale Integration - Practical Problems
JasonPulikkottil
146 views
30 slides
Jul 30, 2024
Slide 1 of 30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
About This Presentation
Practical Problems in VLSI Physical Design
Size: 860.83 KB
Language: en
Added: Jul 30, 2024
Slides: 30 pages
Slide Content
Practical Problems in VLSIPhysical Design
FBB Algorithm (1/6)
„
Perform flow-based bipartitioningunder:
ƒ
Area constraint [4,5]
ƒ
Source = a, sink = i
ƒ
Break ties alphabetically
Network Flow-based Bipartitioning
Practical Problems in VLSIPhysical Design
FBB Algorithm (2/6)
First Max-Flow and Its Cut
Practical Problems in VLSIPhysical Design
FBB Algorithm (3/6)
First Node Merging
Practical Problems in VLSIPhysical Design
FBB Algorithm (4/6)
Second Max-Flow and Its Cut
Practical Problems in VLSIPhysical Design
FBB Algorithm (5/6)
Second Node Merging
Practical Problems in VLSIPhysical Design
FBB Algorithm (6/6)
Third Max-Flow and Its Cut
Practical Problems in VLSIPhysical Design
FBB Algorithm (1/6)
„
Perform flow-based bipartitioningunder:
ƒ
Area constraint [4,5]
ƒ
Source = a, sink = i
ƒ
Break ties alphabetically
Network Flow-based Bipartitioning
Practical Problems in VLSIPhysical Design
FBB Algorithm (2/6)
First Max-Flow and Its Cut
Practical Problems in VLSIPhysical Design
FBB Algorithm (3/6)
First Node Merging
Practical Problems in VLSIPhysical Design
FBB Algorithm (4/6)
Second Max-Flow and Its Cut
Practical Problems in VLSIPhysical Design
FBB Algorithm (5/6)
Second Node Merging
Practical Problems in VLSIPhysical Design
FBB Algorithm (6/6)
Third Max-Flow and Its Cut
Practical Problems in VLSIPhysical Design
FM Partitioning (1/12)
„
Perform FM algorithm on the following circuit:
ƒ
Area constraint = [3,5]
ƒ
Break ties in alphabetical order.
Fiduccia-MattheysesAlgorithm
Practical Problems in VLSIPhysical Design
FM Partitioning (2/12)
Initial Partitioning „
Random initial partitioning is given.
Practical Problems in VLSIPhysical Design
FM Partitioning (3/12)
Gain Computation and Bucket Set Up
Practical Problems in VLSIPhysical Design
FM Partitioning (4/12)
First Move
Practical Problems in VLSIPhysical Design
FM Partitioning (5/12)
Second Move
Practical Problems in VLSIPhysical Design
FM Partitioning (6/12)
Third Move
Practical Problems in VLSIPhysical Design
FM Partitioning (7/12)
Forth Move
Practical Problems in VLSIPhysical Design
FM Partitioning (8/12)
Fifth Move
Practical Problems in VLSIPhysical Design
FM Partitioning (9/12)
Sixth Move
Practical Problems in VLSIPhysical Design
FM Partitioning (10/12)
Seventh Move
Practical Problems in VLSIPhysical Design
FM Partitioning (11/12)
Last Move
Practical Problems in VLSIPhysical Design
FM Partitioning (12/12)
Summary „
Found three best solutions.
ƒ
Cutsizereduced from 6 to 3.
ƒ
Solutions after move 2 and 4 are better balanced.
Practical Problems in VLSIPhysical Design
KL Partitioning (1/6)
„
Perform single KL pass on the following circuit:
ƒ
KL needs undirected graph (clique-based weighting)
Kernighan-Lin Algorithm
Practical Problems in VLSIPhysical Design
KL Partitioning (2/6)
First Swap
Practical Problems in VLSIPhysical Design
KL Partitioning (3/6)
Second Swap
Practical Problems in VLSIPhysical Design
KL Partitioning (4/6)
Third Swap
Practical Problems in VLSIPhysical Design
KL Partitioning (5/6)
Fourth Swap „
Last swap does not require gain computation
Practical Problems in VLSIPhysical Design
KL Partitioning (6/6)
Summary „
Cutsizereduced from 5 to 3
ƒ
Two best solutions found (solu tions are always area-balanced)