Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, and Mukesh Agrawal. Implementation of SRPT scheduling in web servers. Technical Report CMU-CS-00-170, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
EquiLoad: a load balancing policy for clustered web servers - Ciardo, Riska, Smirni (2001) (1 citation) (Correct)
.... response time in such a multi server system, short and long jobs should be assigned to di erent queues [14, 15] Under highly variable workloads, system performance improves considerably if detailed information about the activity of each back end server is available to the front end dispatcher [13]. In general purpose computing systems, this ideal workload partition is hard to achieve because the length of a job is known only a posteriori. In web server systems, however, the size of the le corresponding to a given URL request is a good characterization of the length of the job, so ....
M. Harchol-Balter, N. Bansal, and B. Schroeder. Implementation of SRPT scheduling in web servers. Technical Report CMU-CS-00-170, Carnegie Mellon University, Oct. 2000. 23
Approximation Schemes for Preemptive Weighted Flow Time - Chekuri, Khanna (2001) (4 citations) (Correct)
....have. Weighted flow time is a natural and at the same time flexible (because of the arbitrary choice of weights) measure of performance for a system serving jobs. Special cases such as the total flow time and total stretch [11] have applications in databases, scheduling requests at web servers [6], operating systems [7] and so on. Despite substantial interest in this problem, progress on good upper bounds has been slow to come by. When no preemptions are allowed, it is hard to obtain a good approximation even for the unweighted case. Kellerer et al. 8] showed that single machine ....
M. Harchol-Balter, N. Bansal, and B. Schroeder. Implementation of SRPT Scheduling in Web Servers. Technical Report, Carnegie Mellon University, CMU-CS-00-170, 2000.
Size-based Adaptive Bandwidth Allocation: Optimizing the.. - Yang, de Veciana (2002) (10 citations) (Correct)
....greater than 40 , in the average user perceived BTD. These results are very encouraging, and suggest in our opinion that this line of research and possibly development warrants further exploration. We note that size based differentiation can be also realized at the application layer. In fact [20] have proposed and developed an implementation of SRPT on web servers. However, implementing differentiation at the transport level, enables one to address network bottlenecks and or interactions among various flows on the network resources rather than simply on the end systems. We are currently ....
M. Harchol-Balter et.al., "Implementation of SRPT scheduling in web servers," Proc. 7th Annual Workshop on Job Scheduling Strateties for Parallel Processing, pp. 11--35, 2001.
SRPT Scheduling for Web Servers - Harchol-Balter, Bansal, Schroeder.. Self-citation (Harchol-balter Bansal Schroeder Agrawal) (Correct)
No context found.
Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, and Mukesh Agrawal. Implementation of SRPT scheduling in web servers. Technical Report CMU-CS-00-170, 2000.
Analysis of SRPT Scheduling: Investigating Unfairness - Bansal, Harchol-Balter (2001) (43 citations) Self-citation (Harchol-balter Bansal) (Correct)
....sense on a performance level. In practice, it is not always so obvious how SRPT scheduling should be applied, given that most systems have multiple devices and multiprogramming is necessary to ensure that cycles aren t wasted. For an example of SRPT being applied successfully to Web servers see [6]. 2 Previous work Mean results: It has long been known that SRPT has the lowest mean response time of any scheduling policy, given any arrival sequence and job sizes [23, 27] Rajaraman et al. showed further that the mean slowdown under SRPT is at most twice the optimal mean slowdown for any ....
Mor Harchol-Balter, Nikhil Bansal, and Bianca Schroeder. Implementation of SRPT scheduling in web servers. Technical Report CMU-CS-00-170, Carnegie Mellon School of Computer Science, October 2000.
Analysis of SRPT Scheduling: Investigating Unfairness - Bansal, Harchol-Balter (2000) (43 citations) Self-citation (Harchol-balter Bansal) (Correct)
....sense on a performance level. In practice, it is not always so obvious how SRPT scheduling should be applied, given that most systems have multiple devices and multiprogramming is necessary to ensure that cycles aren t wasted. For an example of SRPT being applied successfully to Web servers see [6]. 3 2 Previous work Mean results: It has long been known that SRPT has the lowest mean response time of any scheduling policy, given any arrival sequence and job sizes [23, 27] Rajaraman et al. showed further that the mean slowdown under SRPT is at most twice the optimal mean slowdown for any ....
Mor Harchol-Balter, Nikhil Bansal, and Bianca Schroeder. Implementation of SRPT scheduling in web servers. Technical Report CMU-CS-00-170, Carnegie Mellon School of Computer Science, October 2000.
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