Worst-Case Execution Time Analysis for Many-Core Architectures with NoC

The optimal deployment of data streaming applications onto multi-/many-core platforms providing real-time guarantees requires to solve the application partitioning/placement, buffer allocation, task mapping and scheduling optimisation problem using the tasks Worst-Case Execution Time (WCET). In turn...

Full description

Saved in:
Bibliographic Details
Published inFormal Modeling and Analysis of Timed Systems pp. 211 - 227
Main Authors Skalistis, Stefanos, Simalatsar, Alena
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Buffer Allocation
Criticality Level
Memory Bank
Task Graph
WCET Analysis
Online AccessGet full text

Cover

More Information
Summary:The optimal deployment of data streaming applications onto multi-/many-core platforms providing real-time guarantees requires to solve the application partitioning/placement, buffer allocation, task mapping and scheduling optimisation problem using the tasks Worst-Case Execution Time (WCET). In turn, task WCET varies due to interferences that tasks experience when accessing shared resources, which vary depending on the solutions of the optimisation problem. To break this cyclic dependency we propose a detailed interference-based method that first over-approximates WCET based on the solution for application partitioning/placement and then tightens it by pruning out the interferences from tasks not overlapping in memory access and time. We prove that the derived bounds are safe. We have found that interferences on average amount to 10 % of WCET, and were able to improve the latency-guarantee up to 34 %.
ISBN:3319448773
9783319448770
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-44878-7_13