MO-PSE: Adaptive multi-objective particle swarm optimization based design space exploration in architectural synthesis for application specific processor design

被引:37
作者
Mishra, Vipul Kumar [1 ]
Sengupta, Anirban [1 ]
机构
[1] Indian Inst Technol, Comp Sci & Engn Discipline, Indore, Madhya Pradesh, India
关键词
Particle swarm optimization; Design space exploration; Power; Execution time; Mutation; High level synthesis; Application specific processor; Adaptive perturbation; HIGH-LEVEL SYNTHESIS; STRUCTURE GENETIC ALGORITHM; ALLOCATION; BINDING;
D O I
10.1016/j.advengsoft.2013.09.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Architectural synthesis has gained rapid dominance in the design flows of application specific computing. Exploring an optimal design point during architectural synthesis is a tedious task owing to the orthogonal issues of reducing exploration time and enhancing design quality as well as resolving the conflicting parameters of power and performance. This paper presents a novel design space exploration (DSE) methodology multi-objective particle swarm exploration MO-PSE, based on the particle swarm optimization (PSO) for designing application specific processor (ASP). To the best of the authors' knowledge, this is the first work that directly maps a complete PSO process for multi-objective DSE for power-performance trade-off of application specific processors. Therefore, the major contributions of the paper are: (i) Novel DSE methodology employing a particle swarm optimization process for multi-objective tradeoff, (ii) Introduction of a novel model for power parameter used during evaluation of design points in MO-PSE, (iii) A novel fitness function used for design quality assessment, (iv) A novel mutation algorithm for improving DSE convergence and exploration time, (v) Novel perturbation algorithm to handle boundary outreach problem during exploration and (vi) Results of comparison performed during multiple experiments that indicates average improvement in the quality of results (QoR) achieved is around 9% and average reduction in exploration time of greater than 90% compared to recent genetic algorithm (GA) based DSE approaches. The paper also reports results based on the variation and impact of different PSO parameters such as swarm size, inertia weight, acceleration coefficient, and termination condition on multi-objective DSE. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:111 / 124
页数:14
相关论文
共 30 条
  • [21] Rapid design space exploration by hybrid fuzzy search approach for optimal architecture determination of multi objective computing systems
    Sengupta, Anirban
    Sedaghat, Reza
    Zeng, Zhipeng
    [J]. MICROELECTRONICS RELIABILITY, 2011, 51 (02) : 502 - 512
  • [22] A high level synthesis design flow with a novel approach for efficient design space exploration in case of multi-parametric optimization objective
    Sengupta, Anirban
    Sedaghat, Reza
    Zeng, Zhipeng
    [J]. MICROELECTRONICS RELIABILITY, 2010, 50 (03) : 424 - 437
  • [23] High-level synthesis of digital circuits using genetic algorithms
    Torbey, E
    Knight, J
    [J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 224 - 229
  • [24] Torbey E., 1998, P IEEE MIDWEST S CIR, P284
  • [25] The particle swarm optimization algorithm: convergence analysis and parameter selection
    Trelea, IC
    [J]. INFORMATION PROCESSING LETTERS, 2003, 85 (06) : 317 - 325
  • [26] University of California Santa Barbara, EXPR BENCHM
  • [27] Weste N.H.E., 2005, CMOS VLSI DESIGN CIR, P1
  • [28] Simultaneous optimisation of dynamic power, area and delay in behavioural synthesis
    Williams, AC
    Brown, AD
    Zwolinski, M
    [J]. IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (06): : 383 - 390
  • [29] Zeng Zhipeng, 2009, P IEEE 21 INT C MICR, P322
  • [30] A review of high-level synthesis for dynamically reconfigurable FPGAs
    Zhang, XJ
    Ng, KW
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2000, 24 (04) : 199 - 211