Name: | Description: | Size: | Format: | |
---|---|---|---|---|
1.05 MB | Adobe PDF |
Advisor(s)
Abstract(s)
Owing to the current trends for higher performance and the
ever growing availability of multiprocessors in the embedded
computing (EC) domain, there is nowadays a strong push towards
the parallelization of modern embedded applications.
Several real-time task models have recently been proposed
to capture different forms of parallelism. However, they do
not deal explicitly with control flow information as they assume
that all the threads of a parallel task must execute
every time the task is activated. In contrast, in this paper,
we present a multi-DAG model where each task is characterized
by a set of execution flows, each of which represents
a different execution path throughout the task code and is
modeled as a DAG of sub-tasks. We propose a two-step solution
that computes a single synchronous DAG of servers
for a task modeled by a multi-DAG and show that these
servers are able to supply every execution flow of that task
with the required cpu-budget so that the task can execute
entirely, irrespective of the execution flow taken at run-time,
while satisfying its precedence constraints. As a result, each
task can be modeled by its single DAG of servers, which
facilitates in leveraging the existing single-DAG schedulability
analyses techniques for analyzing the schedulability of
parallel tasks with multiple execution flows.
Description
The 30th ACM/SIGAPP Symposium On Applied Computing (SAC 2015). 13 to 17, Apr, 2015, Embedded Systems. Salamanca, Spain.