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
来源
MICROELECTRONICS JOURNAL | 2023年 / 140卷
关键词
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
相关论文
共 50 条
  • [31] Performance Measures for Dynamic Multi-Objective Optimization
    Camara, Mario
    Ortega, Julio
    de Toro, Francisco
    BIO-INSPIRED SYSTEMS: COMPUTATIONAL AND AMBIENT INTELLIGENCE, PT 1, 2009, 5517 : 760 - +
  • [32] Dynamic multi-objective optimization evolutionary algorithm
    Liu, Chun-an
    Wang, Yuping
    ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2007, : 456 - +
  • [33] Immune forgetting dynamic multi-objective optimization
    Institute of Intelligent Information Processing, Xidian University, Xi'an 710071, China
    Harbin Gongcheng Daxue Xuebao, 2006, SUPPL. (205-209):
  • [34] Investigation of Asynchrony in Dynamic Multi-Objective Optimization
    Herring, Daniel
    Kirley, Michael
    Yao, Xin
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 3165 - 3172
  • [35] Evolving dynamic multi-objective optimization problems with objective replacement
    Guan, SU
    Chen, Q
    Mo, WT
    ARTIFICIAL INTELLIGENCE REVIEW, 2005, 23 (03) : 267 - 293
  • [36] Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
    SHENG-UEI GUAN
    QIAN CHEN
    WENTING MO
    Artificial Intelligence Review, 2005, 23 : 267 - 293
  • [37] Multi-objective optimization for energy and heat-aware VLSI floorplanning using enhanced firefly optimization
    Srinivasan, B.
    Venkatesan, R.
    SOFT COMPUTING, 2021, 25 (05) : 4159 - 4174
  • [38] Multi-objective optimization for energy and heat-aware VLSI floorplanning using enhanced firefly optimization
    B. Srinivasan
    R. Venkatesan
    Soft Computing, 2021, 25 : 4159 - 4174
  • [39] Multi-objective Dynamic Programming for Constrained Optimization of Non-separable Objective Functions with Application in Energy Storage
    Kamyar, Reza
    Peet, Matthew M.
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 5348 - 5353
  • [40] Dynamic Distance Minimization Problems for dynamic Multi-objective Optimization
    Zille, Heiner
    Kottenhahn, Andre
    Mostaghim, Sanaz
    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 952 - 959