Multi-objective preference-free exact design space exploration of static DSP on multicore platforms

被引:0
作者
Jordao, Rodolfo [1 ]
Bahrami, Fahimeh [1 ]
Yang, Yu [1 ]
Becker, Matthias [1 ]
Sander, Ingo [1 ]
Rosvall, Kathrin [2 ]
机构
[1] KTH Royal Inst Technol, Sch Elect Engn & Comp Sci, Stockholm, Sweden
[2] Scania CV AB, Sodertalje, Sweden
来源
2024 FORUM ON SPECIFICATION & DESIGN LANGUAGES, FDL 2024 | 2024年
关键词
design space exploration; multiprocessing embedded systems; digital signal processing;
D O I
10.1109/FDL63219.2024.10673877
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A challenge in designing resource-constrained embedded systems for digital signal processing (DSP) is their complexity due to their vast design spaces, where only a fraction of implementations are feasible or optimal. A crucial tool to aid in this challenge is automated design space exploration (DSE). However, no exact, multi-objective, and preference-free DSE approach exists for DSP applications on resource-constrained embedded platforms. We propose a novel DSE solution with these ideal characteristics to perform DSE of analyzable DSP applications for tile-based multiprocessing embedded platforms. Our proposal harmonizes the exactness of constraint programming (CP) and the exploration efficiency of genetic algorithms (GA). Through this synergy, no single-objective reduction strategy or a priori objective preferences is required. We evaluate the proposal through state-of-the-art single-objective case studies and multi-objective case studies inspired by these. The evaluations show that our proposal improves the single-objective state-of-the-art and finds high-quality approximate Pareto-frontiers for the multi-objective case study. Therefore, our proposal is a more performant single-objective DSE solution than the state-of-the-art, and it is the first exact, multi-objective, and preference-free DSE approach for the problem addressed.
引用
收藏
页码:59 / 67
页数:9
相关论文
共 26 条
  • [1] EXTENDING CHIP IN ORDER TO SOLVE COMPLEX SCHEDULING AND PLACEMENT PROBLEMS
    AGGOUN, A
    BELDICEANU, N
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 1993, 17 (07) : 57 - 73
  • [2] Bellman R., 1958, Q. Appl. Math., V16, P87
  • [3] Bonfietti A, 2010, DES AUT TEST EUROPE, P897
  • [4] Carlsson M., 2022, SICStus prolog user's manual., V1
  • [5] Culler DavidE., 1999, PARALLEL COMPUTER AR
  • [6] Dulmage-Mendelsohn Canonical Decomposition as a generic pruning technique
    Cymer, Radosaw
    [J]. CONSTRAINTS, 2012, 17 (03) : 234 - 272
  • [7] Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs
    de Groote, Robert
    Kuper, Jan
    Broersma, Hajo
    Smit, Gerard J. M.
    [J]. 2012 38TH EUROMICRO CONFERENCE ON SOFTWARE ENGINEERING AND ADVANCED APPLICATIONS (SEAA), 2012, : 29 - 38
  • [8] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [9] Performance Analysis of Weakly-Consistent Scenario-Aware Dataflow Graphs
    Geilen, Marc
    Falk, Joachim
    Haubelt, Christian
    Basten, Twan
    Theelen, Bart
    Stuijk, Sander
    [J]. JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2017, 87 (01): : 157 - 175
  • [10] Ghamarian A., 2006, APPL CONCURRENCY SYS, P25