A Caltech Library Service

Classifying scheduling policies with respect to unfairness in an M/GI/1

Wierman, Adam and Harchol-Balter, Mor (2003) Classifying scheduling policies with respect to unfairness in an M/GI/1. ACM SIGMETRICS Performance Evaluation Review, 31 (1). pp. 238-249. ISSN 0163-5999. doi:10.1145/885651.781057.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


It 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.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 2003 Association for Computing Machinery. This work was supported by NSF Career Grant CCR-0133077 and by Pittsburgh Digital Greenhouse Grant 01-1.
Funding AgencyGrant Number
Pittsburgh Digital Greenhouse01-1
Subject Keywords:Scheduling; unfairness; M/G/1; FB; LAS; SET; feedback; least attained service; shortest elapsed time; PS; processor sharing; SRPT; shortest remaining processing time; slowdown
Issue or Number:1
Record Number:CaltechAUTHORS:20201104-093530569
Persistent URL:
Official Citation:Adam Wierman and Mor Harchol-Balter. 2003. Classifying scheduling policies with respect to unfairness in an M/GI/1. SIGMETRICS Perform. Eval. Rev. 31, 1 (June 2003), 238–249. DOI:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:106425
Deposited By: Tony Diaz
Deposited On:05 Nov 2020 00:44
Last Modified:16 Nov 2021 18:54

Repository Staff Only: item control page