Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
End-to-end deadline control for aperiodic tasks in distributed real-time systems
The Journal of Supercomputing
End-to-end utilization control for aperiodic tasks in distributed real-time systems
Journal of Computer Science and Technology
Nonutilization bounds and feasible regions for arbitrary fixed-priority policies
ACM Transactions on Embedded Computing Systems (TECS)
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
RT-Llama: Providing Middleware Support for Real-Time SOA
International Journal of Systems and Service-Oriented Engineering
| Hi-index | 0.00 |
This paper generalizes the notion of utilization bounds for schedulability of aperiodic tasks to the case of distributed resource systems. In the basic model, aperiodically arriving tasks are processed by multiple stages of a resource pipeline within end-to-end deadlines. The authors consider a multi-dimensional space in which each dimension represents the instantaneous utilization of a single stage. A feasible region is derived in this space such that all tasks meettheir deadlines as long as pipeline resource consumption remains within the feasible region. The feasible region is a multi-dimensional extension of the single-resource utilization bound giving rise to a bounding surface in the utilization space rather than a scalar bound. Extensions of the analysis are provided to non-independent tasks and arbitrary task graphs. We evaluate the performance of admission control using simulation, as well as demonstrate the applicability of these results to task schedulability analysis in the total ship computing environment envisioned by the US navy.