Memetic algorithm based on hill climbing algorithm for IC partitioning

Descargar PDF Descargar PDF

Publicado en 3C Tecnología. Special Issue – March 2020



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.


Palabras clave

Memetic algorithm, Genetic algorithm, Circuit partition, Cut size.

Articulos relacionados