Add to ORKGIt is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy's fairness. For example, a policy that biases towards small job sizes so as to minimize mean response time may end up being unfair to large job sizes. In this paper we define three types of unfairness and demonstrate large classes of scheduling policies that fall into each type. We end with a discussion on which jobs are the ones being treated unfairly
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However,...
Loosely, fairness is the assurance of granting each request from a set of requests within a predeter...
We study size-based schedulers, and focus on the impact of inaccurate job size information on respon...
It is common to evaluate scheduling policies based on their mean response times. Another important, ...
Fairness is an important aspect in queuing systems. Several fairness measures have been proposed in ...
This paper investigates formally the problem of unfairness in SRPT scheduling as compared with PS sc...
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling ...
Parallel job schedulers have mostly been evalu-ated/compared using performance metrics. The de-ducti...
The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known to be optimal fo...
On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in s...
Abstract: "Providing fairness and providing good response times are often viewed as conflicting goal...
On-line machine scheduling has been studied extensively, but the fundamental issue of fair-ness in s...
To provide a better understanding of fair share policies supported by current production schedulers ...
In this paper we consider the following scenario. A set of n jobs with different threads is being ru...
The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known to be optimal fo...
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However,...
Loosely, fairness is the assurance of granting each request from a set of requests within a predeter...
We study size-based schedulers, and focus on the impact of inaccurate job size information on respon...
It is common to evaluate scheduling policies based on their mean response times. Another important, ...
Fairness is an important aspect in queuing systems. Several fairness measures have been proposed in ...
This paper investigates formally the problem of unfairness in SRPT scheduling as compared with PS sc...
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling ...
Parallel job schedulers have mostly been evalu-ated/compared using performance metrics. The de-ducti...
The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known to be optimal fo...
On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in s...
Abstract: "Providing fairness and providing good response times are often viewed as conflicting goal...
On-line machine scheduling has been studied extensively, but the fundamental issue of fair-ness in s...
To provide a better understanding of fair share policies supported by current production schedulers ...
In this paper we consider the following scenario. A set of n jobs with different threads is being ru...
The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known to be optimal fo...
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However,...
Loosely, fairness is the assurance of granting each request from a set of requests within a predeter...
We study size-based schedulers, and focus on the impact of inaccurate job size information on respon...