Multi-objective Floorplanning optimization engaging dynamic programming for system on chip

被引:2
作者
Chowdary, S. Dayasagar [1 ]
Sudhakar, M. S. [1 ]
机构
[1] Vellore Inst Technol, Sch Elect Engn, Vellore, Tamil Nadu, India
关键词
Cadence dynamic programming; Floorplanning; Multi-objective optimization; Weighted ranksum; ANT SYSTEM; AWARE; POWER; DESIGN; ALGORITHMS; FLOW;
D O I
10.1016/j.mejo.2023.105942
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The quest for optimal VLSI Floorplanning (FP) addressing noteworthy challenges namely Area, Wirelength, and Temperature remains an ongoing field of research. Prevailing FP designs individually optimize these constraints that increase the model complexity with reduced efficiency. Given this motivation, this study provides an optimum FP aimed at minimizing the overall chip area by adhering to the standard design requirements. Accordingly, the divide-and-conquer model of Dynamic Programming (DP) adopted in this work simultaneously optimizes the chip area by devising separate analytical cost functions related to the physical design parameters that are then collated to yield the compact Floor plan. The formulated DP optimization coined as Weighted Aggregated DP-Based FP (WADPFP) adaptively tunes the cost function using rank-sum scaled weights and the discount factor thereby reducing congestion and hotspots. This objective is met using two novel recursive functions ensuring temperature and area scalability. Simulation and synthesis of the proposed FP on the Microelectronic Centre of North Carolina (MCNC) and Gigascale Systems Research Center (GSRC) Benchmark circuits demonstrated the viability of the automated FP design by registering 6.05%, 13%, and 4.35% reduction in area, wirelength, and temperature respectively in comparison with the traditional and recent peers. Additional analysis on the AMI49_X benchmark circuits emphasizes the scalable nature of the introduced WADPFP.
引用
收藏
页数:14
相关论文
共 64 条
[21]   Mapping techniques in multicore processors: current and future trends [J].
Gupta, Manjari ;
Bhargava, Lava ;
Indu, S. .
JOURNAL OF SUPERCOMPUTING, 2021, 77 (08) :9308-9363
[22]   Variable-Order Ant System for VLSI multiobjective floorplanning [J].
Hoo, Chyi-Shiang ;
Jeevan, Kanesan ;
Ganapathy, Velappa ;
Ramiah, Harikrishnan .
APPLIED SOFT COMPUTING, 2013, 13 (07) :3285-3297
[23]   Optimal Rectangle Packing: An Absolute Placement Approach [J].
Huang, Eric ;
Korf, Richard E. .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2013, 46 :47-87
[24]  
Iyengar Smitha, 2018, 2018 International Conference on Inventive Research in Computing Applications (ICIRCA). Proceedings, P415, DOI 10.1109/ICIRCA.2018.8597347
[25]  
Jiang L., 2023, J. Supercomput., P1
[26]  
Jylanki J, 2010, A Thousand Ways to Pack the Bin-A Practical Approach to TwoDimensional Rectangle Bin Packing, P1
[27]  
Ken Roberts BP, 2012, MCNC BENCHMARK NETLI
[28]   Power Density-Aware Resource Management for Heterogeneous Tiled Multicores [J].
Khdr, Heba ;
Pagani, Santiago ;
Sousa, Ericles ;
Lari, Vahid ;
Pathania, Anuj ;
Hannig, Frank ;
Shafique, Muhammad ;
Teich, Juergen ;
Henkel, Joerg .
IEEE TRANSACTIONS ON COMPUTERS, 2017, 66 (03) :488-501
[29]  
Lee H., 2003, MB * -tree: A Multilevel Floorplanner for Large-Scale, P1
[30]   Visualization of Flash Evaporation Process in Tiny Tube Based on Electrical Capacitance Tomography [J].
Li, Xiaolin ;
Sun, Jiangtao ;
Suo, Peng ;
Sun, Shijie ;
Xu, Lijun .
2022 IEEE INTERNATIONAL CONFERENCE ON IMAGING SYSTEMS AND TECHNIQUES (IST 2022), 2022,