Many real-time systems rely on static scheduling algorithms. This includes cyclic scheduling,
rate monotonic scheduling and fixed schedules created by off-line scheduling techniques …

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 …

IN HARD REAL-TIME SYSTEMS, TASKS HAVE TO BE PERFORMED NOT ONLY
CORRECT-LY, BUT ALSO IN A TIMELY FASHION. OTHERWISE, THERE MIGHT BE …

The problem of real-time scheduling spans a broad spectrum of algorithms from simple
uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we …

The optimality of the Earliest Deadline First scheduler for uniprocessor systems is one of the
main reasons behind the popularity of this algorithm among real-time systems. The ability of …

The utilization bound for earliest deadline first (EDF) scheduling is extended from
uniprocessors to homogeneous multiprocessor systems with partitioning strategies. First …

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 …

Scheduling theories for fixed priority pre-emptive scheduling are now sufficiently mature that
a genuine engineering approach to the construction of hard real-time systems is possible. In …

This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion
(EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. The …

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 …