Sciweavers

13 search results - page 1 / 3
» The average response time in a heavy-traffic srpt queue
Sort
View
SIGMETRICS
2010
ACM
115views Hardware» more  SIGMETRICS 2010»
12 years 11 months ago
The average response time in a heavy-traffic srpt queue
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...
Minghong Lin, Adam Wierman, Bert Zwart
JSSPP
2001
Springer
13 years 9 months ago
SRPT Scheduling for Web Servers
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the following question: Is it possible to reduce the expected response time of every req...
Mor Harchol-Balter, Nikhil Bansal, Bianca Schroede...
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
13 years 10 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
CLUSTER
2006
IEEE
13 years 4 months ago
Deferred Assignment Scheduling in Cluster-Based Servers
This paper proposes a new scheduling policy for cluster-based servers called DAS (Deferred Assignment Scheduling). The main idea in DAS is to defer scheduling as much as possible,...
Victoria Ungureanu, Benjamin Melamed, Michael N. K...
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
13 years 10 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
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...
Adam Wierman, Mor Harchol-Balter