Optimal Solution for VLSI Physical Design Automation Using Hybrid Genetic Algorithm

In Optimization of VLSI Physical Design, area minimization and interconnect length minimization is an important objective in physical design automation of very large scale integration chips. The objective of minimizing the area and interconnect length would scale down the size of integrated chips. To meet the above objective, it is necessary to find an optimal solution for physical design components like partitioning, floorplanning, placement, and routing. This work helps to perform the optimization of the benchmark circuits with the above said components of physical design using hierarchical approach of evolutionary algorithms. The goal of minimizing the delay in partitioning, minimizing the silicon area in floorplanning, minimizing the layout area in placement, minimizing the wirelength in routing has indefinite influence on other criteria like power, clock, speed, cost, and so forth. Hybrid evolutionary algorithm is applied on each of its phases to achieve the objective. Because evolutionary algorithm that includes one or many local search steps within its evolutionary cycles to obtain the minimization of area and interconnect length. This approach combines a hierarchical design like genetic algorithm and simulated annealing to attain the objective. This hybrid approach can quickly produce optimal solutions for the popular benchmarks.

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

[2]  Michael John Sebastian Smith,et al.  Application-specific integrated circuits , 1997 .

[3]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  I. Hameem Shanavas,et al.  Wirelength Minimization in Partitioning and Floorplanning Using Evolutionary Algorithms , 2011, VLSI Design.

[5]  H. Shanavas Evolutionary Algorithmical Approach for VLSI Floorplanning Problem , 2022 .

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

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

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

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

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

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

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

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

[14]  Ning Xu,et al.  A Fast Algorithm for VLSI Building Block Placement , 2006, The Proceedings of the Multiconference on "Computational Engineering in Systems Applications".

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

[16]  I. Hameem Shanavas,et al.  Application Metaheuristic Technique for Solving VLSI Global Routing Problem , 2009, 2009 International Conference on Advances in Recent Technologies in Communication and Computing.

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

[18]  Majid Sarrafzadeh,et al.  An Introduction To VLSI Physical Design , 1996 .

[19]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

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

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

[22]  Yao-Wen Chang,et al.  B*-trees: a new representation for non-slicing floorplans , 2000, Proceedings 37th Design Automation Conference.

[23]  Lester,et al.  Very Fast Simulated Re-Annealing Ingber , Lester , 1989 .