Professional Documents
Culture Documents
․Course contents:
⎯ Binary search trees
⎯ Red-black trees
․Readings:
⎯ Chapters 10 (self reading), 12, 13
Pentium 4
PowerPC
Unit 3 Y.-W. Chang 2
B*-tree: A Binary Tree Modeling for Floorplans
․ Chang et al., “B*-tree: A new representation for non-slicing
floorplans,” ACM/IEEE Design Automation Conference, 2000.
․ Apply the Depth-First Search (DFS) to construct the tree.
⎯ left child: adjacent, bottom-most module on the right.
n0
b5 b6
b10
n7 n1
b1 b3 b
4
b2 n8 n2 n5
b9
b0 n11 n9 n3 n6
b8 b11
b7
n10 n4
Compacted floorplan
B*-tree
Unit 3 Y.-W. Chang 3
B*-tree Based Floorplanner for Complex Designs
y
x
y
x 4
left rotate
Pentium 4
PowerPC
Unit 3 Y.-W. Chang 31
Slicing Tree
․ Otten, “Automatic floorplan design,” ACM/IEEE Design Automation
Conference, 1982.
․ Binary-tree structure for slicing floorplans.
⎯ An internal node denotes a vertical or a horizontal cut.
V
H H
b3
b1
2 1 H 3
b4 b5
b2 V V
b6 b7
6 7 4 5
n0
b5 b6
b10
n7 n1
b1 b3 b
4
b2 n8 n2 n5
b9
b0 n11 n9 n3 n6
b8 b11
b7
n10 n4
Compacted floorplan
B*-tree
Unit 3 Y.-W. Chang 33
Cost Evaluation: Packing
․ x-coordinates can be determined by the tree structure.
⎯ Left child: the lowest, adjacent block on the right (xj = xi + wi).
⎯ Right child: the first block above, with the same x-coordinate
(xj = xi).
․ y-coordinates?
b5 b6 n0
b10 n7 n1
b
b11 b3
b4
b2
x1=x0 n8 n2 n5
b9
b00
b8 b11 n11 n9 n3 n6
b7
(x0,y0) n10 n4
x7=x0+w0
w0
Unit 3 Y.-W. Chang 34
Computing y-coordinates
․Reduce the complexity of computing a y-coordinate to
amortized O(1) time.
horizontal contour
vertical contour
b10
b1 b3 b
4
b9
b0
b8 b11
b7
2 2 2
4 7 4 3 4 7
Op3(7, 3) Op2(11, 5)
1 6 12 1 6 12 1 6 12
13 5 3 11 13 5 7 11 13 5 3 10
15 10 15 10 15 11 9
9 9
14
14 14
8
8 8