This paper presents a timing analysis for a quite general hard real-time periodic task set on
a uniprocessor using fixed-priority methods. Periodic tasks are composed of serially …

There has been considerable activity in recent years in developing analytical techniques for
hard real-time systems. Inevitably these techniques make simplifying assumptions so as to …

The timeliness of task execution in real-time systems is addressed. Specifically, the dynamic
scheduling of tasks with well-defined timing constraints is investigated. A dynamic …

The authors explain why pre-run-time scheduling is essential if one wishes to guarantee that
timing constraints will be satisfied in a large complex hard-real-time system. They examine …

In many real-time systems relative timing constraints are imposed on a set of tasks.
Generating a correct ordering for the tasks and deriving their proper start-time assignments …

Formal results for precedence constrained, real-time scheduling of unit time tasks are
extended to arbitrary timed tasks with preemption. An exact characterisation of the EDF-like …

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 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 …

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 …

Scheduling theory holds great promise as a means to a priori validate timing correctness of
real-time applications. However, there currently exists a wide gap between scheduling …