Comparison of Loss ratios of different scheduling algorithms

Details Comparison of Loss ratios of different scheduling algorithms Comparison of Loss ratios of different scheduling algorithms

2011-01-06

arxiv.org/abs/1101.1466v1

Computer Science

Operating Systems

8 pages, 10 figures

Scientific paper

It is well known that in a firm real time system with a renewal arrival process, exponential service times and independent and identically distributed deadlines till the end of service of a job, the earliest deadline first (EDF) scheduling policy has smaller loss ratio (expected fraction of jobs, not completed) than any other service time independent scheduling policy, including the first come first served (FCFS). Various modifications to the EDF and FCFS policies have been proposed in the literature, with a view to improving performance. In this article, we compare the loss ratios of these two policies along with some of the said modifications, as well as their counterparts with deterministic deadlines. The results include some formal inequalities and some counter-examples to establish non-existence of an order. A few relations involving loss ratios are posed as conjectures, and simulation results in support of these are reported. These results lead to a complete picture of dominance and non-dominance relations between pairs of scheduling policies, in terms of loss ratios.

Affiliated with

Also associated with

No associations

Rating

Comparison of Loss ratios of different scheduling algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comparison of Loss ratios of different scheduling algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparison of Loss ratios of different scheduling algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400049