Real-time multiprocessor systems are now commonplace. Designs range from single-chip
architectures, with a modest number of processors, to large-scale signal-processing …

The well known periodic task model of CL Liu and JW Layland (1973) assumes a worst case
execution time bound for every task and may be too pessimistic if the worst case execution …

The scheduling of systems of periodic tasks upon multiprocessor platforms is considered.
Utilization-based conditions are derived for determining whether a periodic task system …

In this paper, we study the problem of allocating a set of periodic tasks on a multiprocessor
system such that tasks are scheduled to meet their deadlines on individual processors by …

In this paper, we compare the PD/sup 2/Pfair algorithm to the EDF-FF partitioning scheme,
which uses" first fit"(FF) as a partitioning heuristic and the earliest-deadline-first (EDF) …

As more and more data is generated at a faster-than-ever rate, processing large volumes of
data is becoming a challenge for data analysis software. Addressing performance issues …

We propose an online resource allocation solution for multiprocessor systems-on-chip, that
executes several real-time, streaming media jobs simultaneously. The system consists of up …

Nowadays, owing to unpredictable changes of the environment and workload variation,
optimally running multiple applications in terms of quality, performance and power …

We propose a new approach to the problem of workload partitioning and assignment for
very large distributed real-time systems, in which software components are typically …

Proportionate fair (Pfair) scheduling is the only known way to optimally schedule periodic
real-time task systems on multiprocessors in an on-line manner. Under Pfair scheduling, the …