Prior work has identified several optimal algorithms for scheduling independent, implicit-
deadline sporadic (or periodic) real-time tasks on identical multiprocessors. These …

Background: Nowadays, there is an immense increase in the demand for high power
computation of real-time workloads and the trend towards multi-core and multiprocessor …

Many real-time software systems, such as those commonly found in the context of
multimedia, cloud computing, robotics, and real-time databases, are characterized by a …

Weakly hard real-time systems can, to some degree, tolerate deadline misses, but their
schedulability still needs to be analyzed to ensure their quality of service. Such analysis …

Real-time applications with high computational demand, eg, autonomous driving, are
emerging and their complex nature conforms to a DAG (directed acyclic graph) structure. We …

Recent work showed that semi-partitioned scheduling can achieve near-optimal
schedulability performance, is simpler to implement compared to global scheduling, and …

This work proposes CAlECs, a clustered scheduling system for MPSoCs subject to thermal
and energy constraints. It calculates off-line a cyclic executive honoring temporal and …

Recent parallel programming frameworks such as OpenCL and OpenMP allow us to enjoy
the parallelization freedom for real-time tasks. The parallelization freedom creates the time …

Targeting global EDF scheduling, this paper proposes a conditionally optimal algorithm for
parallelizing tasks with parallelization freedom. For this, we extend the interference-based …

The contention-free policy has received attention in real-time multiprocessor scheduling
owing to its wide applicability and significant improvement in offline schedulability …