A comparative study for real time scheduling

Author

Masmoudi, Sahla ; Saidane, Leila Azouz

Author_Institution

Univ. of Manouba, Tunis

fYear

2007

fDate

11-14 Dec. 2007

Firstpage

530

Lastpage

533

Abstract

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.

Keywords

packet switching; probability; quality of service; scheduling; deadline monotonic; earliest deadline first; end-to-end quality of service; first in first out; packet scheduling; probabilistic quality of service; real time scheduling; Delay; Delta modulation; Mathematical model; Network topology; Processor scheduling; Propagation losses; Telecommunication traffic; Traffic control; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Circuits and Systems, 2007. ICECS 2007. 14th IEEE International Conference on

Conference_Location

Marrakech

Print_ISBN

978-1-4244-1377-5

Electronic_ISBN

978-1-4244-1378-2

Type

conf

DOI

10.1109/ICECS.2007.4511045

Filename

4511045