Real-time computing systems are vital to a wide range of applications. For example, they are
used in the control of nuclear reactors and automated manufacturing facilities, in controlling …

The design of software for hard-real-time systems is usually difficult to change because of
the constraints imposed by the need to meet absolute real-time deadlines on processors …

Builders of real-time systems often use priority scheduling in their systems without
considering alternatives. This paper examines one alternative, pre-run-time scheduling, and …

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 …

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 …

Real-time computing is an enabling technology for many important application areas,
including process control, nuclear power plants, agile manufacturing, intelligent vehicle …

Real-time computing systems are used to control telecommunication systems, defense
systems, avionics, and modern factories. Generalized rate-monotonic scheduling theory, is a …

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 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 …

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 …