Multi-core processors offer a significant performance increase over single-core processors.
They have the potential to enable computation-intensive real-time applications with stringent …

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 …

In graph-based learning models, entities are often represented as vertices in an undirected
graph with weighted edges describing the relationships between entities. In many real-world …

Recently, multi-core processors have become mainstream in processor design. To take full
advantage of multi-core processing, computation-intensive real-time systems must exploit …

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 systems increasingly contain processing units with multiple cores. To use this
additional computational power in hard deadline environments, one needs schedulability …

As the complexity of software for Cyber-Physical Systems (CPS) rapidly increases, multi-
core processors and parallel programming models such as OpenMP become appealing to …

The study of parallel task models executed with predictable scheduling approaches is a
fundamental problem for real-time multiprocessor systems. Nevertheless, to date, limited …

Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-
cores, where each heavy task exclusively executes on a number of dedicated processors …

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 …