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

Modern cyber-physical embedded systems are characterized by a range of intricate
functionalities that are subject to tight timing constraints. Unfortunately, traditional sequential …

DAG-based scheduling models have been shown to effectively express the parallel
execution of current many-core heterogeneous architectures. However, their applicability to …

The second generation of robot operating system (ROS 2) received significant attention from
the real-time system research community, mostly aiming at providing formal modeling and …

We present a response time analysis for global fixed-priority preemptive scheduling of
constrained-deadline tasks upon a uniform multiprocessor where each processor can be …

As an effective method for detecting the schedulability of real-time tasks on multiprocessor
platforms, Response time analysis (RTA) has been deeply researched in recent decades …

The fixed preemption point (FPP) model has been studied as an alternative to fully
preemptive and non-preemptive models, as restricting preemptions to specific, predictable …

In many real-time application domains, there are execution dependencies, such tasks may
be formulated as multiple Directed Acyclic Graphs (DAGs) and scheduled with intra-task (ie …

Global limited preemptive real-time scheduling in multiprocessor systems using Fixed
Preemption Points (FPP) brings in an additional challenge with respect to the choice of the …

Embedded systems, performing specific functions in modern devices, have become
pervasive in today's technology landscape. As many of these systems are real-time systems …