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 条
  • [1] Hierarchical 3-D floorplanning algorithm for wirelength optimization
    Li, Zhuoyuan
    Hong, Xianlong
    Zhou, Qiang
    Cai, Yici
    Bian, Jinian
    Yang, Hannah H.
    Pitchumani, Vijay
    Cheng, Chung-Kuan
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2006, 53 (12) : 2637 - 2646
  • [2] 3-D floorplanning: Simulated annealing and greedy placement methods for reconfigurable computing systems
    Bazargan, K
    Kastner, R
    Sarrafzadeh, M
    TENTH IEEE INTERNATIONAL WORKSHOP ON RAPID SYSTEMS PROTOTYPING, PROCEEDINGS, 1999, : 38 - 43
  • [3] 3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems
    Bazargan, K.
    Kastner, R.
    Sarrafzadeh, M.
    Proceedings of the International Workshop on Rapid System Prototyping, 1999, : 38 - 43
  • [4] 3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
    Kiarash Bazargan
    Ryan Kastner
    Majid Sarrafzadeh
    Design Automation for Embedded Systems, 2000, 5 : 329 - 338
  • [5] 3-D floorplanning: Simulated annealing and greedy placement methods for reconfigurable computing systems
    Bazargan, K
    Kastner, R
    Sarrafzadeh, M
    DESIGN AUTOMATION FOR EMBEDDED SYSTEMS, 2000, 5 (3-4) : 329 - 338
  • [6] A Hierarchical 3-D Floorplanning Algorithm for Many-core CMP Networks
    Kannan, Sachhidh
    Rose, Garrett S.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2011, : 1211 - 1214
  • [7] Optimizing Simulated Annealing on GPU: A Case Study with IC Floorplanning
    Han, Yiding
    Roy, Sanghamitra
    Chakraborty, Koushik
    2011 12TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED), 2011, : 269 - 275
  • [8] A Hybrid Simulated Annealing Algorithm for Nonslicing VLSI Floorplanning
    Chen, Jianli
    Zhu, Wenxing
    Ali, M. M.
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2011, 41 (04): : 544 - 553
  • [9] An orthogonal simulated annealing algorithm for large floorplanning problems
    Ho, SY
    Ho, SJ
    Lin, YK
    Chu, WCC
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2004, 12 (08) : 874 - 876
  • [10] 3-D Floorplanning Algorithm to Minimize Thermal Interactions
    Vaishand, Boris
    Friedman, Eby G.
    2015 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2015, : 2133 - 2136