77 search results - page 2 / 16 » SRPT Scheduling for Web Servers |
CN
2006
13 years 5 months ago
2006
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...
IMSCCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
—Load balancing is a common approach for task assignment in distributed architectures. In this paper, we show that the degree of inefficiency in load balancing designs is highly...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
SIAMCOMP
2010
12 years 12 months ago
2010
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...