What is it about?
This article presents two Markov models that can be used to compute the Probability Mass Function of the response times of tasks scheduled by a reservation-based scheduler (the article mentions the CBS, but the proposed model can be applied to other reservation-based schedulers). The first model can be applied to periodic tasks with variable execution times (described by a PMF), while the second model can be applied to tasks with constant execution times and variable inter-arrival times (described by a PMF).
Featured Image
Why is it important?
The proposed Markov models allow moving from worst-case, pessimistic, schedulability analysis to a less pessimistic probabilistic analysis based on the probability of respecting deadlines.
Read the Original
This page is a summary of: QoS guarantee using probabilistic deadlines, Institute of Electrical & Electronics Engineers (IEEE),
DOI: 10.1109/emrts.1999.777471.
You can read the full text:
Contributors
The following have contributed to this page
