The derivation of scheduling algorithms from a timing model

Abstract

We first present a timing model for describing the temporal behaviour of a real-time application. Then, within this model, we specify formally the scheduling problem through a relation between so called temporal profiles. We show how this relation can be generically decomposed and implemented on different machine architectures.<>