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 …

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 …

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 …

A prerun-time scheduling algorithm is presented that addresses the problem of process
sequencing. The algorithm is designed for multiprocessor applications with preemptable …

The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single
unit software resources on a single processor is considered. The correctness conditions are …

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 …

This paper presents a timing analysis for a quite general hard real-time periodic task set on
a uniprocessor using fixed-priority methods. Periodic tasks are composed of serially …

In the time-driven scheduling (TDS) model, both the importance value and timing criticality of
each task are given together as a function of time. The TDS scheduler attempts to maximize …

Issues of real-time resource management are pervasive throughout industrial computing.
The underlying physical processes of many industrial computing applications impose …

Hard real-time systems require both functionally correct executions and results that are
produced on time. Nuclear power plants, flight control, and avionics are examples of such …