It is over 40 years since the first seminal work on priority assignment for real-time systems
using fixed priority scheduling. Since then, huge progress has been made in the field of real …

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 …

This paper was written to accompany a talk at the ETR Summer School in Toulouse 2013. It
provides a background and primer to scheduling and schedulability analysis for hard real …

The detection and tracking of people lie at the heart of many current and near-future
applications of computer vision. We describe a background subtraction system designed to …

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 …

In the limited-preemption scheduling model, tasks cooperate to offer suitable preemption
points for reducing the overall preemption overhead. In the fixed preemption-point model …

Cache-related pre-emption delays (CRPD) have been integrated into the schedulability
analysis of sporadic tasks with constrained deadlines for fixed-priority pre-emptive …

In the development of real-time embedded applications, especially those on systems-on-
chip, an efficient use of RAM memory is as important as the effective scheduling of the …

Commercial off-the-shelf programmable platforms for real-time systems typically contain a
cache to bridge the gap between the processor speed and main memory speed. Because …

Interest in real-time multiprocessor scheduling has been rekindled as multi-core chips are
increasingly used for embedded real-time systems. While tasks may be preemptive or non …