Published June 2003 | public
Journal Article

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

Abstract

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.

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.

Additional details

Created:
August 22, 2023
Modified:
October 20, 2023