The performance of a mixed priority real-time scheduling algorithm

The performance of the Predicitve Deadline (PD) Scheduling algorithm I Miller89,90,91 ] is specified. The PD algorithm extends the Earliest Deadline (ED) Scheduling algoritl~m [Liu731 to predict timing faults and effect load shedding. The measure of performance specified in this work is the achievable processor utilization (APU) for a single processor. APU is defined as the ratio of the computation time used to execute application functions to the total time of an execution trace. A general expression characterizing APU for dyuamic real-time scheduling algorithms which is based solely on scheduling overhead is presented.