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. Efficient and effective multi-objective optimization for real-time multi-task systems
 
Options

Efficient and effective multi-objective optimization for real-time multi-task systems

Citation Link: https://doi.org/10.15480/882.8710
Publikationstyp
Conference Paper
Date Issued
2023-07-26
Sprache
English
Author(s)
Jadhav, Shashank  orcid-logo
Eingebettete Systeme E-13  
Falk, Heiko  orcid-logo
Eingebettete Systeme E-13  
TORE-DOI
10.15480/882.8710
TORE-URI
https://hdl.handle.net/11420/43670
First published in
Open access series in informatics  
Number in series
114
Volume
114
Article Number
5
Citation
21st International Workshop on Worst-Case Execution Time Analysis (WCET 2023)
Contribution to Conference
21st International Workshop on Worst-Case Execution Time Analysis, WCET 2023  
Publisher DOI
10.4230/OASIcs.WCET.2023.5
Scopus ID
2-s2.0-85169425091
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
ISBN
978-3-95977-293-8
Embedded real-time multi-task systems must often not only comply with timing constraints but also need to meet energy requirements. However, optimizing energy consumption might lead to higher Worst-Case Execution Time (WCET), leading to an un-schedulable system, as frequently executed code can easily differ from timing-critical code. To handle such an impasse in this paper, we formulate a Metaheuristic Algorithm-based Multi-objective Optimization (MAMO) for multi-task real-time systems. But, performing multiple WCET, energy, and schedulability analyses to solve a MAMO poses a bottleneck concerning compilation times. Therefore, we propose two novel approaches - Path-based Constraint Approach (PCA) and Impact-based Constraint Approach (ICA) - to reduce the solution search space size and to cope with this problem. Evaluations showed that PCA and ICA reduced compilation times by 85.31% and 77.31%, on average, over MAMO. For all the task sets, out of all solutions found by ICA-FPA, on average, 88.89% were on the final Pareto front.
Subjects
Compilers
Design space reduction
Metaheuristic algorithms
Multi-objective optimization
Real-time systems
DDC Class
004: Computer Sciences
510: Mathematics
Publication version
publishedVersion
Lizenz
https://creativecommons.org/licenses/by/4.0/
Loading...
Thumbnail Image
Name

OASIcs-WCET-2023-5.pdf

Type

Main Article

Size

768.21 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