Wirelength Minimization in Partitioning and Floorplanning Using Evolutionary Algorithms

Minimizing the wirelength plays an important role in physical design automation of very large-scale integration (VLSI) chips. The objective of wirelength minimization can be achieved by finding an optimal solution for VLSI physical design components like partitioning and floorplanning. In VLSI circuit partitioning, the problem of obtaining a minimum delay has prime importance. In VLSI circuit floorplanning, the problem of minimizing silicon area is also a hot issue. Reducing the minimum delay in partitioning and area in floorplanning helps to minimize the wirelength. The enhancements in partitioning and floorplanning have influence on other criteria like power, cost, clock speed, and so forth.Memetic Algorithm (MA) is an Evolutionary Algorithm that includes one or more local search phases within its evolutionary cycle to obtain the minimum wirelength by reducing delay in partitioning and by reducing area in floorplanning. MA applies some sort of local search for optimization of VLSI partitioning and floorplanning. The algorithm combines a hierarchical design technique like genetic algorithm and constructive technique like Simulated Annealing for local search to solve VLSI partitioning and floorplanning problem. MA can quickly produce optimal solutions for the popular benchmark.

[1]  Guo-Fang Nan,et al.  Two novel encoding strategies based genetic algorithms for circuit partitioning , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[2]  Dinesh Bhatia,et al.  Partitioning under timing and area constraints , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[3]  P. Subbaraj,et al.  An efrfective memetic algorithm for VLSI partitioning problem , 2007 .

[4]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[5]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[6]  V. Cutello,et al.  Graph partitioning using genetic algorithms with ODPX , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[7]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[8]  Hesham H. Ali,et al.  New graph-based algorithms for partitioning VLSI circuits , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[9]  Hameem Shanavas,et al.  Hybrid Algorithmical Approach for VLSI Physical Design - Floorplanning , 2009 .

[10]  Sadiq M. Sait,et al.  General iterative heuristics for VLSI multiobjective partitioning , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[11]  Naveed A. Sherwani.  Algorithms for VLSI Physcial Design Automation , 1998 .

[12]  Xin Yao,et al.  A Memetic Algorithm for VLSI Floorplanning , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  I HameemShanavas.,et al.  Evolutionary Algorithmical Approach for VLSI Floorplanning Problem , 2009 .

[14]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[15]  Ioannis G. Karafyllidis,et al.  Genetic partitioning and placement for VLSI circuits , 1999, ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357).

[16]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

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

[18]  Theodore W. Manikas,et al.  Genetic Algorithms vs. Simulated Annealing: A Comparison of Approaches for Solving the Circuit Partitioning Problem , 1996 .

[19]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[20]  Frank M. Johannes.  Partitioning of VLSI circuits and systems , 1996, DAC '96.

[21]  L. Ingber.  Very fast simulated re-annealing , 1989 .

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

[23]  A. Yodtean,et al.  Hybrid algorithm for bisection circuit partitioning , 2004, 2004 IEEE Region 10 Conference TENCON 2004..