
3D‐IC partitioning method based on genetic algorithm
Author(s) -
Meitei Naorem Yaipharenba,
Baishnab Krishna Lal,
Trivedi Gaurav
Publication year - 2020
Publication title -
iet circuits, devices and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.251
H-Index - 49
eISSN - 1751-8598
pISSN - 1751-858X
DOI - 10.1049/iet-cds.2020.0128
Subject(s) - crossover , genetic algorithm , simulated annealing , algorithm , computer science , parallel computing , mathematical optimization , mathematics , artificial intelligence
In this study, a new tier partitioning algorithm for three‐dimensional integrated circuits (3D ICs) using a genetic algorithm (GA) is presented. Design parameters for the proposed 3D IC partitioning method are average layer power density and number of through‐silicon vias (TSVs) subject to fixed‐outline constraint. The GA with newly introduced crossover and mutation operation, termed as even crossover and complement mutation, is employed for optimisation of design variables. Experimental results exhibit that the authors proposed method reduces the average number of TSVs by 45.75 and 44.68%, as compared to taboo search and simulated annealing‐based 3D partitioning methods. It also reduces the average number of TSVs, maximum power density among the layers and average layer area by 28.34, 40.29, and 27.85%, respectively, as compared to thermal‐aware 3D partitioning technique. The results of their proposed algorithm demonstrate the efficiency and effectiveness in tier partitioning for 3D ICs over existing methods.