Variable-Order Ant System for VLSI multiobjective floorplanning

Floorplanning is crucial in VLSI chip design as it determines the time-to-market and the quality of the product. In this work, Variable-Order Ant System (VOAS) is developed and combined with a floorplan model namely Corner List (CL) to optimize the area and wirelength. CL is used to represent the floorplan layout. Although CL has proven to have the same search space and time complexity as Corner Sequence (CS), comparatively, CL has more corners to be selected. This compensates the sequence weakness, where modules can be placed freely onto the corners, which are not bounded by the floorplan contour. Two groups of ants, namely VOAS and reconnaissance ants, which will collaborate with each other to determine the local information, are introduced. Through this cooperation, VOAS ant can ascertain its local information greedily, based on the local search space information carried out by reconnaissance ants. Subsequently, VOAS ant proposes a new variable-order property to prioritize the global and local explorations. The variable-order property enables the ants in VOAS to weigh a better choice of modules for the floorplanning, based on the local and global information. The update rules of VOAS are modified in order to handle two-dimensional problem, such as VLSI floorplanning. VOAS shows improved results in terms of purely area optimization as well as composite function of area and wirelength, as compared to other state-of-the-art and recent floorplanning/placement algorithms based on Microelectronics Centre of North Carolina (MCNC) and Gigascale Systems Research Center (GSRC) benchmarks.

[1]  Yao-Wen Chang,et al.  Corner sequence - a P-admissible floorplan representation with a worst case linear-time packing scheme , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Yici Cai,et al.  Corner block list representation and its application to floorplan optimization , 2004, IEEE Transactions on Circuits and Systems II: Express Briefs.

[3]  Ning Xu,et al.  Hybrid Algorithm for Floorplanning Using B*-tree Representation , 2009, 2009 Third International Symposium on Intelligent Information Technology Application.

[4]  Yao-Wen Chang,et al.  TCG: A transitive closure graph-based representation for general floorplans , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[5]  Maurizio Rebaudengo,et al.  GALLO: a genetic algorithm for floorplan area optimization , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Yiming Li,et al.  Temperature Aware Floorplanning via Geometry Programming , 2008, CSE 2008.

[7]  Milan Tuba,et al.  An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem , 2011, Appl. Soft Comput..

[8]  Li-Sheng Hu,et al.  A model induced max-min ant colony optimization for asymmetric traveling salesman problem , 2013, Appl. Soft Comput..

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

[10]  M. Montaz Ali,et al.  A Hybrid Simulated Annealing Algorithm for Nonslicing VLSI Floorplanning , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[11]  Yao-Wen Chang,et al.  TCG-S: orthogonal coupling of P/sup */-admissible representations for general floorplans , 2004, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[13]  De-Sheng Chen,et al.  Fixed-outline floorplanning using robust evolutionary search , 2007, Eng. Appl. Artif. Intell..

[14]  Martin D. F. Wong,et al.  FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.

[15]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

[17]  Srinivas Katkoori,et al.  Ant colony system application to macrocell overlap removal , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

[19]  Takeshi Yoshimura,et al.  An enhanced perturbing algorithm for floorplan design using the O-tree representation , 2000, ISPD '00.

[20]  Serhiy D. Shtovba Ant Algorithms: Theory and Applications , 2005, Programming and Computer Software.

[21]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[22]  Igor L. Markov,et al.  Practical slicing and non-slicing block-packing without simulated annealing , 2004, GLSVLSI '04.

[23]  Yoji Kajitani,et al.  An enhanced Q-sequence augmented with empty-room-insertion and parenthesis trees , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[24]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[25]  Jing Liu,et al.  Multiagent evolutionary algorithm for floorplanning using moving block sequence , 2007, 2007 IEEE Congress on Evolutionary Computation.

[26]  Jianli Chen,et al.  A Hybrid Evolution Algorithm for VLSI Floorplanning , 2010, 2010 International Conference on Computational Intelligence and Software Engineering.

[27]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[28]  Hai Zhou,et al.  ACG-adjacent constraint graph for general floorplans , 2004, IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings..

[29]  Yiming Li,et al.  Temperature Aware Floorplanning via Geometry Programming , 2008, 2008 11th IEEE International Conference on Computational Science and Engineering - Workshops.

[30]  Chris C. N. Chu,et al.  DeFer: Deferred Decision Making Enabled Fixed-Outline Floorplanning Algorithm , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[31]  S. Anand,et al.  Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem , 2011, Computational Optimization and Applications.

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

[33]  Sung-Woo Hur,et al.  A fast algorithm for context-aware buffer insertion , 2002, TODE.

[34]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

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

[36]  Igor L. Markov,et al.  Fixed-outline floorplanning: enabling hierarchical design , 2003, IEEE Trans. Very Large Scale Integr. Syst..

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

[38]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[39]  Takeshi Yoshimura,et al.  Floorplanning using a tree representation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[40]  Majid Sarrafzadeh,et al.  Fast floorplanning for effective prediction and construction , 2001, IEEE Trans. Very Large Scale Integr. Syst..

[41]  Adam Janiak,et al.  New perspectives in VLSI design automation: deterministic packing by Sequence Pair , 2010, Ann. Oper. Res..

[42]  Guan-Chun Luh,et al.  Structural topology optimization using ant colony optimization algorithm , 2009, Appl. Soft Comput..

[43]  Jing Liu,et al.  Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning With Arbitrarily Shaped Rectilinear Blocks , 2008, IEEE Transactions on Evolutionary Computation.

[44]  Harikrishnan Ramiah,et al.  Hierarchical congregated ant system for bottom-up VLSI placements , 2013, Eng. Appl. Artif. Intell..

[45]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.