TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publications
  4. Approximating WCET and energy consumption for fast multi-objective memory allocation
 
Options

Approximating WCET and energy consumption for fast multi-objective memory allocation

Citation Link: https://doi.org/10.15480/882.4375
Publikationstyp
Research Report
Date Issued
2022-06
Sprache
German
Author(s)
Jadhav, Shashank  orcid-logo
Falk, Heiko  orcid-logo
Institut
Eingebettete Systeme E-13  
TORE-DOI
10.15480/882.4375
TORE-URI
http://hdl.handle.net/11420/12859
Start Page
162
End Page
172
Citation
RTNS 2022: Proceedings of the 30th International Conference on Real-Time Networks and Systems: 162-172 (2022)
Contribution to Conference
30th International Conference on Real-Time Networks and Systems, RTNS 2022  
Publisher DOI
10.1145/3534879.3534889
Scopus ID
2-s2.0-85132374209
Peer Reviewed
true
Worst-Case Execution Time (WCET) is the most important design criterion in the domain of hard real-time systems. Most embedded systems also need to satisfy additional design criteria like, e.g., energy consumption. Performing WCET and energy analyses statically at compile-time can be time-consuming. Consequently, minimizing WCET and energy consumption of the code at the compiler level using multi-objective optimization can be a time-consuming process. In this paper, we propose an approximation model to quickly approximate the WCET and energy consumption of the code at compile-time. Instead of using traditional WCET and energy analyses, we exploit this approximation model to perform ScratchPad Memory (SPM) allocation-based multi-objective optimization. Furthermore, we solve the multi-objective optimization problem using metaheuristic algorithms and explore the trade-offs between WCET and energy consumption. Using the proposed approximation model, we achieved, on average, a 94.12% reduction in compilation time and maintained the quality of the Pareto optimal solutions while performing the multi-objective optimization. Furthermore, the approximation error while using the proposed approximation model was in an acceptable range of 2% - 4% on average.
Subjects
Multi-objective optimization
Hard real-time systems,
Approxima- tion
Metaheuristic algorithms,
SPM allocation
DDC Class
600: Technik
Funding(s)
Time, Energy and security Analysis for Multi/Manycore heterogenous PLAtforms - TeamPlay  
Funding Organisations
European Union  
Publication version
acceptedVersion
Lizenz
http://rightsstatements.org/vocab/InC/1.0/
Loading...
Thumbnail Image
Name

main.pdf

Size

416.66 KB

Format

Adobe PDF

TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback