Uniprocessor EDF Scheduling of AVR Task Systems

The adaptive varying-rate (AVR) task model has been proposed as a means of modeling certain physically-derived constraints in CPS\u27s in a manner that is more accurate (less pessimistic) than is possible using prior task models from real-time scheduling theory. Existing work on schedulabil- ity analysis of systems of AVR tasks is primarily restricted to fixed-priority scheduling; this paper establishes schedu- lability analysis results for systems of AVR and sporadic tasks under Earliest Deadline First (EDF) scheduling. The proposed analysis techniques are evaluated both theoretically via the speedup factor metric, and experimentally via schedulability experiments on randomly-generated task systems