An Elitist Non-Dominated Sorting Based Genetic Algorithm for Simultaneous Area and Wirelength Minimization in VLSI Floorplanning

VLSI floor-planning in the gigascale era must deal with multiple objectives including wiring congestion, performance and reliability. Genetic algorithms lend themselves naturally to multi-objective optimization. In this paper, a multi-objective genetic algorithm is proposed for floorplanning that simultaneously minimizes area and total wirelength. The proposed genetic floorplanner is the first to use non-domination concepts to rank solutions. Two novel crossover operators are presented that build floorplans using good sub-floorplans. The efficiency of the proposed approach is illustrated by the 18% wirelength savings and 4.6% area savings obtained for the GSRC benchmarks and 26% wirelength savings for the MCNC benchmarks for a marginal 1.3% increase in area when compared to previous floorplanners that perform simultaneous area and wirelength minimization.

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

[2]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[3]  T. Koide,et al.  An adaptive genetic algorithm for VLSI floorplanning based on sequence-pair , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[4]  Kalyanmoy Deb,et al.  Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence , 2001, EMO.

[5]  Martin D. F. Wong,et al.  Fast evaluation of sequence pair in block placement by longestcommon subsequence computation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Yeong-Dae Kim,et al.  A linear programming-based algorithm for floorplanning in VLSI design , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Zhong Yang,et al.  Module placement based on quadratic programming and rectangle packing using less flexibility first principle , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[8]  Larry J. Eshelman,et al.  Biases in the Crossover Landscape , 1989, ICGA.

[9]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[12]  Igor L. Markov,et al.  Are floorplan representations important in digital design? , 2005, ISPD '05.

[13]  Sung Kyu Lim,et al.  Multi-layer floorplanning for reliable system-on-package , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[14]  John E. Karro,et al.  Evolutionary algorithms for the physical design of VLSI circuits , 2003 .

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