Presentation on theme: "ECBL: An Extended Corner Block List with Solution Space including Optimum Placement Shuo Zhou,Sheqin Dong, Xianlong Hong,Yici Cai Dept. of Computer Science."— Presentation transcript:
ECBL: An Extended Corner Block List with Solution Space including Optimum Placement Shuo Zhou,Sheqin Dong, Xianlong Hong,Yici Cai Dept. of Computer Science and Technology, Tsinghua University, Beijing 100084 P.R. China Chung-kuan Cheng Dept. of Computer Science and Engineering, University of California,San Diego La Jolla,CA 92093- 0114,USA Jun Gu Department of Computer Science, Science & Technology University of HongKong April, 2001
Bounded-Sliceline Grid (BSG) Bounded-Sliceline Grid (BSG): n x n grids BSG covers general floorplan x1x1 x2x2 x3x3 x5x5 x4x4 a d c b Thus, mosaic floorplan with n 2 dummy blocks covers general floorplan
Relations of BSG and TBT, CBL BSG: CBL, TBT ECBL(S,L,T): S= dx 5 ax 1 x 3 bx 4 x 2 c L= 10011001 T= 010010100100 x1x1 x2x2 x3x3 x5x5 x4x4 a d c b x1x1 c x4x4 b x2x2 a d x3 x5x5 x 0 0 x 1 0 10 1 0 c x4x4 b x2x2 x1x1 x3x3 a d x5x5 x 1 0 0 1 x 1 0 1 0 order( 1 )=order( 2 )=x 1 ax 2 cx 3 dx 5 x 4 b 1 =01100110, 2 =10011001
Extended Corner Block List (ECBL) Given n blocks, ECBL = corner block list (S,L,T) with n rooms, where The list (S,L,T) contains ( n -n) dummy blocks.
ECBL Complexity of transformation: O( n) ECBL n covers BSG n n #ECBL =
Approach Perturbation for simulated annealing process Exchange two labels in sequence S. Change bits in sequence L and T. Selection Of Try [1.5, …, 3]
Experimental Results The algorithm is implemented in C programming language. All experiments are performed on a SUN spark20 workstation. Our experiments do not include soft blocks. of ECBL is set between 1.8 and 2.5.
Conclusion Mosaic floorplan is extended to general floorplan. ECBL covers general floorplan, if =n. ECBL based-algorithm has the complexity of O(n) when is a constant. Experiments on benchmark show promising results.