This paper summarizes the state of the real-time field in the areas of scheduling and
operating system kernels. Given the vast amount of work that has been done by both the …

A real-time operating system kernel, called the Spring kernel, that provides some of the
basic support required for large, complex, next-generation real-time systems, especially in …

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 …

Process scheduling in real-time systems has almost invariably used one or more of three
algorithms: fixed priority, FIFO, or round robin. The reasons for these choices are simplicity …

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 …

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 …

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 …

Scheduling for embedded real-time systems Page 1 REAL-TIME EMBEDDED SYSTEMS are
of- ten characterized by the need for running several tasks on a limited set of processing units …

Next generation real-time systems will require greater flexibility and predictability than is
commonly found in today's systems. These future systems include the space station …

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 …