Multi-objective Optimization in VLSI Floorplanning

This paper describes use of a multiobjective optimization method, AMOSA to the VLSI floorplanning problem. The proposed model provides for decision maker choice from among the different trade-off solutions. The objective is to minimize the area and wirelength with the fixed out line constraint. AMOSA is improved with B*tree and B*tree coded AMOSA is introduced to improve the performance of AMOSA for VLSI floorplanning problem. The MCNC benchmarks are considered as test system. The results are compared and validated.

[1]  Wayne Wei-Ming Dai,et al.  General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[2]  Ernest S. Kuh,et al.  Sequence-pair based placement method for hard/soft/pre-placed modules , 1998, ISPD '98.

[3]  Yao-Wen Chang,et al.  B*-Trees: a new representation for non-slicing floorplans , 2000, DAC.

[4]  Alberto Sangiovanni-Vincentelli,et al.  TimberWolf3.2: A New Standard Cell Placement and Global Routing Package , 1986, DAC 1986.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  R. Otten.  Automatic Floorplan Design , 1982, DAC 1982.

[7]  A. Sangiovanni-Vincentelli,et al.  The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.

[8]  Mineo Kaneko,et al.  VLSI/PCB placement with obstacles based on sequence-pair , 1997, ISPD '97.

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

[10]  Ting-Chi Wang,et al.  An optimal algorithm for floorplan area optimization , 1990, 27th ACM/IEEE Design Automation Conference.

[11]  Igor L. Markov,et al.  Fixed-outline floorplanning through better local search , 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.

[12]  Guolong Chen,et al.  A PSO-based intelligent decision algorithm for VLSI floorplanning , 2010, Soft Comput..

[13]  Srinivas Katkoori,et al.  An Elitist Non-Dominated Sorting Based Genetic Algorithm for Simultaneous Area and Wirelength Minimization in VLSI Floorplanning , 2008, 21st International Conference on VLSI Design (VLSID 2008).

[14]  Yoji Kajitani,et al.  Module placement on BSG-structure with pre-placed modules and rectilinear modules , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.

[15]  Guolong Chen,et al.  A Discrete PSO for Multi-objective Optimization in VLSI Floorplanning , 2009, ISICA.

[16]  Ujjwal Maulik,et al.  A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA , 2008, IEEE Transactions on Evolutionary Computation.

[17]  Maolin Tang,et al.  A Genetic Algorithm for VLSI Floorplanning Using O-Tree Representation , 2005, EvoWorkshops.

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

[19]  Yao-Wen Chang,et al.  Modern floorplanning based on B/sup */-tree and fast simulated annealing , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[21]  Carl Sechen.  Chip-planning, placement, and global routing of macro/custom cell integrated circuits using simulated annealing , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

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

[23]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[24]  Rolf Drechsler,et al.  Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings , 2008, EvoWorkshops.