Web servers under overload: How scheduling can help

被引:51
作者
Schroeder, Bianca [1 ,2 ]
Harchol-Balter, Mor [1 ]
机构
[1] Computer Science Dept., Carnegie Mellon University, Pittsburgh, PA 15213-3891
基金
美国国家科学基金会;
关键词
Overload; Scheduling; SRPT; Starvation; Unfairness; Web server;
D O I
10.1145/1125274.1125276
中图分类号
学科分类号
摘要
This article provides a detailed implementation study on the behavior of web serves that serve static requests where the load fluctuates over time (transient overload). Various external factors are considered, including WAN delays and losses and different client behavior models. We find that performance can be dramatically improved via a kernel-level modification to the web server to change the scheduling policy at the server from the standard FAIR (processor-sharing) scheduling to SRPT (shortest-remaining-processing-time) scheduling. We find that SRPT scheduling induces no penalties. In particular, throughput is not sacrificed and requests for long files experience only negligibly higher response times under SRPT than they did under the original FAIR scheduling. © 2006 ACM.
引用
收藏
页码:20 / 52
页数:32
相关论文
共 64 条
[1]  
Abdelzaher T.F., Bhatti N.T., Web content adaptation to improve server overload behavior, WWW8/Comput. Networks, 31, 11-16, pp. 1563-1577, (1999)
[2]  
Almesberger W., Linux Network Traffic Control - Implementation Overview
[3]  
Andresen D., Yang T., Multiprocessor scheduling with client resources to improve the response time of WWW applications, The International Conference on Supercomputing, pp. 92-99, (1997)
[4]  
Arlitt M., Jin T., Workload characterization of the 1998 world cup Web site, IEEE Network, 14, 3, pp. 30-37, (2000)
[5]  
Aron M., Druschel P., TCP implementation enhancements for improving webserver performance, Tech. Rep., TR99-335, (1999)
[6]  
Banga G., Druschel P., Measuring the capacity of a web server under realistic loads, World Wide Web, 2, 1-2, pp. 69-83, (1999)
[7]  
Banga G., Druschel P., Mogul J.C., Resource containers: A new facility for resource management in server systems, Proceedings of OSDI '99., pp. 45-58, (1999)
[8]  
Bansal N., Harchol-Balter M., Analysis of SRPT scheduling: Investigating unfairness, Proceedings of ACM SIGMETRICS '01, (2001)
[9]  
Bansal N., Harchol-Balter M., Scheduling solutions for coping with transient overload, Tech. Rep., CMU-CS-01-134, (2001)
[10]  
Barford P., Crovella M.E., Generating representative Web workloads for network and server performance evaluation, Proceedings of SIGMETRICS '98, JULY, pp. 151-160, (1998)