Abstract | |
|
Back to Advance Program
A Synthetic Utilization Bound for Aperiodic Tasks with Resource RequirementsTarek Abdelzaher and Vivek SharmaTo appear at Euromicro Conference on Real-Time Systems (ECRTS03), Porto, Portugal, 2-4 July 2003
AbstractUtilization 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.
10 Mar 2003 at 21:02:26 |