CaltechAUTHORS
  A Caltech Library Service

Classifying scheduling policies with respect to higher moments of conditional response time

Wierman, Adam and Harchol-Balter, Mor (2005) Classifying scheduling policies with respect to higher moments of conditional response time. ACM SIGMETRICS Performance Evaluation Review, 33 (1). pp. 229-240. ISSN 0163-5999. doi:10.1145/1064212.1064238. https://resolver.caltech.edu/CaltechAUTHORS:20210310-083407671

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:20210310-083407671

Abstract

In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order to understand the predictability of response times under a range of scheduling policies, we study the conditional variance in response times seen by jobs of different sizes. We define a metric and a criterion that distinguish between contrasting functional behaviors of conditional variance, and we then classify large groups of scheduling policies.In addition to studying the conditional variance of response times, we also derive metrics appropriate for comparing higher conditional moments of response time across job sizes. We illustrate that common statistics such as raw and central moments are not appropriate when comparing higher conditional moments of response time. Instead, we find that cumulant moments should be used.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1145/1064212.1064238DOIArticle
Additional Information:© 2005 ACM. Supported by NSF Career Grant CCR-0133077, NSF Theory CCR-0311383, NSF ITR CCR-0313148, IBM Corporation via Pittsburgh Digital Greenhouse Grant 2003, and a NSF Graduate Research Fellowship.
Funders:
Funding AgencyGrant Number
NSFCCR-0133077
NSFCCR-0311383
NSFCCR-0313148
IBM CorporationUNSPECIFIED
Pittsburgh Digital Greenhouse2003
NSF Graduate Research FellowshipUNSPECIFIED
Subject Keywords:Scheduling; response time; predictability; variance; cumulants; M/G/1; FB; LAS; SET; foreground-background; least attained service; PS; processor sharing; SRPT; shortest remaining processing time; PSJF; shortest job first
Issue or Number:1
DOI:10.1145/1064212.1064238
Record Number:CaltechAUTHORS:20210310-083407671
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20210310-083407671
Official Citation:Adam Wierman and Mor Harchol-Balter. 2005. Classifying scheduling policies with respect to higher moments of conditional response time. SIGMETRICS Perform. Eval. Rev. 33, 1 (June 2005), 229–240. DOI: https://doi.org/10.1145/1071690.1064238
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:108378
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:10 Mar 2021 19:46
Last Modified:16 Nov 2021 19:11

Repository Staff Only: item control page