Adam Wierman, Mor Harchol-Balter  Home/Search
Context Related
Links: ACM DBLP | cmu.edu/~acw/Papers...classification.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~acw/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Adaptive Memory Allocations in Clusters - To Handle Unexpectedly (Correct)
Scheduling To Improve Queue Justice - Werner Sandmann Department (Correct)
Analysis of a Queueing Fairness Measure - Sandmann (2006) (Correct)
Active bibliography (related documents): More All
1.1: Classifying Scheduling Policies with Respect to.. - Wierman, Harchol-Balter (2003) (Correct)
0.4: Bounds on a Fair Policy with Near Optimal Performance - Wierman, Harchol-Balter (2003) (Correct)
0.4: Asymptotic Convergence of Scheduling Policies with.. - Harchol-Balter.. (2002) (Correct)
Similar documents based on text: More All
0.2: A note on comparing response times in the M/GI/1/FB and - Gi Ps Queues (Correct)
0.2: A note on comparing response times in the M/GI/1/FB.. - Wierman, Bansal.. (2002) (Correct)
0.2: Understanding the Slowdown of Large Jobs in an M/GI/1.. - Harchol-Balter, Sigman.. (Correct)
Related documents from co-citation: More All
6: Analysis of LAS scheduling for job size distributions with high variance - Rai, Urvoy-Keller et al. - 2003
5: Analysis of srpt scheduling: Investigating unfairness - Bansal, Harchol-Balter - 2000
4: Mixed scheduling disciplines for network flows (context) - Feng, Misra - 2003
BibTeX entry: (Update)
A. Wierman and M. Harchol-Balter. Classifying scheduling policies with respect to unfairness in an M/GI/1. In Proceedings of ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, 2003. http://citeseer.ist.psu.edu/article/wierman03classifying.html More
@misc{ wierman03classifying,
author = "Adam Wierman and Mor Harchol-Balter",
title = "Classifying Scheduling Policies with Respect to Unfairness in an M/GI/1",
text = "A. Wierman and M. Harchol-Balter. Classifying scheduling policies with
respect to unfairness in an M/GI/1. In Proceedings of ACM Sigmetrics Conference
on Measurement and Modeling of Computer Systems, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/wierman03classifying.html" }
Citations (may not include all citations):334 Operating System Concepts (context) - Silberschatz, Galvin - 1998 ACM
261 Modern Operating Systems (context) - Tanenbaum - 1992 ACM
143 Stochastic Modeling and the Theory of Queues (context) - Wolff - 1989
76 Bandwidth sharing and admission control for elastic traffic - Roberts, Massoulie - 1998 DBLP
64 Exploiting process lifetime distributions for dynamic load b.. (context) - Harchol-Balter, Downey - 1997 ACM DBLP
64 Analysis of SRPT scheduling: Investigating unfairness - Bansal, Harchol-Balter - 2001 DBLP
51 A parallel workload model and its implications for processor.. - Downey - 1997 ACM DBLP
50 Computer Applications (context) - Kleinrock, volume - 1976 ACM
38 Operating Systems (context) - Stallings - 1995 ACM DBLP
29 A proof of the optimality of the shortest remaining processi.. (context) - Schrage - 1968
26 Implementation of SRPT scheduling in web servers (context) - Harchol-Balter, Schroeder et al. - 2003
23 queue MG with shortest remaining processing time discipline (context) - Miller, with et al. - 1966
20 Asymptotic convergence of scheduling policies with respect t.. (context) - Harchol-Balter, Sigman et al. - 2002 ACM DBLP
20 Analysis of LAS scheduling for job size distributions with h.. - Rai, Urvoy-Keller et al. - 2003 ACM DBLP
17 Flow and stretch metrics for scheduling continous job stream.. (context) - Bender, Chakrabarti et al. - 1998
16 Valuation of ultra-scale computing systems (context) - Foster, Jette et al. - 1999 ACM DBLP
14 Properties and applications of the optimal queueing strategy.. (context) - Schreiber - 1993
13 variance delay time queueing system MG with optimal strategy.. (context) - variance, time et al. - 1993
8 Fairness and efficiency in web server protocols (context) - Friedman, Henderson - 2003 ACM DBLP
5 note comparing response time MGIFB and MGIPS queue - Bansal, note et al. - 2003
4 Competitive analysi MGI queueing policie - Wierman, of et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~acw/publications.html): More
An Improved Upper Bound for the Pebbling - Threshold Of The (Correct)
A note on comparing response times in the M/GI/1/FB and - Gi Ps Queues (Correct)
Asymptotic Convergence of Scheduling Policies with.. - Harchol-Balter.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC