SS01 ¿¿¿ Explicit per-task deadline scaling for uniprocessor scheduling of job-level static mixed-criticality systems

摘要

Scheduling for mixed-criticality (MC) systems needs to consider priority promotion in LO mode in order to be prepared for the immediate utilization increase when switching to HI mode. An established method for that is the use of virtual deadlines. The EDF-VD (Earliest Deadline First with Virtual Deadlines) algorithm applies a uniform deadline scaling with only one scaling factor x. A generalization to nonuniform deadline scaling is attractive since this relaxation potentially renders corresponding schedulability tests less pessimistic and more resource-efficient. We present a new, general and explicit per-task deadline scaling, evaluate and discuss the properties of the associated schedulability test with respect to established deadline scaling approaches.