Real-time computing plays a crucial role in our society since an increasing number of
complex systems rely, in part or completely, on computer control. Examples of applications …

The question whether preemptive algorithms are better than nonpreemptive ones for
scheduling a set of real-time tasks has been debated for a long time in the research …

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

The schedulability of systems using fixed priority pre-emptive scheduling can be improved
by the use of non-pre-emptive regions at the end of each task's execution, an approach …

Fixed-priority scheduling has been widely used in safety-critical applications. This paper
explores the parametric utilization bounds for implicit-deadline periodic tasks in automotive …

Emerging technologies like autonomous driving entail computational intense software
solutions. More and more companies accelerate their embedded applications by General …

In this paper, we take a careful look at speedup factors, utilization bounds, and capacity
augmentation bounds. These three metrics have been widely adopted in real-time …

Preemptive schedulers have been widely adopted in single processor real-time systems to
avoid the blocking associated with the non-preemptive execution of lower priority tasks and …

Safety-critical embedded systems such as autonomous vehicles typically have only very
limited computational capabilities on board that must be carefully managed to provide …

Combinatorial explosion is a challenge for many analysis problems in the theory of hard real-
time systems. One of these problems is static priority schedulability of workload models …