CaltechAUTHORS
  A Caltech Library Service

Fairness and classifications

Wierman, Adam (2007) Fairness and classifications. ACM SIGMETRICS Performance Evaluation Review, 34 (4). pp. 4-12. ISSN 0163-5999. doi:10.1145/1243401.1243405. https://resolver.caltech.edu/CaltechAUTHORS:20201104-083857037

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

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20201104-083857037

Abstract

The growing trend in computer systems towards using scheduling policies that prioritize jobs with small service requirements has resulted in a new focus on the fairness of such policies. In particular, researchers have been interested in whether prioritizing small job sizes results in large jobs being treated "unfairly." However, fairness is an amorphous concept and thus difficult to define and study. This article provides a short survey of recent work in this area.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1145/1243401.1243405DOIArticle
Additional Information:© 2007 Association for Computing Machinery.
Issue or Number:4
DOI:10.1145/1243401.1243405
Record Number:CaltechAUTHORS:20201104-083857037
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20201104-083857037
Official Citation:Adam Wierman. 2007. Fairness and classifications. SIGMETRICS Perform. Eval. Rev. 34, 4 (March 2007), 4–12. DOI:https://doi.org/10.1145/1243401.1243405
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:106421
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:04 Nov 2020 19:42
Last Modified:16 Nov 2021 18:54

Repository Staff Only: item control page