This paper considers the scheduling of parallel real-time tasks with implicit deadlines. Each
parallel task is characterized as a general directed acyclic graph (DAG). We analyze three …

Different task models have been proposed to represent the parallel structure of real-time
tasks executing on manycore platforms: fork/join, synchronous parallel, DAG-based, etc …

Real-time scheduling and analysis of parallel tasks modeled as directed acyclic graphs
(DAG) have been intensively studied in recent years. However, no existing work has …

The sporadic DAG task model exposes parallelism that may exist within individual tasks to
the run-time scheduling mechanism, and is therefore considered a particularly suitable …

Several schedulability analyses have been proposed for a variety of parallel task systems
with real-time constraints. However, these analyses are mostly restricted to global …

When adopting multi-core systems for safety-critical applications, certification requirements
mandate bounding the delays incurred in accessing shared resources. This is the case of …

A mixed-criticality system comprises safety-critical and non-safety-critical tasks sharing a
computational platform. Thus, different levels of assurance are required by different tasks in …

One of the major sources of pessimism in the response time analysis of globally scheduled
real-time tasks is the computation of the upper-bound on the inter-task interference. This …

Several task models have been introduced in the literature to describe the intrinsic
parallelism of real-time activities, including fork/join, synchronous parallel, DAG-based, etc …

Programmers resort to user-level parallel frameworks in order to exploit the parallelism
provided by multiprocessor platforms. While such general frameworks do not support the …