A comparative study for real time scheduling
Sahla Masmoudi, Leı̈la Azouz Saı̈dane · 2007
In this paper, we consider flows with quantitative end-to-end QoS guarantees. We assume that packets are scheduled according to their fixed priority, reflecting the importance degree of one flow; for packets having the same fixed priority on a node, packet with the smallest relative deadline is the first scheduled. This policy is called FP/DM takes into account the deadline requirements. We are interested in probabilistic QoS guarantees which consist in determining the probability of meeting the deadline for one considered flow. We then compare the policy FP/DM to other policies (FP/FIFO and FP/EDF) and we try then to ameliorate the policy FP/DM.