article

Size-based scheduling to improve web performance

Authors:

Mor Harchol-Balter,

Bianca Schroeder,

Mukesh AgrawalAuthors Info & Claims

ACM Transactions on Computer Systems (TOCS), Volume 21, Issue 2

Pages 207 - 233

https://doi.org/10.1145/762483.762486

Published: 01 May 2003 Publication History

Abstract

Is it possible to reduce the expected response time of every request at a web server, simply by changing the order in which we schedule the requests? That is the question we ask in this paper.This paper proposes a method for improving the performance of web servers servicing static HTTP requests. The idea is to give preference to requests for small files or requests with short remaining file size, in accordance with the SRPT (Shortest Remaining Processing Time) scheduling policy.The implementation is at the kernel level and involves controlling the order in which socket buffers are drained into the network. Experiments are executed both in a LAN and a WAN environment. We use the Linux operating system and the Apache and Flash web servers.Results indicate that SRPT-based scheduling of connections yields significant reductions in delay at the web server. These result in a substantial reduction in mean response time and mean slowdown for both the LAN and WAN environments. Significantly, and counter to intuition, the requests for large files are only negligibly penalized or not at all penalized as a result of SRPT-based scheduling.

References

[1]

Almeida, J., Dabu, M., Manikutty, A., and Cao, P. 1998. Providing differentiated quality-of-service in Web hosting services. In Proceedings of the First Workshop on Internet Server Performance.

[2]

Almesberger, W. 1999. Linux network traffic control---implementation overview. White paper available at http://diffserv.sourceforge.net/.

[3]

Almesberger, W., Salim, J. H., and Kuznetsov, A. 1999. Differentiated services on Linux. White paper available at http://lrcwww.epfl.ch/linux-diffserv/.

[4]

Apache. 2001. Apache web server. http://httpd.apache.org.

[5]

Arlitt, M., Friedrich, R., and Jin, T. 1999. Workload characterization of a web proxy in a cable modem environment. ACM Perform. Eval. Rev. 27, 2 (August), 25--36.

[6]

Banga, G. and Druschel, P. 1999. Measuring the capacity of a web server under realistic loads. World Wide Web 2, 1--2, 69--83.

[7]

Banga, G., Druschel, P., and Mogul, J. 1998. Better operating system features for faster network servers. ACM SIGMETRICS Performance Evaluation Review 26, 3, 23--30.

[8]

Bansal, N. and Harchol-Balter, M. 2001. Analysis of SRPT scheduling: Investigating unfairness. In Proceedings of ACM SIGMETRICS '01. 279--290.

[9]

Barford, P. and Crovella, M. E. 1998. Generating representative Web workloads for network and server performance evaluation. In Proceedings of SIGMETRICS '98. 151--160.

[10]

Bender, M., Chakrabarti, S., and Muthukrishnan, S. 1998. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms.

[11]

Bestavros, A., Carter, R. L., Crovella, M. E., Cunha, C. R., Heddaya, A., and Mirdad, S. A. 1995. Application-level document caching in the Internet. In Proceedings of the Second International Workshop on Services in Distributed and Networked Environments (SDNE'95).

[12]

Braun, H. and Claffy, K. 1994. Web traffic characterization: an assessment of the impact of caching documents from NCSA's Web server. In Proceedings of the Second International WWW Conference.

[13]

Cockcroft, A. 1996. Watching your web server. The Unix Insider at http://www.unixinsider.com.

[14]

Crovella, M. and Bestavros, A. 1997. Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Trans. Netw. 5, 6 (December), 835--846.

[15]

Crovella, M., Frangioso, R., and Harchol-Balter, M. 1999. Connection scheduling in web servers. In USENIX Symposium on Internet Technologies and Systems.

[16]

Crovella, M., Taqqu, M. S., and Bestavros, A. 1998. Heavy-tailed probability distributions in the World Wide Web. In A Practical Guide To Heavy Tails. Chapman & Hall, New York, 3--26.

[17]

Downey, A. B. 1997. A parallel workload model and its implications for processor allocation. In Proceedings of High Performance Distributed Computing. 112--123.

[18]

Druschel, P. and Banga, G. 1996. Lazy receiver processing (LRP): A network subsystem architecture for server systems. In Proceedings of OSDI '96. 261--275.

[19]

Feldmann, A.1999. Web performance characteristics. IETF plenary Nov. http://www.research. att.com/&sim;anja/feldmann/papers.html.

[20]

Gwertzman, J. and Seltzer, M. 1994. The case for geographical push-caching. In Proceedings of HotOS '94.

[21]

Harchol-Balter, M. and Downey, A. 1997. Exploiting process lifetime distributions for dynamic load balancing. ACM Trans. Comput. Syst. 15, 3, 253--285.

[22]

Harchol-Balter, M., Schroeder, B., Bansal, N., and Agrawal, M. 2000. Implementation of SRPT scheduling in web servers. Tech. Rep. CMU-CS-00-170.

[23]

ITA. 2002. The internet traffic archives. Available at http://town.hall.org/Archives/pub/ITA/.

[24]

Kaashoek, M., Engler, D., Wallach, D., and Ganger, G. 1996. Server operating systems. In SIGOPS European Workshop '96. 141--148.

[25]

Krishnamurthy, B. and Rexford, J. 2001. Web Protocols and Practice: HTTP/1.1, Networking Protocols, Caching, and Traffic Measurement. Addison-Wesley.

[26]

Little, J. 1961. A proof of the theorem L = λW. Operations Research 9, 383--387.

[27]

Maggs, B. 2001. Personal communication with Vice President of Research, Akamai Technologies, Bruce Maggs.

[28]

Manley, S. and Seltzer, M. 1997. Web facts and fantasy. In Proceedings of the 1997 USITS.

[29]

Microsoft. 2001. The arts and science of Web server tuning with internet information services 5.0. Microsoft TechNet---Insights and Answers for IT Professionals: At http://www.microsoft. com/technet/.

[30]

Mogul, J. C. 1995. Network behavior of a busy Web server and its clients. Tech. Rep. 95/5, Digital Western Research Laboratory. October.

[31]

NISTNet. 2002. National institute of standards and technology. http://snad.ncsl.nist.gov/itg/nistnet/.

[32]

Padmanabhan, V. N. and Mogul, J. 1995. Improving HTTP latency. Comput. Netw. ISDN Syst. 28, 25--35.

[33]

Pai, V. S., Druschel, P., and Zwaenepoel, W. 1999. Flash: An efficient and portable Web server. In Proceedings of USENIX 1999.

[34]

Radhakrishnan, S. 1999. Linux---advanced networking overview version 1. Available at http://qos.ittc.ukans.edu/howto/.

[35]

Rizzo, L. 1997. Dummynet: a simple approach to the evaluation of network protocols. ACM Comput. Commun. Rev. 27, 1.

[36]

Roberts, J. and Massoulie, L. 1998. Bandwidth sharing and admission control for elastic traffic. In ITC Specialist Seminar.

[37]

Schrage, L. E. and Miller, L. W. 1966. The queue M/G/1 with the shortest remaining processing time discipline. Operations Research 14, 670--684.

[38]

Silberschatz, A., Galvin, P., and Gagne, G. 2002. Operating System Concepts, Sixth Edition. John Wiley & Sons.

[39]

Stallings, W. 2001. Operating Systems, Fourth Edition. Prentice Hall.

Cited By

Yan JJia CYong Y(2024)An emergency task scheduling method based on YARN capacity schedulerProceedings of the International Conference on Algorithms, Software Engineering, and Network Security10.1145/3677182.3677288(591-596)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3677182.3677288
Yu GScully Z(2024)Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1Proceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36560118:2(1-33)Online publication date: 29-May-2024
https://dl.acm.org/doi/10.1145/3656011
Du YMarchal LPallez GRobert Y(2024)Improving batch schedulers with node stealing for failed jobsConcurrency and Computation: Practice and Experience10.1002/cpe.804336:12Online publication date: 16-Feb-2024
https://doi.org/10.1002/cpe.8043
Show More Cited By

Recommendations

Web servers under overload: How scheduling can help

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 ...
Improving peer-to-peer performance through server-side scheduling

We show how to significantly improve the mean response time seen by both uploaders and downloaders in peer-to-peer data-sharing systems. Our work is motivated by the observation that response times are largely determined by the performance of the peers ...
On scalable and locality-aware web document sharing
Scalable web services and architecture

We propose a scalable Web document sharing infrastructure model called Browsers-Aware Proxy Server. In this design, a proxy server connecting to a group of networked clients maintains an index file of data objects of all clients' browser caches. If a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems

ACM Transactions on Computer Systems Volume 21, Issue 2

May 2003

117 pages

ISSN:0734-2071

EISSN:1557-7333

DOI:10.1145/762483

Issue’s Table of Contents

Copyright © 2003 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2003

Published in TOCS Volume 21, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

283
Total Citations
View Citations
2,202
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)5

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yan JJia CYong Y(2024)An emergency task scheduling method based on YARN capacity schedulerProceedings of the International Conference on Algorithms, Software Engineering, and Network Security10.1145/3677182.3677288(591-596)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3677182.3677288
Yu GScully Z(2024)Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1Proceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36560118:2(1-33)Online publication date: 29-May-2024
https://dl.acm.org/doi/10.1145/3656011
Du YMarchal LPallez GRobert Y(2024)Improving batch schedulers with node stealing for failed jobsConcurrency and Computation: Practice and Experience10.1002/cpe.804336:12Online publication date: 16-Feb-2024
https://doi.org/10.1002/cpe.8043
Akbari-Moghaddam MDown D(2023)SEH: Size Estimate Hedging Scheduling of QueuesACM Transactions on Modeling and Computer Simulation10.1145/358049133:4(1-17)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1145/3580491
Coban OOzel SInan A(2023)Detection and Cross-domain Evaluation of Cyberbullying in Facebook Activity Contents for TurkishACM Transactions on Asian and Low-Resource Language Information Processing10.1145/358039322:4(1-32)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3580393
Bergstra JTucker J(2023)Eager Equality for Rational Number ArithmeticACM Transactions on Computational Logic10.1145/358036524:3(1-28)Online publication date: 17-Jan-2023
https://dl.acm.org/doi/10.1145/3580365
André ÉLiu SLiu YChoppy CSun JDong J(2023)Formalizing UML State Machines for Automated Verification – A SurveyACM Computing Surveys10.1145/357982155:13s(1-47)Online publication date: 13-Jul-2023
https://dl.acm.org/doi/10.1145/3579821
Adkins ANormoyle ALin LSun YYe YDi Luca MJörg S(2023)How Important are Detailed Hand Motions for Communication for a Virtual Character Through the Lens of Charades?ACM Transactions on Graphics10.1145/357857542:3(1-16)Online publication date: 31-May-2023
https://dl.acm.org/doi/10.1145/3578575
Chen HWang HYao QLi YJin DYang Q(2023)LoSAC: An Efficient Local Stochastic Average Control Method for Federated OptimizationACM Transactions on Knowledge Discovery from Data10.1145/356612817:4(1-28)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3566128
Fu XModiano E(2023)Optimal Routing to Parallel Servers With Unknown Utilities—Multi-Armed Bandit With QueuesIEEE/ACM Transactions on Networking10.1109/TNET.2022.322713631:5(1997-2012)Online publication date: Oct-2023
https://doi.org/10.1109/TNET.2022.3227136
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents