Real-time systems are often designed using a set of periodic tasks. Task periods are usually
set by the system requirements, but deadlines and computation times can be modified in …

We consider here the problem of scheduling tasks each of which is logically decomposed
into a mandatory subtask and an optional subtask. The mandatory subtask must be …

This paper examines a fundamental problem in the theory of real-time scheduling, that of
scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and …

Knowledge of complexity, fundamental limits and performance bounds-well known for many
scheduling problems-helps real time designers choose a good design and algorithm and …

This book provides a comprehensive overview of both theoretical and pragmatic aspects of
resource-allocation and scheduling in multiprocessor and multicore hard-real-time systems …

The use of computers to control safety-critical real-time functions has increased rapidly over
the past few years. As a consequence, real-time systems—computer systems where the …

Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest
deadline first (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems …

This paper describes a scheduling algorithm for a set of tasks that guarantees the time within
which a task, once started, will complete. A task is started upon receipt of an external signal …

Most real-time scheduling algorithms schedule tasks with regard to their worst case
computation times. Resources reclaiming refers to the problem of utilizing the resources left …

Multiprocessor architecture becomes common on real-time systems as the workload of real-
time systems increases. Recently new deadline-based (EDF-based) multiprocessor …