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 条
[41]   A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem [J].
Wang, Kaipu ;
Li, Xinyu ;
Gao, Liang ;
Li, Peigen ;
Gupta, Surendra M. .
APPLIED SOFT COMPUTING, 2021, 107
[42]   A Combination of Evolutionary Algorithm and Mathematical Programming for the 3D Thermal-Aware Floorplanning Problem [J].
Cuesta, David ;
Risco-Martin, Jose L. ;
Ayala, Jose L. ;
Ignacio Hidalgo, J. .
GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, :1731-1738
[43]   Genetic Algorithm Optimization Research Based On Simulated Annealing [J].
Lan, Shunan ;
Lin, Weiguo .
2016 17TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2016, :491-494
[44]   Design and Simulation of Simulated Annealing Algorithm with Harmony Search [J].
Jiang, Hua ;
Liu, Yanxiu ;
Zheng, Liping .
ADVANCES IN SWARM INTELLIGENCE, PT 2, PROCEEDINGS, 2010, 6146 :454-460
[45]   Estimation of mutual coupling coefficient by simulated annealing algorithm [J].
Gao, HT ;
Zheng, X ;
Li, J .
2003 6TH INTERNATIONAL SYMPOSIUM ON ANTENNAS, PROPAGATION AND EM THEORY, PROCEEDINGS, 2003, :275-278
[46]   Simulated Annealing Algorithm for the Quay Crane Scheduling Problem [J].
Liu, Yan-Na ;
Wang, Rui ;
Zhang, Xiao-Yu ;
Li, Chang-Guo ;
Zhong, Min ;
Li, Yu-Hao .
PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, :2307-2311
[47]   QoS multicast routing based on simulated annealing algorithm [J].
Wang, XL ;
Jiang, Z .
APOC 2003: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS; NETWORK ARCHITECTURES, MANAGEMENT, AND APPLICATIONS, PTS 1 AND 2, 2003, 5282 :511-516
[48]   Simulated annealing algorithm for the solution of the traveling salesman problem [J].
Misevicius, Alfonsas .
INFORMATION TECHNOLOGIES' 2008, PROCEEDINGS, 2008, :19-24
[49]   Fuzzy travelling salesman problem and simulated annealing algorithm [J].
Lu, Yiwen .
Proceedings of the Fourth International Conference on Information and Management Sciences, 2005, 4 :505-514
[50]   Adaptive learning game model for the simulated annealing algorithm [J].
Chen Qi-kun ;
Chen Jia-liang .
Proceedings of 2005 Chinese Control and Decision Conference, Vols 1 and 2, 2005, :1646-1649