A parallel VLSI floorplanning algorithm using corner block list topological representation

Floorplanning is a critical phase in the physical design of VLSI circuits and has been acknowledged as a computation-intensive process. As a result, several research efforts have been undertaken to parallelize the algorithm. While previous work has been focused on slicing the floorplan, we present a parallel algorithm for a non-slicing floorplan using corner block list (CBL) topological representation. A parallel interconnection cost calculation algorithm with load balancing strategy is initiated in order to speed up the especially time consuming wire length calculation in floorplanning. A multiple Markov chains strategy is also embedded in our algorithm. The experimental results obtained from the tests on MCNC benchmarks indicate considerable speedup and preserved floorplanning quality.

[1]  Emile H. L. Aarts,et al.  Parallel implementations of the statistical cooling algorithm , 1986, Integr..

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

[3]  Cheng-Hsi Chen,et al.  A fast parallel algorithm for slicing floorplans , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[4]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Wenjun Zhuang,et al.  Implementation of a parallel genetic algorithm for floorplan optimization on IBM SP2 , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.

[6]  Takeshi Yoshimura,et al.  An O-tree representation of non-slicing floorplan and its applications , 1999, DAC '99.

[7]  Kyung-Geun Lee,et al.  Asynchronous Communication of Multiple Markov Chains in Parallel Simulated Annealing , 1992, ICPP.

[8]  Vipin Kumar,et al.  Floorplan optimization on multiprocessors , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[9]  Hidetoshi Onodera,et al.  Branch-and-bound placement for building block layout , 1991, 28th ACM/IEEE Design Automation Conference.

[10]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[11]  Daniel R. Greening,et al.  Parallel simulated annealing techniques , 1990 .

[12]  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).

[13]  Cheng-Hsi Chen,et al.  Parallel algorithms for slicing floorplan designs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[14]  R. H. J. M. Otten,et al.  The Annealing Algorithm , 1989 .

[15]  John A. Chandy,et al.  Parallel simulated annealing strategies for VLSI cell placement , 1996, Proceedings of 9th International Conference on VLSI Design.