Temporal analysis for hard real-time scheduling

The authors present an analysis technique for time driven scheduling based on the timing requirements of tasks. The analysis results in the establishment of a set of temporal relations between pairs of tasks based on a nonpreemptive scheduling model. The relationships can be used effectively to reduce the average complexity of scheduling these tasks. They also serve as a basis for selective preemption policies for scheduling by providing an early test for infeasibility. Examples and simulation results are presented to confirm the usefulness of temporal analysis as a phase prior to scheduling.<
>