Abstract
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 request at a web server, simply by changing the order in which we schedule the requests? In [4] we approach this question analytically via an M/G/1 queue. In [23] we approach the same question via implementation involving an Apache web server running on Linux.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Almeida, M. Dabu, A. Manikutty, and P. Cao. Providing di.erentiated quality of-service inWeb hosting services. In Proceedings of the First Workshop on Internet Server Performance, June 1998.
Bruce Maggs at Akamai. Personal communication., 2001.
G. Banga, P. Druschel, and J. Mogul. Better operating system features for faster network servers. In Proc. Workshop on Internet Server Performance, June 1998.
Nikhil Bansal and Mor Harchol-Balter. Analysis of SRPT scheduling: Investigating unfairness. In Proceeding of ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems (SIGMETRICS’ 01), June 2001.
Paul Barford and M. E. Crovella. Measuring web performance in the wide area. Performance Evaluation Review - Special Issue on Network Trafic Measurement and Workload Characterization, August 1999.
Paul Barford and Mark Crovella. Critical path analysis of tcp transactions. In SIGCOMM, 2000.
Paul Barford and Mark E. Crovella. Generating representative Web workloads for network and server performance evaluation. In Proceedings of SIGMETRICS’ 98, pages 151–160, July 1998.
M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.
Michael Bender, Soumen Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.
Azer Bestavros, Robert L. Carter, Mark E. Crovella, Carlos R. Cunha, Abdelsalam Heddaya, and Sulaiman A. Mirdad. Application-level document caching in the internet. In Proceedings of the Second International Workshop on Services in Distributed and Networked Environments (SDNE’95), June 1995.
H. Braun and K. Claffy. Web trafic characterization: an assessment of the impact of caching documents from NCSA’s Web server. In Proceedings of the Second International WWW Conference, 1994.
Adrian Cockcroft. Watching your web server. The Unix Insider at http://www.unixinsider.com, April 1996.
Mark E. Crovella and Azer Bestavros. Self-similarity in World Wide Web trafic: Evidence and possible causes. In Proceedings of the 1996 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 160–169, May 1996.
Mark E. Crovella and Azer Bestavros. Self-similarity in World Wide Web trafic: Evidence and possible causes. IEEE/ACM Transactions on Networking, 5(6):835–846, December 1997.
Mark E. Crovella, Robert Frangioso, and Mor Harchol-Balter. Connection scheduling in web servers. In USENIX Symposium on Internet Technologies and Systems, October 1999.
Mark E. Crovella, Murad S. Taqqu, and Azer Bestavros. Heavy-tailed probability distributions in the World Wide Web. In A Practical Guide To Heavy Tails, pages 3–26. Chapman & Hall, New York, 1998.
Peter Druschel and Gaurav Banga. Lazy receiver processing (LRP): A network subsystem architecture for server systems. In Proceedings of OSDI’ 96, October 1996
Fielding, Gettys, Mogul, Frystyk, and Berners-lee. DNS support for load balancing. RFC 2068, April 1997.
J.E. Gehrke, S. Muthukrishnan, R. Rajaraman, and A. Shaheen. Scheduling to minimize average stretch online. In 40th Annual symposium on Foundation of Computer Science, pages 433–422, 1999.
James Gwertzman and Margo Seltzer. The case for geographical push-caching. In Proceedings of HotOS’ 94, May 1994.
Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, and Mukesh Agrawal. Implementation of SRPT scheduling in web servers. Technical Report CMU-CS-00-170, 2000.
Mor Harchol-Balter and Allen Downey. Exploiting process lifetime distributions for dynamic load balancing. In Proceedings of SIGMETRICS’ 96, pages 13–24, 1996.
Gordon Irlam. Unix file size survey-1993. Available at http://www.base.com-/gordoni/ufs93.html, September 1994.
M. Kaashoek, D. Engler, D. Wallach, and G. Ganger. Server operating systems. In SIGOPS European Workshop, September 1996.
L. Kleinrock, R.R. Muntz, and J. Hsu. Tight bounds on average response time for time-shared computer systems. In Proceedings of the IFIP Congress, volume 1, pages 124–133, 1971.
Leonard Kleinrock. Queueing Systems, volume II. Computer Applications. John Wiley & Sons, 1976.
W. E. Leland and T. J. Ott. Load-balancing heuristics and process behavior. In Proceedings of Performance and ACM Sigmetrics, pages 54–69, 1986.
S. Manley and M. Seltzer. Web facts and fantasy. In Proceedings of the 1997 USITS, 1997.
Evangelos Markatos. Main memory caching of Web documents. In Proceedings of the Fifth Interntional Conference on the WWW, 1996.
J. Mogul. Operating systems support for busy internet servers. Technical Report WRL-Technical-Note-49, Compaq Western Research Lab, May 1995.
V. N. Padmanabhan and J. Mogul. Improving HTTP latency. Computer Networks and ISDN Systems, 28:25–35, December 1995.
Vivek S. Pai, Peter Druschel, and W. Zwaenepoel. Flash: An effcient and portable web server. In Proceedings of USENIX 1999, June 1999.
A.V. Pechinkin, A.D. Solovyev, and S.F. Yashkov. A system with servicing discipline whereby the order of remaining length is serviced first. Tekhnicheskaya Kibernetika, 17:51–59, 1979.
R. Perera. The variance of delay time in queueing system M/G/1 with optimal strategy SRPT. Archiv fur Elektronik und Uebertragungstechnik, 47:110–114, 1993.
David L. Peterson and David B. Adams. Fractal patterns in DASD I/O trafic. In CMG Proceedings, December 1996.
J. Roberts and L. Massoulie. Bandwidth sharing and admission control for elastic trafic. In ITC Specialist Seminar, 1998.
R. Schassberger. The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time. Advances in Applied Probability, 22:456–479, 1990.
L.E. Schrage. A proof of the optimality of the shortest processing remaining time discipline. Operations Research, 16:678–690, 1968.
L.E. Schrage and L.W. Miller. The queue M/G/1 with the shortest processing remaining time discipline. Operations Research, 14:670–684, 1966.
F. Schreiber. Properties and applications of the optimal queueing strategy SRPT-a survey. Archiv fur Elektronik und Uebertragungstechnik, 47:372–378, 1993.
Bianca Schroeder and Mor Harchol-Balter. Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness. In 9th IEEE Symposium on High Performance Distributed Computing (HPDC’ 00), August 2000.
A. Silberschatz and P. Galvin. Operating System Concepts, 5th Edition. John Wiley & Sons, 1998.
D.R. Smith. A new proof of the optimality of the shortest remaining processing time discipline. Operations Research, 26:197–199, 1976.
W. Stallings. Operating Systems, 2nd Edition. Prentice Hall, 1995.
A.S. Tanenbaum. Modern Operating Systems. Prentice Hall, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harchol-Balter, M., Bansal, N., Schroeder, B., Agrawal, M. (2001). SRPT Scheduling for Web Servers. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2001. Lecture Notes in Computer Science, vol 2221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45540-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-45540-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42817-6
Online ISBN: 978-3-540-45540-0
eBook Packages: Springer Book Archive