Sciweavers

14 search results - page 1 / 3
» Asymptotic convergence of scheduling policies with respect t...
Sort
View
PE
2002
Springer
134views Optimization» more  PE 2002»
13 years 7 months ago
Asymptotic convergence of scheduling policies with respect to slowdown
Mor Harchol-Balter, Karl Sigman, Adam Wierman
MASCOTS
2003
13 years 8 months ago
Quantifying the Properties of SRPT Scheduling
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Proc...
Mingwei Gong, Carey L. Williamson
CN
2006
93views more  CN 2006»
13 years 7 months ago
Revisiting unfairness in Web server scheduling
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Ti...
Mingwei Gong, Carey L. Williamson
SIGMETRICS
2002
ACM
110views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Understanding the slowdown of large jobs in an M/GI/1 system
We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the it slowdown experienced by largest jobs. We consider sche...
Mor Harchol-Balter, Karl Sigman, Adam Wierman
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
14 years 20 days ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
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....
Adam Wierman, Mor Harchol-Balter