Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Stochastic Analysis of a Reseveration Based System
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Global Multiprocessor Scheduling of Aperiodic Tasks using Time-Independent Priorities
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
WCET Analysis of Probabilistic Hard Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Time
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
On Schedulability Bounds of Static Priority Schedulers
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations
IEEE Transactions on Computers
IEEE Transactions on Computers
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we propose the expected schedulability to characterize the schedulability for the stochastic tasks on a single real-time computer processor. Our results show that the stochastic model has more flexibility to characterize the real-time tasks than the deterministic model. The expected schedulability is related to the real-time t at tasks arrival and may show that a sub-set of task would be scheduled at any given real-time interval. The numerical analysis based on our theoretic results is consistent with the simulation analysis. Both numerical and simulation results show that the tasks would be scheduled for real-time tasks in realtime systems if the traffic load is less than a specific value which is more than 69%, which was provided in some deterministic situations. This observation implies that the expected schedulability based on the stochastic model would provide a bigger threshold for the real-time tasks to be scheduled.