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 …

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 …

Scheduling theories for fixed priority pre-emptive scheduling are now sufficiently mature that
a genuine engineering approach to the construction of hard real-time systems is possible. In …

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 …

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 …

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 …

This paper addresses the schedulability problem of periodic and sporadic real-time task sets
with constrained deadlines preemptively scheduled on a multiprocessor platform composed …

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 …

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 …

Optimal scheduling of real-time tasks on multiprocessor systems is known to be
computationally intractable for large task sets. Any practical scheduling algorithm for …