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 …

Most recurrent real-time applications can be modeled as a set of sequential code segments
(or blocks) that must be (repeatedly) executed in a specific order. In this paper, we provide a …

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 …

Current computing architectures are commonly built with multiple cores and a single shared
main memory. Even though this architecture increases the overall computation power, main …

Parallelization of tasks and efficient utilization of processors are considered important and
challenging in operating large-scale real-time systems. Recently, deep reinforcement …

Limited preemptive (LP) scheduling has been demonstrated to effectively improve the
schedulability of fully preemptive (FP) and fully non-preemptive (FNP) paradigms. On one …

Guaranteeing timing constraints for parallel real-time applications deployed on multicore
platforms is challenging, especially for applications containing non-preemptive execution …

Designing timing-anomaly free multiprocessor scheduling algorithms is a notoriously hard
problem, especially for parallel tasks with non-preemptive execution regions. In this paper …

Schedulability analysis for real-time systems has been the subject of prominent research
over the past several decades. One of the key foundations of schedulability analysis is an …

Many-to-many mapping models for user-to kernel-level threads (or" M: N threads") have
been extensively studied for decades as a lightweight substitute for current Pthreads …