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 条
  • [21] On the convergence rate of the simulated annealing algorithm
    A. S. Tikhomirov
    Computational Mathematics and Mathematical Physics, 2010, 50 : 19 - 31
  • [22] An Improved Simulated Annealing Algorithm based on Genetic Algorithm
    Li, Shufei
    MECHATRONICS AND INTELLIGENT MATERIALS II, PTS 1-6, 2012, 490-495 : 267 - 271
  • [23] Simulated Annealing Algorithm Improved BP Learning Algorithm
    Lin, Yingjian
    Chen, Xiaoji
    APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 : 734 - 737
  • [24] Mathematical modeling and simulated annealing algorithm for spatial layout problem
    Jiang, Liupeng
    Ji, Jie
    Lu, Yuhua
    Chen, Yanan
    Jia, Yue
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S6383 - S6391
  • [25] Simulated annealing algorithm for detecting graph isomorphism
    Geng Xiutang
    Zhang Kai
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2008, 19 (05) : 1047 - 1052
  • [26] The Optimization of the Search Scheme by the Simulated Annealing Algorithm
    Niu, Guangshuo
    PROCEEDINGS OF THE 2016 6TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS, ENVIRONMENT, BIOTECHNOLOGY AND COMPUTER (MMEBC), 2016, 88 : 1378 - 1381
  • [27] Application of Simulated Annealing Algorithm in Fingerprint Matching
    Pei, Xiaofang
    Li, Nan
    Wang, Shuiping
    APPLIED INFORMATICS AND COMMUNICATION, PT III, 2011, 226 : 33 - +
  • [28] A Simulated Annealing Algorithm for Noisy Multiobjective Optimization
    Mattila, Ville
    Virtanen, Kai
    Hamalainen, Raimo P.
    JOURNAL OF MULTI-CRITERIA DECISION ANALYSIS, 2013, 20 (5-6) : 255 - 276
  • [29] AN IMPROVED SIMULATED ANNEALING ANDGENETIC ALGORITHM FOR TSP
    Ye, Gao
    Rui, Xue
    2013 5TH IEEE INTERNATIONAL CONFERENCE ON BROADBAND NETWORK & MULTIMEDIA TECHNOLOGY (IC-BNMT), 2013, : 6 - 9
  • [30] Land reallocation model with simulated annealing algorithm
    Ertunc, Ela
    Uyan, Mevlut
    Tongur, Vahit
    SURVEY REVIEW, 2021, 53 (380) : 383 - 389