Options
Towards multi-objective dynamic SPM allocation
Citation Link: https://doi.org/10.15480/882.8698
Publikationstyp
Conference Paper
Date Issued
2023-07-26
Sprache
English
TORE-DOI
First published in
Number in series
114
Volume
114
Article Number
6
Citation
21th International Workshop on Worst-Case Execution Time Analysis (WCET 2023)
Contribution to Conference
Publisher DOI
Scopus ID
Publisher
Schloss Dagstuhl Leibniz-Zentrum für Informatik
ISSN
2190-6807
ISBN
978-3-95977-293-8
Most real-time embedded systems are required to fulfill timing constraints while adhering to a limited energy budget. Small ScratchPad Memory (SPM) poses a common hardware constraint on embedded systems. Static SPM allocation techniques are limited by the SPM's stringent size constraint, which is why this paper proposes a Dynamic SPM Allocation (DSA) model at the compiler level for the dynamic allocation of a program to SPM during runtime. To minimize Worst-Case Execution Time (WCET) and energy objectives, we propose a multi-objective DSA-based optimization. Static SPM allocations might inherently use SPM sub-optimally, while all proposed DSA optimizations are only single-objective. Therefore, this paper is the first step towards a DSA that trades WCET and energy objectives simultaneously. Even with extra DSA overheads, our approach provides better quality solutions than the state-of-the-art multi-objective static SPM allocation and ILP-based single-objective DSA approach.
Subjects
Compilers
Dynamic SPM allocation
Embedded systems
Metaheuristic algorithms
Multi-objective optimization
DDC Class
004: Computer Sciences
510: Mathematics
Publication version
publishedVersion
Loading...
Name
OASIcs-WCET-2023-6.pdf
Size
661.81 KB
Format
Adobe PDF