Stochastic Analysis of Expected Schedulability for Real-Time Tasks on a Single Computing System
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Improved worst-case response-time calculations by upper-bound conditions
Proceedings of the Conference on Design, Automation and Test in Europe
Nonutilization bounds and feasible regions for arbitrary fixed-priority policies
ACM Transactions on Embedded Computing Systems (TECS)
Multiprocessor extensions to real-time calculus
Real-Time Systems
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
While utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound itself. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this paper, we develop a general framework that allows one to effectively derive schedulability bounds for a wide range of real-time systems with different workload patterns and schedulers. Our analytical model is capable of describing a wide range of tasks and schedulers' behaviors. We propose a new definition of utilization, called workload rate. While similar to utilization, workload rate enables flexible representation of different scheduling and workload scenarios and leads to uniform derivation of schedulability bounds. We derive a parameterized schedulability bound for static priority schedulers with arbitrary priority assignment. Existing utilization bounds for different priority assignments and task releasing patterns can be derived from our closed-form formula by simple assignments of proper parameters.