In this 25th year anniversary paper for the IEEE Real Time Systems Symposium, we review
the key results in real-time scheduling theory and the historical events that led to the …

We present an optimal real-time scheduling algorithm for multiprocessors $ one that satisfies
all task deadlines, when the total utilization demand does not exceed the utilization capacity …

This paper develops and evaluates new share-based scheduling algorithms for
differentiated service quality in network services, such as network storage servers. This form …

We are developing Virtuoso, u system, for distributed computing using virtual machines
(VMs). Virtuoso must be uble to mix batch und interactive VMs on the same physical …

The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally
scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is also …

For real-time systems, multiprocessor support is indispensable to handle the large number
of requests. Existing on-line scheduling algorithms such as Earliest Deadline First Algorithm …

We consider the implementation of a Pfair real-time scheduler on a symmetric
multiprocessor (SMP). Although SMPs are in many ways well-suited for Pfair scheduling …

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

In dynamic real-time task systems, tasks that are subject to deadlines are allowed to join and
leave the system. In previous work, Stoica et al. and Baruah et al. presented conditions …

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 …