Memetic algorithm based on hill climbing algorithm for IC partitioning

Resumen

To reduce the premature convergence of the optimization problem, the genetic algorithm with local search called “memetic algorithm” is introduced. The proposed memetic algorithm can partition a complex circuit design into a few sub-circuits. The aim of this paper is to reduce the interconnects between the partitioned blocks. The experimental results show that the method is effective for solving the given input and to find the minimum cut size. Applying memetic algorithm like Hill Climbing algorithm for 3D IC partitioning is the novelty in this work.

Biografía del autor

K. Jeya Prakash, Kalasalingam Academy of Research and Education (Deemed to be University). Krishnankoil, (India).

Assistant Professor, ECE Department, Kalasalingam Academy of Research and Education (Deemed to be University). Krishnankoil, (India).

P. Sivakumar, Kalasalingam Academy of Research and Education (Deemed to be University). Krishnankoil, (India).

Professor, ECE Department, Kalasalingam Academy of Research and Education (Deemed to be University). Krishnankoil, (India).

Publicado
2020-03-23
Cómo citar
Jeya Prakash, K., & Sivakumar, P. (2020). Memetic algorithm based on hill climbing algorithm for IC partitioning. 3C Tecnología. Glosas De Innovación Aplicadas a La Pyme, 181-193. Recuperado a partir de http://ojs.3ciencias.com/index.php/3c-tecnologia/article/view/954