This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a
uniprocessor system, compared to an optimal algorithm such as Earliest Deadline First …

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 …

A real-time monitor is employed to aid in scheduling tasks with random execution times in a
real-time computing system. The real-time monitor is composed of dedicated hardware …

Scheduling theory and algorithms have been well studied in the real-time systems literature.
Many useful approaches and solutions have appeared in different problem domains. While …

This paper is an extended version of a paper that appeared in the proceedings of the IEEE
Real-Time Systems Symposium 2009. This paper has been updated with respect to …

This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …

The thesis of this dissertation is that extending a general-purpose operating system with a
general, heterogeneous scheduling hierarchy is feasible and useful. A hierarchy of …

There has been considerable activity in recent years in developing analytical techniques for
hard real-time systems. Inevitably these techniques make simplifying assumptions so as to …

The purpose of this paper is to define the operational concept for a series of benchmark
requirements to be used to test the ability of a system to handle hard real-time applications …

CD Locke developed a heuristic, best-effort (BE) time-driven scheduling policy (Ph. D.
thesis, Dept. of Comput. Sci., Carnegie-Mellon Univ.,(1986)) and demonstrated its …