As the real-time computing industry moves away from static cyclic executive-based
scheduling towards more flexible process-based scheduling, so it is important for current …

One common way of constructing hard real-time systems is to use a number of periodic and
sporadic tasks assigned static priorities and dispatched at run-time according to the …

This paper discusses the addition of so-called time offsets to task sets dispatched according
to fixed priorities. The motivation for this work is two-fold: firstly, direct expression of time …

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 …

A uniform, flexible approach is proposed for analysing the feasibility of deadline scheduled
real-time systems. In its most general formulation, the analysis assumes sporadically …

The use of computers to control safety-critical real-time functions has increased rapidly over
the past few years. As a consequence, real-time systems—computer systems where the …

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the
literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that …

Since worst case response times must be determined repeatedly during the interactive
design of real-time application systems, repeated exact computation of such response times …

The paper presents exact schedulability analyses for real-time systems scheduled at runtime
with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to …

This paper extends the current analysis associated with static priority pre-emptive based
scheduling to address the wider problem of analysing schedulability of a distributed hard …