Comparison of Loss ratios of different scheduling algorithms

01/06/2011
by   Sudipta Das, et al.
0

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.

READ FULL TEXT
research
01/07/2020

On Competitive Analysis for Polling Systems

Polling systems have been widely studied, however most of these studies ...
research
12/06/2019

Scheduling in the Presence of Data Intensive Compute Jobs

We study the performance of non-adaptive scheduling policies in computin...
research
06/21/2022

Efficient scheduling in redundancy systems with general service times

We characterize the impact of scheduling policies on the mean response t...
research
08/14/2022

An Improved Greedy Algorithm for Stochastic Online Scheduling on Unrelated Machines

Most practical scheduling applications involve some uncertainty about th...
research
05/29/2018

Maximizing Service Reward for Queues with Deadlines

In this paper we consider a real time queuing system with rewards and de...
research
08/07/2019

Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distribution

Queuing systems with redundant requests have drawn great attention becau...
research
01/03/2022

Balanced Nonadaptive Redundancy Scheduling

Distributed computing systems implement redundancy to reduce the job com...

Please sign up or login with your details

Forgot password? Click here to reset