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 …

An investigation is conducted of two protocols belonging to the priority inheritance protocols
class; the two are called the basic priority inheritance protocol and the priority ceiling …

We consider the complexity of determining whether a set of periodic, real-time tasks can be
scheduled on m⩾ 1 identical processors with respect to fixed-priority scheduling. It is shown …

Consideration is given to the preemptive scheduling of hard-real-time sporadic task systems
on one processor. The authors first give necessary and sufficient conditions for a sporadic …

Abstract The Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky is a policy for
locking binary semaphores that bounds priority inversion (ie, the blocking of a job while a …

A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular
arrival times and hard deadlines. Aperiodic tasks have irregular arrival times and either soft …

We investigate the preemptive scheduling of periodic, real-time task systems on one
processor. First, we show that when all parameters to the system are integers, we may …

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 …

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 …

With the widespread adoption of multicore architectures, multiprocessors are now a
standard deployment platform for (soft) real-time applications. This dissertation addresses …