A nature inspired optimization algorithm for VLSI fixed-outline floorplanning

被引:10
|
作者
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 条
  • [21] Fixed-outline floorplanning through better local search
    Adya, SN
    Markov, IL
    2001 INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, ICCD 2001, PROCEEDINGS, 2001, : 328 - 334
  • [22] Fixed-outline floorplanning with constraints through instance augmentation
    Liu, R
    Dong, SQ
    Hong, XL
    Kajitani, Y
    2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 1883 - 1886
  • [23] Fixed-outline floorplanning using robust evolutionary search
    Chen, De-Sheng
    Lin, Chang-Tzu
    Wang, Yi-Wen
    Cheng, Ching-Hwa
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2007, 20 (06) : 821 - 830
  • [24] SDS: An Optimal Slack-Driven Block Shaping Algorithm for Fixed-Outline Floorplanning
    Yan, Jackey Z.
    Chu, Chris
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (02) : 175 - 188
  • [25] A Quasi-Newton-based Floorplanner for fixed-outline floorplanning
    Ji, Pengli
    He, Kun
    Wang, Zhengli
    Jin, Yan
    Wu, Jigang
    COMPUTERS & OPERATIONS RESEARCH, 2021, 129
  • [26] A fast temperature-aware fixed-outline floorplanning framework using convex optimization
    Khodabandeloo, Behnam
    Khonsari, Ahmad
    Jasemi, Masoomeh
    Taheri, Golnaz
    INTEGRATION-THE VLSI JOURNAL, 2017, 58 : 101 - 110
  • [27] An Improved Simulated Annealing Algorithm and Area Model for the Fixed-Outline Floorplanning with Hard Modules
    Zou, De-Xuan
    Hao, Guo-Sheng
    Pan, Gai
    Wang, Gai-Ge
    2015 3RD INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL AND BUSINESS INTELLIGENCE (ISCBI 2015), 2015, : 21 - 25
  • [28] Large-scale fixed-outline floorplanning design using convex optimization techniques
    Luo, Chaomin
    Anjos, Miguel F.
    Vannelli, Andiony
    2008 ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2008, : 110 - +
  • [29] Fast Floorplanning for Fixed-Outline and Non-rectangular Regions
    Ahmed, Mohammad A.
    Pinge, Shantesh
    Chrzanowska-Jeske, Malgorzata
    2012 19TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS (ICECS), 2012, : 464 - 467
  • [30] A Fixed-outline Floorplanning Method Based on 2.5D
    Dong, Sheqin
    Xie, Qi
    PROCEEDINGS OF THE 11TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2008,