Settings

Now showing1 - 2 of 2
  • Some of the metrics are blocked by your 
    consent settings
    Item type:Publication, Access status: without files ,
    Practical challenges of ILP-based SPM allocation optimizations
    (2016-05-23)
    Oehlert, Dominic Paul
    ;
    Luppold, Arno
    ;
    Falk, Heiko
    Scratchpad Memory (SPM) allocation is a well-known technique for compiler-based code optimizations. Integer-Linear Programming has been proven to be a powerful technique to determine which parts of a program should be moved to the SPM. Although the idea is quite straight-forward in theory, the technique features several challenges when being applied to modern embedded systems. In this paper, we aim to bring out the main issues and possible solutions which arise when trying to apply those optimizations to existing hardware platforms.
    Publicationtype: Conference Paper
      71
  • Some of the metrics are blocked by your 
    consent settings
    Item type:Publication, Access status: without files ,
    Cache-aware instruction SPM allocation for hard real-time systems
    (2016-05-23)
    Luppold, Arno
    ;
    Kittsteiner, Christina
    ;
    Falk, Heiko
    To improve the execution time of a program, parts of its instructions can be allocated to a fast Scratchpad Memory (SPM) at compile time. This is a well-known technique which can be used to minimize the program's worst-case Execution Time (WCET). However, modern embedded systems often use cached main memories. An SPM allocation will inevitably lead to changes in the program's memory layout in main memory, resulting in either improved or degraded worst-case caching behavior. We tackle this issue by proposing a cache-aware SPM allocation algorithm based on integer-linear programming which accounts for changes in the worst-case cache miss behavior.
    Publicationtype: Conference Paper
      76