FAST-CBL: a fast floorplanning algorithm based on corner block list representation

We present FAST-CBL, a fast floorplanning algorithm based on corner block list representation. By reusing the common largest sub-floorplan of the floorplans of two neighboring solutions in the annealing process, FAST-CBL reduces the overall computations, and thus achieves a significant improvement over the original algorithm. Both theoretical analysis and experimental results demonstrate that our floorplanning algorithm is quite efficient.

[1]  Ronald L. Graham,et al.  Revisiting floorplan representations , 2001, ISPD '01.

[2]  Yici Cai,et al.  Corner block list: an effective and efficient topological representation of non-slicing floorplan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[3]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

[4]  Evangeline F. Y. Young,et al.  Twin binary sequences: a non-redundant representation for general non-slicing floorplan , 2002, ISPD '02.

[5]  Yao-Wen Chang,et al.  B*-trees: a new representation for non-slicing floorplans , 2000, Proceedings 37th Design Automation Conference.

[6]  Yao-Wen Chang,et al.  TCG: a transitive closure graph-based representation for non-slicing floorplans , 2001, DAC '01.

[7]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.