Time, Energy and Security Analysis for Multi-/Many-Core heterogeneous Platforms (TeamPlay)
|Name||Time, Energy and Security Analysis for Multi-/Many-Core heterogeneous Platforms|
|Role of TUHH||Work Package Leader|
|Funds Donor||European Commission (Horizon 2020)|
The TeamPlay project aims to develop new, formally-motivated, techniques that will allow execution time, energy usage, security, and other important non-functional properties of parallel software to be treated effectively, and as first-class citizens. We will build this into a toolbox for developing highly parallel software for low-energy systems, as required by the internet of things, cyber-physical systems etc. The TeamPlay approach will allow programs to reflect directly on their own time, energy consumption, security, etc., as well as enabling the developer to reason about both the functional and the non-functional properties of their software at the source code level.
Our success will ensure significant progress on a pressing problem of major industrial importance: how to effectively manage energy consumption for parallel systems while maintaining the right balance with other important software metrics, including time, security etc. The project brings together leading industrial and academic experts in parallelism, energy modeling/transparency, worst-case execution time analysis, non-functional property analysis, compilation, security, and task coordination. Results will be evaluated using industrial use cases taken from the computer vision, satellites, flying drones, medical and cybersecurity domains.
TeamPlay Publications of the Embedded Systems Design Group
|Title: Multi-Objective Optimization for the Compiler of Real-Time Systems based on Flower Pollination Algorithm. <em>In Proceedings of the 22nd International Workshop on Software & Compilers for Embedded Systems (SCOPES)</em>|
|Written by: Shashank Jadhav and Heiko Falk|
|in: May (2019).|
|on pages: 45-48|
|Address: St. Goar / Germany|
|how published: 19-80 JF19a SCOPES|
Note: sjadhav, hfalk, teamplay, ESD, WCC
Abstract: Real-time systems usually face stringent constraints such as execution time, energy consumption, code-size etc. Performing multi-objective optimization at compile time is one way to find approximations over the possible solutions which fulfill these constraints. Flower pollination algorithm (FPA) is a relatively recently proposed metaheuristic algorithm which makes use of the evolutionary characteristics of flower pollination process to find solutions to an optimization problem. In this paper, we propose a theoretical framework for an extension for the WCET-Aware C Compiler (WCC) framework for performing multi-objective optimizations based on the FPA during compile time.