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 条
  • [1] [Anonymous], 2005, FUNDAMENTAL COMPUTAT
  • [2] Semiconcurrent error detection in data paths
    Antola, A
    Ferrandi, F
    Piuri, V
    Sami, M
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (05) : 449 - 465
  • [3] Efficient design space exploration for application specific systems-on-a-chip
    Ascia, Giuseppe
    Catania, Vincenzo
    Di Nuovo, Alessandro G.
    Palesi, Maurizio
    Patti, Davide
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 2007, 53 (10) : 733 - 750
  • [4] Catania V., 2006, Proceedings of the 4th International Conference on Hardware/Software Codesign and System Synthesis, P223
  • [5] Energy minimization using multiple supply voltages
    Chang, JM
    Pedram, M
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 1997, 5 (04) : 436 - 443
  • [6] CHRISTIAN H, 2008, P 45 ANN ACM IEEE DE, P580
  • [7] A preference ordering among various Pareto optimal alternatives
    Das, I
    [J]. STRUCTURAL OPTIMIZATION, 1999, 18 (01): : 30 - 35
  • [8] DATAPATH SYNTHESIS USING A PROBLEM-SPACE GENETIC ALGORITHM
    DHODHI, MK
    HIELSCHER, FH
    STORER, RH
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1995, 14 (08) : 934 - 944
  • [9] Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374
  • [10] Gajski D.D., 1992, High-level synthesis: introduction to chip and system design