A Synthetic Utilization Bound for Aperiodic Tasks with Resource TequirementsReport
Utilization bounds for schedulability of aperiodic tasks are new in real-time scheduling literature. All aperiodic bounds known to date apply only to independent tasks. They either assume a liquid task model (one with infinitely many infinitesimal tasks) or are limited to deadline-monotonic and earliest-deadline first scheduling. In this paper, the authors make two important contributions. First, they derive the first aperiodic utilization bound that considers a task model with resource requirements. Second, the new bound is a function of a parameter called preemptable deadline ratio that depends on the scheduling policy. We show that many scheduling policies can be classified by this parameter allowing per-policy bounds to be derived. Simulation results demonstrating the applicability of aperiodic utilization bounds are presented.
Note: Abstract extracted from PDF text
All rights reserved (no additional license for public reuse)
Abdelzaher, Tarek, and Vivek Sharma. "A Synthetic Utilization Bound for Aperiodic Tasks with Resource Tequirements." University of Virginia Dept. of Computer Science Tech Report (2002).
University of Virginia, Department of Computer Science