B. Schroeder and M. Harchol-Balter. "Web servers under overload: How scheduling can help." 18th International Teletra#c Congress . Berlin, Germany. September 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Server Scheduling in the L_p Norm: A Rising Tide Lifts All.. - Bansal, Pruhs (2003) (Correct)
....norm of flow, 1 p 1 and for sufficiently small ffl. This is perhaps surprising, since fairness is a commonly cited reason for adopting Processor Sharing [28] 2. RELATED RESULTS The results in the literature that are closest in spirit to those here are found in a series of papers, including [6, 13, 16, 27]. These papers also argue that SRPT will not unnecessarily starve jobs any more than Processor Sharing does under normal situations. In these papers, normal is defined as there being a Poisson distribution on release times, and processing times being independent samples from a heavily tailed ....
B. Schroeder and M. Harchol-Balter. Web servers under overload: how scheduling can help.
An Architecture for Highly Concurrent, Well-Conditioned Internet.. - Welsh (Correct)
....related to the issue of bandwidth throttling is the use of network scheduling techniques to give priority to some responses over others. One technique that has been explored is the use of shortest remaining processing time (SRPT) alternately called shortest connection first (SCF) scheduling [35, 57, 116]. In this technique, packets for connections with less remaining outgoing data are scheduled first for network transmission. In [116] Schroeder and Harchol Balter investigate use of SRPT network scheduling for managing overload; they show that under a heavytailed request size distribution, SRPT ....
....One technique that has been explored is the use of shortest remaining processing time (SRPT) alternately called shortest connection first (SCF) scheduling [35, 57, 116] In this technique, packets for connections with less remaining outgoing data are scheduled first for network transmission. In [116], Schroeder and Harchol Balter investigate use of SRPT network scheduling for managing overload; they show that under a heavytailed request size distribution, SRPT greatly reduces response times and does not penalize long 38 responses. Their study is limited to static responses and does not look ....
B. Schroeder and M. Harchol-Balter. Web servers under overload: How scheduling can help. Technical Report CMU-CS-02-143, Carnegie-Mellon University, June 2002.
Fluid and Diffusion Limits for Transient Sojourn Times of.. - Hampshire, al. Self-citation (Harchol-balter) (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. "Web servers under overload: How scheduling can help." 18th International Teletra#c Congress . Berlin, Germany. September 2003.
Bounds on a Fair Policy with Near Optimal Performance - Wierman, Harchol-Balter (2003) Self-citation (Harchol-balter) (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. Web servers under overload: How scheduling can help. In International Teletraffic Congress (ITC 2003.
Predicting short-transfer latency from TCP arcana: A.. - Arlitt.. (2005) (Correct)
No context found.
SCHROEDER, B., AND HARCHOL-BALTER, M. Web servers under overload: How scheduling can help. ACM Trans. on Internet Techologies 6, 1 (Feb. 2006).
A Method for Transparent Admission Control and.. - Elnikety, Nahum.. (2004) (3 citations) (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. Web servers under overload: How scheduling can help. Technical Report CMU-CS-02-143, Carnegie-Mellon University C.S. Department, Pittsburgh, PA, July 2002.
Size-based Scheduling Policies with Inaccurate Scheduling.. - Dong Lu Huanyuan (Correct)
No context found.
SCHROEDER, B., AND HARCHOL-BALTER,M. Web servers under overload: How scheduling can help. Tech. Rep. CMU-CS-02-143, Carnegie Mellon School of Computer Science, June 2002.
Effectiveness of Dynamic Resource Allocation for Handling.. - Chandra, Shenoy (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. Web servers under overload: How scheduling can help. In Proceedings of the 18th International Teletraffic Congress, 2003.
Cataclysm: Handling Extreme Overloads in Internet Services - Urgaonkar, Shenoy (2004) (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. Web servers under overload: How scheduling can help. In 18th International Teletraffic Congress, Berlin, Germany, 2003.
Server Scheduling in the L_p Norm: A Rising Tide Lifts All.. - Bansal, Pruhs (2003) (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. Web servers under overload: how scheduling can help.
Algorithms for Flow Time Scheduling - Bansal (2003) (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. Web servers under overload: how scheduling can help. CMU technical report, CMU-CS-02-143.
Effects and Implications of File Size/Service Time.. - Lu, Sheng, Dinda (2004) (1 citation) (Correct)
No context found.
SCHROEDER, B., AND HARCHOL-BALTER, M. Web servers under overload: How scheduling can help, June 2002.
Multi-processor Scheduling to Minimize Flow Time with.. - Chekuri, Goel, l. (2004) (Correct)
No context found.
B. Schroeder and M. Harchol-Balter. Web servers under overload : how scheduling can help. Proc. of 18th International Teletra#c Congress, 2003.
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