Optimizing Hierarchical 3-D Floorplanning with simulated annealing Algorithm

被引:0
作者
Liao Chengyi [1 ]
Zheng Qi [1 ]
Liu Fengman [1 ]
He Huimin [1 ]
Wang Qidong [1 ]
机构
[1] Inst Microelect Chinese Acad Sci, Microsyst Packaging Res Ctr, Beijing, Peoples R China
来源
2023 24TH INTERNATIONAL CONFERENCE ON ELECTRONIC PACKAGING TECHNOLOGY, ICEPT | 2023年
关键词
3D Design Methodology; 3D floorplan; Simulated annealing algorithm; multi-objective optimization;
D O I
10.1109/ICEPT59018.2023.10492252
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
3DIC enables the vertical stacking of multiple chip layers, connected by silicon through-silicon vias (TSV), ultimately resulting in significant reductions in chip area and interconnect delay. However, 3DIC increases the complexity of module packaging design. Therefore, reasonable floor-planning algorithms are essential for reducing chip area and improving the performance of the interconnection. This article specifically focuses on the collaborative design and interaction problem in 3D integrated stacking to optimize both the number of TSV/bump and the arrangement of macro blocks. In this study, we propose a twostage method for effectively solving the 3DIC layout planning problem. Firstly, a three-dimensional hierarchical layout process is introduced using a new inter-layer partitioning method. This involves in dividing macro blocks into different layers before conducting layout planning by simulated annealing algorithm to minimize both the largest area of the chip and the number of bump and TSV. After establishing the hierarchical structure, an initial solution is randomly generated and serves as the starting point for the simulated annealing algorithm. The local search characteristic of this heuristic algorithm is employed to perturb the initial solution multiple times to further optimize the wirelength, for instance, by swapping the positions of two modules or fine-tuning the position of each module. The objective function is assessed under fixed frame and non-overlapping constraints. We define the area and connectivity of 90 modules. We assign all modules to three dies, with Die1 placed face-down and Die2 and Die3 placed face-up. Ignoring the input-output (I/O) connections of the entire chip, we determine the number of TSVs by summing the connections between Die3 and Die1 and those between Die3 and Die2. The final layout result shows that the blank space ratio of each layer is approximately 10%. Additionally, we minimize the number of bumps/TSVs and the wirelength. The wirelength decreases by 0.62% after fine-tuning. The final weighted wirelength is 1.5327e+09. In summary, this approach is effective in optimizing the layout of integrated circuits and is potential in a wide range of designs.
引用
收藏
页数:6
相关论文
共 50 条
  • [31] Land reallocation model with simulated annealing algorithm
    Ertunc, Ela
    Uyan, Mevlut
    Tongur, Vahit
    [J]. SURVEY REVIEW, 2021, 53 (380) : 383 - 389
  • [32] Application of Simulated Annealing Algorithm in Fingerprint Matching
    Pei, Xiaofang
    Li, Nan
    Wang, Shuiping
    [J]. 2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL III, 2010, : 13 - 16
  • [33] A MapReduce Enabled Simulated Annealing Genetic Algorithm
    Hu, Luokai
    Liu, Jin
    Liang, Chao
    Ni, Fuchuan
    [J]. 2014 INTERNATIONAL CONFERENCE ON IDENTIFICATION, INFORMATION AND KNOWLEDGE IN THE INTERNET OF THINGS (IIKI 2014), 2014, : 252 - 255
  • [34] Simulated annealing algorithm for detecting graph isomorphism
    Geng Xiutang & Zhang Kai Dept. of Control Science and Engineering
    [J]. JournalofSystemsEngineeringandElectronics, 2008, (05) : 1047 - 1052
  • [35] Construction Algorithm of Concept Set Based on Simulated Annealing Algorithm
    Liu Z.
    Chen J.
    Song G.
    Min F.
    [J]. Min, Fan (minfanphd@163.com); Min, Fan (minfanphd@163.com), 1600, Science Press (34): : 723 - 732
  • [36] Optimizing the buckling characteristics and weight of functionally graded circular plates using the multi-objective Pareto archived simulated annealing algorithm (PASA)
    Farhatnia F.
    Eftekhari S.A.
    Pakzad A.
    Oveissi S.
    [J]. International Journal for Simulation and Multidisciplinary Design Optimization, 2019, 10
  • [37] Enhanced simulated annealing algorithm for 3D reconstruction of cathode catalyst layers in proton exchange membrane fuel cell
    Gao, Yuan
    Men, Jida
    Chen, Chaogang
    [J]. JOURNAL OF POWER SOURCES, 2024, 613
  • [38] A Simulated Annealing Algorithm and Grid Map-Based UAV Coverage Path Planning Method for 3D Reconstruction
    Xiao, Sichen
    Tan, Xiaojun
    Wang, Jinping
    [J]. ELECTRONICS, 2021, 10 (07)
  • [39] An method of improved BP Neural Algorithm Based on Simulated Annealing Algorithm
    Bai, Kai
    Xiong, Jing
    [J]. THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING, 2009, : 765 - 768
  • [40] An improved ICA algorithm based on the negative entropy and simulated annealing algorithm
    Li, Hongyi
    Ye, Meng
    Zhao, Di
    [J]. INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY II, PTS 1-4, 2013, 411-414 : 1125 - 1128