A nature inspired optimization algorithm for VLSI fixed-outline floorplanning

被引:9
|
作者
Shunmugathammal, M. [1 ]
Columbus, C. Christopher [2 ]
Anand, S. [3 ]
机构
[1] Cape Inst Technol, Tirunelveli 627114, Tamil Nadu, India
[2] PSN Coll Engn & Technol, Dept Comp Sci Engn, Tirunelveli 627152, Tamil Nadu, India
[3] Rajagiri Sch Engn & Technol, Dept Elect & Commun, Kochi 682039, Kerala, India
关键词
B*tree crossover; Lion Optimization Algorithm; LOA; Genetic algorithm; VLSI; Multiobjective optimization; GENETIC ALGORITHM;
D O I
10.1007/s10470-020-01598-w
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
VLSI floorplan optimization problem aim to minimize the following measures such as, area, wirelength and dead space (unused space) between modules. This paper proposed a method for solving floorplan optimization problem using Genetic Algorithm which is named as 'Lion Optimization Algorithm' (LOA). LOA is developed for non-slicing floorplans having soft modules with fixed-outline constraint. Although a number of GAs are developed for solving VLSI floorplan optimization problems, they are using weighted sum approach with single objective optimization and crossover between two B*tree structure is not yet attempted. This paper explains, power of B*tree crossover operator for multiobjective floorplanning problem. This operator introduces additional perturbations in initial B*tree structure to create two new different B*tree structures compared with classical GA approach. Simulation results on Microelectronics Center of North Carolina and Gigascale Systems Research Center benchmarks indicate that LOA floorplanner achieves significant savings in wirelength and area minimization also produces better results for dead space minimization compared to previous floorplanners.
引用
收藏
页码:173 / 186
页数:14
相关论文
共 50 条
  • [1] A nature inspired optimization algorithm for VLSI fixed-outline floorplanning
    M. Shunmugathammal
    C. Christopher Columbus
    S. Anand
    Analog Integrated Circuits and Signal Processing, 2020, 103 : 173 - 186
  • [2] A nonlinear optimization methodology for VLSI fixed-outline floorplanning
    Chaomin Luo
    Miguel F. Anjos
    Anthony Vannelli
    Journal of Combinatorial Optimization, 2008, 16 : 378 - 401
  • [3] A nonlinear optimization methodology for VLSI fixed-outline floorplanning
    Luo, Chaomin
    Anjos, Miguel F.
    Vannelli, Anthony
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 16 (04) : 378 - 401
  • [4] Hybrid Particle Swarm Optimization Algorithm for Fixed-outline Floorplanning
    Chen, Zhenyi
    Wang, Gaofeng
    Dong, Chen
    2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 1299 - 1302
  • [5] A fixed-outline floorplanning method
    Yosihmura, Takeshi
    Chen, Song
    ASICON 2007: 2007 7TH INTERNATIONAL CONFERENCE ON ASIC, VOLS 1 AND 2, PROCEEDINGS, 2007, : 1070 - 1075
  • [6] A stable Fixed-Outline Floorplanning algorithm for soft module
    Du, Shi-Min
    Xia, Yin-Shui
    Chu, Zhu-Fei
    Huang, Cheng
    Yang, Run-Ping
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2014, 36 (05): : 1258 - 1265
  • [7] An efficient algorithm to fixed-outline floorplanning based on instance augmentation
    Liu, R
    Dong, SQ
    Hong, XL
    NINTH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS, PROCEEDINGS, 2005, : 210 - 215
  • [8] A Stable Fixed-Outline Floorplanning Method
    Chen, Song
    Yosihmura, Takeshi
    ISPD'07: PROCEEDINGS OF THE 2007 INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN, 2007, : 119 - 126
  • [9] UFO: Unified Convex Optimization Algorithms for Fixed-Outline Floorplanning
    Lin, Jai-Ming
    Hung, Hsi
    2010 15TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC 2010), 2010, : 546 - 551
  • [10] A novel method on discrete particle swarm optimization for fixed-outline floorplanning
    Ye, Yin
    Yin, Xi
    Chen, Zhenyi
    Hong, Zhixing
    Fan, Xinwen
    Dong, Chen
    PROCEEDINGS OF 2020 IEEE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND INFORMATION SYSTEMS (ICAIIS), 2020, : 591 - 595