In a multiprocessor system, the limited resources consist of one or more processors, which
can be either identical or distinct with respect to function and speed. The systems we focus …

The recent emergence of multicore and related technologies in many commercial systems
has increased the prevalence of multiprocessor architectures. Contemporaneously, real …

Preemptive scheduling of periodically arriving tasks on a multiprocessor is considered. We
show that many common multiprocessor real-time scheduling algorithms suffer from …

Guaranteeing that time critical tasks will meet their timing constraints is an important aspect
of real-time systems research. Indeed, a real time system is dynamic and consequently …

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 …

We present a new approach to decrease task preemptions and migrations in optimal global
real-time schedules on symmetric multiprocessors. Contrary to classical approaches, our …

The problem of scheduling periodic time critical tasks on a monoprocessor computer system
is examined. Such tasks consist of an infinite number of requests, each with a prescribed …

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 …

Recent results in the application of scheduling theory to hard real-time systems are reviewed
in this paper. The review takes the form of an analysis of the problems presented by different …

Many time-critical applications require predictable performance and tasks in these
applications have deadlines to be met. In this paper, we propose an efficient algorithm for …