Rapid exploration of integrated scheduling and module selection in high level synthesis for application specific processor design

被引:3
|
作者
Sengupta, Anirban [2 ]
Sedaghat, Reza [1 ]
Sarkar, Pallabi
机构
[1] Ryerson Univ, Dept Elect & Comp Engn, Toronto, ON, Canada
[2] Ryerson Univ, OPR Lab, Toronto, ON, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Integrated exploration; Application specific processor; S-value; Intersect Matrix; Q-metric; SPACE EXPLORATION; GENETIC ALGORITHM; OPTIMIZATION; ALLOCATION; BINDING;
D O I
10.1016/j.micpro.2012.02.015
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
High level synthesis has now almost become an industry de facto standard for designing Application Specific Processors (ASPs) and Application Specific Integrated Circuits (ASICs). High level synthesis (HLS) designing requires an efficient exploration approach with the ability to determine optimal/near-optimal scheduling solutions and module selection with significant speed and precision. A novel exploration approach using the 'S-value' method that reduces the final power dissipation of the solution using minimal control step is presented in this paper. This approach is based on the proposed 'Primacy Selector (S-value)' metric and 'Intersect Matrix' topology methods that have a tendency to escape local optimal solutions and thereby reach global solutions. Two novel aspects discussed in this paper are: (a) introduction of 'Intersect Matrix' topology with its associated algorithm, which is used to check for precedence violation during scheduling, (b) introduction of S-value method metric, which assists in choosing the highest priority node during each iteration of the scheduling optimization process. Comparative analysis of the proposed approach is done with an existing design space exploration method for qualitative assessment using proposed 'Quality Cost Factor (Q-metric)'. An average improvement of approximately 5.07% in quality of final scheduling solution and average reduction of 59% in exploration runtime has been achieved by the proposed approach compared to a current scheduling approach for the DSP benchmarks. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:303 / 314
页数:12
相关论文
共 50 条
  • [1] INTEGRATED SCHEDULING, ALLOCATION AND MODULE SELECTION FOR DESIGN-SPACE EXPLORATION IN HIGH-LEVEL SYNTHESIS
    AHMAD, I
    DHODHI, MK
    CHEN, CYR
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1995, 142 (01): : 65 - 71
  • [2] PRIORITY FUNCTION BASED POWER EFFICIENT RAPID DESIGN SPACE EXPLORATION OF SCHEDULING AND MODULE SELECTION IN HIGH LEVEL SYNTHESIS
    Sengupta, Anirban
    Sedaghat, Reza
    Sarkar, Pallabi
    Sehgal, Summit
    2011 24TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2011, : 538 - 543
  • [3] Rapid Design Space Exploration for Soft Core Processor Customization and Selection
    Wijesundera, Deshya
    Prakash, Alok
    Srikanthan, Thambipillai
    2016 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT), 2016, : 185 - 188
  • [4] Memory module selection for high level synthesis
    Sentieys, O
    Chillet, D
    Diguet, JP
    Philippe, JL
    VLSI SIGNAL PROCESSING, IX, 1996, : 273 - 282
  • [5] A register file and scheduling model for application specific processor synthesis
    Ercanli, E
    Papachristou, C
    33RD DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 1996, 1996, : 35 - 40
  • [6] A multi structure genetic algorithm for integrated design space exploration of scheduling and allocation in high level synthesis for DSP kernels
    Sengupta, Anirban
    Sedaghat, Reza
    Sarkar, Pallabi
    SWARM AND EVOLUTIONARY COMPUTATION, 2012, 7 : 35 - 46
  • [7] A High-Level Analytical Model for Application Specific CMP Design Exploration
    Cassidy, Andrew
    Yu, Kai
    Zhou, Haolang
    Andreou, Andreas G.
    2011 DESIGN, AUTOMATION & TEST IN EUROPE (DATE), 2011, : 1095 - 1100
  • [8] Exploiting Scheduling Information for Efficient High-Level Synthesis Design Space Exploration
    Qian, Xingyue
    Shi, Jian
    Shi, Li
    Zhang, Haoyang
    Bian, Lijian
    Qian, Weikang
    2022 IEEE 30TH INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES (FCCM 2022), 2022, : 226 - 226
  • [9] INTEGRATED SCHEDULING AND BINDING - A SYNTHESIS APPROACH FOR DESIGN SPACE EXPLORATION
    BALAKRISHNAN, M
    MARWEDEL, P
    26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, 1989, : 68 - 74
  • [10] Integrated Scheduling, Allocation and Binding in High Level Synthesis using Multi Structure Genetic Algorithm based Design Space Exploration
    Sengupta, Anirban
    Sedagha, Reza
    2011 12TH INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED), 2011, : 486 - 494