Presentation is loading. Please wait.

Presentation is loading. Please wait.

Floorplan Sizing 1. Floorplanning Algorithms Common Goals  To minimize the total length of interconnect, subject to an upper bound on the floorplan area.

Published byClifton Hodges Modified over 9 years ago

Similar presentations

Presentation on theme: "Floorplan Sizing 1. Floorplanning Algorithms Common Goals  To minimize the total length of interconnect, subject to an upper bound on the floorplan area."— Presentation transcript:

1 Floorplan Sizing 1

2 Floorplanning Algorithms Common Goals  To minimize the total length of interconnect, subject to an upper bound on the floorplan area or  To simultaneously optimize both wire length and area 2

3 3 3.5.1Floorplan Sizing Shape functions Legal shapes w h w h Block with minimum width and height restrictions ha*aw  Aha*aw  A Otten, R.: Efficient Floorplan Optimization. Int. Conf. on Computer Design, 499-502, 1983 Legal shapes

4 4 3.5.1Floorplan Sizing Shape functions w h Hard library block Otten, R.: Efficient Floorplan Optimization. Int. Conf. on Computer Design, 499-502, 1983 w h Discrete (h,w) values

5 5 3.5.1Floorplan Sizing Corner points 5 2 2 5 25 2 5 w h

6 مرتضي صاحب الزماني 6 Slicing Floorplan Sizing

7 Floorplan Sizing Algorithm:  finds the minimum floorplan area for a given slicing floorplan in polynomial time.  For non-slicing floorplans, the problem is NP-hard.  Construct the shape functions of all individual blocks Bottom up:  Determine the shape function of the top-level floorplan from the shape functions of the individual blocks Top down:  From the corner point (minimum top-level floorplan area), trace back to each block’s shape function −Find that block’s dimensions and location 7

8 8 4 2 2 4 Block B: Block A: 5 5 3 3 Step 1: Construct the shape functions of the blocks 3.5.1Floorplan Sizing – Example

9 9 4 2 2 4 Block B: Block A: 5 5 3 3 3.5.1Floorplan Sizing – Example 2 4 h 6 w 26 4 5 3 Step 1: Construct the shape functions of the blocks

10 10 4 2 2 4 Block B: Block A: 5 5 3 3 3.5.1Floorplan Sizing – Example 2 4 h w 26 4 6 3 5 Step 1: Construct the shape functions of the blocks

11 11 4 2 2 4 Block B: Block A: 5 5 3 3 w 26 2 4 h 4 6 hA(w)hA(w) 3.5.1Floorplan Sizing – Example Step 1: Construct the shape functions of the blocks

12 12 4 2 2 4 Block B: Block A: 5 5 3 3 hB(w)hB(w) w 26 2 4 h 4 6 hA(w)hA(w) 3.5.1Floorplan Sizing – Example Step 1: Construct the shape functions of the blocks

13 13 w 26 2 4 h 4 6 hB(w)hB(w) hA(w)hA(w) 8 3.5.1Floorplan Sizing – Example Step 2: Determine the shape function of the top- level floorplan (vertical)

14 14 w 26 2 4 h 4 6 hB(w)hB(w) hA(w)hA(w) 8 3.5.1Floorplan Sizing – Example Step 2: Determine the shape function of the top- level floorplan (vertical)

15 15 w 26 2 4 h 4 6 w 26 2 4 h 4 6 hB(w)hB(w) hA(w)hA(w) hB(w)hB(w) hA(w)hA(w) hC(w)hC(w) 88 3.5.1Floorplan Sizing – Example Step 2: Determine the shape function of the top- level floorplan (vertical)

16 16 w 26 2 4 h 4 6 w 26 2 4 h 4 6 hB(w)hB(w) hA(w)hA(w) hB(w)hB(w) hA(w)hA(w) hC(w)hC(w) 5 x 5 88 3.5.1Floorplan Sizing – Example Step 2: Determine the shape function of the top- level floorplan (vertical)

17 17 w 26 2 4 h 4 6 w 26 2 4 h 4 6 hB(w)hB(w) hA(w)hA(w) hB(w)hB(w) hA(w)hA(w) hC(w)hC(w) 3 x 9 4 x 7 5 x 5 88 3.5.1Floorplan Sizing – Example Step 2: Determine the shape function of the top- level floorplan (vertical)

18 18 w 26 2 4 h 4 6 w 26 2 4 h 4 6 hB(w)hB(w) hA(w)hA(w) hB(w)hB(w) hA(w)hA(w) hC(w)hC(w) 3 x 9 4 x 7 5 x 5 88 Minimimum top-level floorplan with vertical composition 3.5.1Floorplan Sizing – Example Step 2: Determine the shape function of the top- level floorplan (vertical)

19 19 w 26 2 4 h 4 6 w 26 2 4 h 4 6 hA(w)hA(w) hB(w)hB(w)hC(w)hC(w) hA(w)hA(w) hB(w)hB(w) 9 x 3 7 x 4 5 x 5 8 8 3.5.1Floorplan Sizing – Example Minimimum top-level floorplan with horizontal composition Step 2: Determine the shape function of the top- level floorplan (vertical)

20 20 3.5.1Floorplan Sizing – Example Step 3: Find the individual blocks’ dimensions and locations w 26 2 4 h 4 6 8 (1) Minimum area floorplan: 5 x 5 Horizontal composition

21 21 w 26 2 4 h 4 6 (1) Minimum area floorplan: 5 x 5 (2) Derived block dimensions : 2 x 4 and 3 x 5 8 3.5.1Floorplan Sizing – Example Step 3: Find the individual blocks’ dimensions and locations Horizontal composition

22 22 2 x 43 x 5 5 x 5 3.5.1Floorplan Sizing – Example Step 3: Find the individual blocks’ dimensions and locations w 26 2 4 h 4 6 (1) Minimum area floorplan: 5 x 5 (2) Derived block dimensions : 2 x 4 and 3 x 5 8 Horizontal composition

23 23 2 x 43 x 5 5 x 5 Resulting slicing tree B V A BA 3.5.1Floorplan Sizing – Example

24 24 DeFer: Deferred Decision Making Enabled Fixed-Outline Floorplanner DAC 2008 Jackey Z. Yan Chris Chu

25 25 Fixed-Outline Floorplanning

26 26 Constraints of Ordinary Slicing Tree A B C ED H H V BA C V D E Block orientation Slice line direction (H/V) Left-right or top-bottom relative order

27 27 DDM in Shape/Orientation  Defer the decision for subfloorplan (i.e., block) orientation until the end H H V BA CV D E Pick any point! Fixed-outline region A B C E D H W A A

28 28 DDM in Relative Order  The relative order (left-right / top-down) between subfloorplans does not affect the shape curves AB V BA A V AB B Same shape curve  Decision on subfloorplan relative order will be made at the end to minimize HPWL H W ABV H W BAV V BA V BA V BA and

29 29 DDM in Slice Line Direction  Two combine operators in ordinary slicing tree A B H BA AB V BA A B H BA AB V BA BA and  Generalized combine operator

30 30 Floorplans by Generalized Slicing Tree AB Block orientation Slice line direction Left-right or top-bottom relative order Deferred Decision Making (DDM)

31 31 Shape Curve Operation for H W A B ( i ) Addition C h C v ( iii ) Merging H W W=H C v C AB C ABC C h ( ii ) Flipping H W W=H C h

32 DeFer  Binary and source code in −http://www.public.iastate.edu/~zijunyan/ 32

33 Cluster Growth Cluster growth:  Iteratively add blocks to the cluster until all blocks are assigned −Merged either horizontally, vertically, or diagonally with the cluster.  Only the different orientations of the blocks (instead of the shape/aspect ratio) are taken into account 33 w h w h w h aaa b b c Growth direction 2 4 6 4 6 4 © 2011 Springer Verlag

34 Cluster Growth Cluster growth:  Blocks b and c are placed so that the increase to the floorplan’s dimensions is minimum. Linear ordering  to minimize total wirelength of connections between blocks 34 w h w h w h aaa b b c Growth direction 2 4 6 4 6 4 © 2011 Springer Verlag

35 Linear Ordering Linear-ordering algorithms  often invoked to produce initial placement solutions for iterative-improvement placement algorithms. Linear-ordering objective:  Arrange blocks in a single row so as to minimum total wirelength of connections  Initial block: −Either randomly −Or based on number of connections to others 35

36 Linear Ordering Categories of nets for a block:  Terminating nets: −have no other incident blocks that are unplaced.  New nets −have no pins on any block from the partially- constructed ordering.  Continuing nets −have at least one pin on a block from the partially-constructed ordering and at least one pin on an unordered block. 36

37 Linear Ordering 37 … Terminating netsNew nets Continuing nets

38 Cluster Growth Example cluster growth.ppt 38

39 Cluster Growth Example Given: (1)blocks a-e (2)linear ordering. a:  (w a = 2, h a = 3) or (w a = 3, h a = 2) b:  (w b = 2, h b = 1) or (w b = 1, h b = 2) c:  (w c = 2, h c = 4) or (w c = 4, h c = 2) d:  (w d = 3, h d = 3) e:  (w e = 6, h e = 1) or (w e = 1, h e = 6) Task:  find a floorplan with minimum global bounding box area. 39 Growth direction

40 Cluster Growth Example 40

41 Cluster Growth Example 41

Download ppt "Floorplan Sizing 1. Floorplanning Algorithms Common Goals  To minimize the total length of interconnect, subject to an upper bound on the floorplan area."

Similar presentations

Technology Mapping. Perform the final gate selection from a particular library Two basic approaches 1. ruled based technique 2. graph covering technique.

Technology Mapping. Perform the final gate selection from a particular library Two basic approaches 1. ruled based technique 2. graph covering technique.
© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.

© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
Linear Constraint Graph for Floorplan Optimization with Soft Blocks Jia Wang Electrical and Computer Engineering Illinois Institute of Technology Chicago,

Linear Constraint Graph for Floorplan Optimization with Soft Blocks Jia Wang Electrical and Computer Engineering Illinois Institute of Technology Chicago,
Label Placement and graph drawing Imo Lieberwerth.

Label Placement and graph drawing Imo Lieberwerth.
A Size Scaling Approach for Mixed-size Placement Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan School of Electrical and Computer Engineering.

A Size Scaling Approach for Mixed-size Placement Kalliopi Tsota, Cheng-Kok Koh, Venkataramanan Balakrishnan School of Electrical and Computer Engineering.
Ch.7 Layout Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.

Ch.7 Layout Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.
Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, 47907-2035 Mixed Integer Programming Models.

Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, Mixed Integer Programming Models.
Chapter 3 The Greedy Method 3.

Chapter 3 The Greedy Method 3.
2015-6-3Windows Scheduling Problems for Broadcast System 1 Amotz Bar-Noy, and Richard E. Ladner Presented by Qiaosheng Shi.

Windows Scheduling Problems for Broadcast System 1 Amotz Bar-Noy, and Richard E. Ladner Presented by Qiaosheng Shi.
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.

Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
Chapter 3 – Chip Planning

Chapter 3 – Chip Planning
3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.

3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.
Floorplanning Professor Lei He

Floorplanning Professor Lei He
Multi-Layer Channel Routing Complexity and Algorithm Rajat K. Pal.

Multi-Layer Channel Routing Complexity and Algorithm Rajat K. Pal.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.

Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Chapter 3 – Chip Planning 3.1 Introduction to.

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Chapter 3 – Chip Planning 3.1 Introduction to.
CSE 242A Integrated Circuit Layout Automation Lecture: Floorplanning Winter 2009 Chung-Kuan Cheng.

CSE 242A Integrated Circuit Layout Automation Lecture: Floorplanning Winter 2009 Chung-Kuan Cheng.
Multi-Layer Channel Routing Complexity and Algorithm Rajat K. Pal.

Multi-Layer Channel Routing Complexity and Algorithm Rajat K. Pal.
CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.

CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.
Cost-Based Tradeoff Analysis of Standard Cell Designs Peng Li Pranab K. Nag Wojciech Maly Electrical and Computer Engineering Carnegie Mellon University.

Cost-Based Tradeoff Analysis of Standard Cell Designs Peng Li Pranab K. Nag Wojciech Maly Electrical and Computer Engineering Carnegie Mellon University.

Similar presentations

Ads by Google