{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:37:44Z","timestamp":1759073864201,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428176"},{"type":"electronic","value":"9783540455400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45540-x_2","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:37:01Z","timestamp":1180672621000},"page":"11-20","source":"Crossref","is-referenced-by-count":22,"title":["SRPT Scheduling for Web Servers"],"prefix":"10.1007","author":[{"given":"Mor","family":"Harchol-Balter","sequence":"first","affiliation":[]},{"given":"Nikhil","family":"Bansal","sequence":"additional","affiliation":[]},{"given":"Bianca","family":"Schroeder","sequence":"additional","affiliation":[]},{"given":"Mukesh","family":"Agrawal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"2_CR1","unstructured":"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."},{"key":"2_CR2","unstructured":"Bruce Maggs at Akamai. Personal communication., 2001."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"G. Banga, P. Druschel, and J. Mogul. Better operating system features for faster network servers. In Proc. Workshop on Internet Server Performance, June 1998.","DOI":"10.1145\/306225.306234"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"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\u2019 01), June 2001.","DOI":"10.1145\/378420.378792"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/332944.332953"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Paul Barford and Mark Crovella. Critical path analysis of tcp transactions. In SIGCOMM, 2000.","DOI":"10.1145\/347059.347416"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Paul Barford and Mark E. Crovella. Generating representative Web workloads for network and server performance evaluation. In Proceedings of SIGMETRICS\u2019 98, pages 151\u2013160, July 1998.","DOI":"10.1145\/277858.277897"},{"key":"2_CR8","unstructured":"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."},{"key":"2_CR9","unstructured":"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."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"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\u201995), June 1995.","DOI":"10.1109\/SDNE.1995.470449"},{"key":"2_CR11","unstructured":"H. Braun and K. Claffy. Web trafic characterization: an assessment of the impact of caching documents from NCSA\u2019s Web server. In Proceedings of the Second International WWW Conference, 1994."},{"key":"2_CR12","unstructured":"Adrian Cockcroft. Watching your web server. The Unix Insider at http:\/\/www.unixinsider.com , April 1996."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013169, May 1996.","DOI":"10.1145\/233008.233038"},{"issue":"6","key":"2_CR14","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/90.650143","volume":"5","author":"M. E. Crovella","year":"1997","unstructured":"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\u2013846, December 1997.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2_CR15","unstructured":"Mark E. Crovella, Robert Frangioso, and Mor Harchol-Balter. Connection scheduling in web servers. In USENIX Symposium on Internet Technologies and Systems, October 1999."},{"key":"2_CR16","first-page":"3","volume-title":"A Practical Guide To Heavy Tails","author":"M. E. Crovella","year":"1998","unstructured":"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\u201326. Chapman & Hall, New York, 1998."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Peter Druschel and Gaurav Banga. Lazy receiver processing (LRP): A network subsystem architecture for server systems. In Proceedings of OSDI\u2019 96, October 1996","DOI":"10.1145\/238721.238786"},{"key":"2_CR18","unstructured":"Fielding, Gettys, Mogul, Frystyk, and Berners-lee. DNS support for load balancing. RFC 2068, April 1997."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013422, 1999.","DOI":"10.1109\/SFFCS.1999.814615"},{"key":"2_CR20","unstructured":"James Gwertzman and Margo Seltzer. The case for geographical push-caching. In Proceedings of HotOS\u2019 94, May 1994."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder, and Mukesh Agrawal. Implementation of SRPT scheduling in web servers. Technical Report CMU-CS-00-170, 2000.","DOI":"10.1007\/3-540-45540-X_2"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Mor Harchol-Balter and Allen Downey. Exploiting process lifetime distributions for dynamic load balancing. In Proceedings of SIGMETRICS\u2019 96, pages 13\u201324, 1996.","DOI":"10.1145\/233008.233019"},{"key":"2_CR23","unstructured":"Gordon Irlam. Unix file size survey-1993. Available at http:\/\/www.base.com-\/gordoni\/ufs93.html , September 1994."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"M. Kaashoek, D. Engler, D. Wallach, and G. Ganger. Server operating systems. In SIGOPS European Workshop, September 1996.","DOI":"10.1145\/504450.504478"},{"key":"2_CR25","first-page":"124","volume":"1","author":"L. Kleinrock","year":"1971","unstructured":"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\u2013133, 1971.","journal-title":"Proceedings of the IFIP Congress"},{"key":"2_CR26","unstructured":"Leonard Kleinrock. Queueing Systems, volume II. Computer Applications. John Wiley & Sons, 1976."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"W. E. Leland and T. J. Ott. Load-balancing heuristics and process behavior. In Proceedings of Performance and ACM Sigmetrics, pages 54\u201369, 1986.","DOI":"10.1145\/317499.317539"},{"key":"2_CR28","unstructured":"S. Manley and M. Seltzer. Web facts and fantasy. In Proceedings of the 1997 USITS, 1997."},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Evangelos Markatos. Main memory caching of Web documents. In Proceedings of the Fifth Interntional Conference on the WWW, 1996.","DOI":"10.1016\/0169-7552(96)00035-9"},{"key":"2_CR30","unstructured":"J. Mogul. Operating systems support for busy internet servers. Technical Report WRL-Technical-Note-49, Compaq Western Research Lab, May 1995."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0169-7552(95)00106-1","volume":"28","author":"V. N. Padmanabhan","year":"1995","unstructured":"V. N. Padmanabhan and J. Mogul. Improving HTTP latency. Computer Networks and ISDN Systems, 28:25\u201335, December 1995.","journal-title":"Computer Networks and ISDN Systems"},{"key":"2_CR32","unstructured":"Vivek S. Pai, Peter Druschel, and W. Zwaenepoel. Flash: An effcient and portable web server. In Proceedings of USENIX 1999, June 1999."},{"key":"2_CR33","first-page":"51","volume":"17","author":"A.V. Pechinkin","year":"1979","unstructured":"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\u201359, 1979.","journal-title":"Tekhnicheskaya Kibernetika"},{"key":"2_CR34","first-page":"110","volume":"47","author":"R. Perera","year":"1993","unstructured":"R. Perera. The variance of delay time in queueing system M\/G\/1 with optimal strategy SRPT. Archiv fur Elektronik und Uebertragungstechnik, 47:110\u2013114, 1993.","journal-title":"Archiv fur Elektronik und Uebertragungstechnik"},{"key":"2_CR35","unstructured":"David L. Peterson and David B. Adams. Fractal patterns in DASD I\/O trafic. In CMG Proceedings, December 1996."},{"key":"2_CR36","unstructured":"J. Roberts and L. Massoulie. Bandwidth sharing and admission control for elastic trafic. In ITC Specialist Seminar, 1998."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"456","DOI":"10.2307\/1427545","volume":"22","author":"R. Schassberger","year":"1990","unstructured":"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\u2013479, 1990.","journal-title":"Advances in Applied Probability"},{"key":"2_CR38","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"L.E. Schrage","year":"1968","unstructured":"L.E. Schrage. A proof of the optimality of the shortest processing remaining time discipline. Operations Research, 16:678\u2013690, 1968.","journal-title":"Operations Research"},{"key":"2_CR39","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.14.4.670","volume":"14","author":"L.E. Schrage","year":"1966","unstructured":"L.E. Schrage and L.W. Miller. The queue M\/G\/1 with the shortest processing remaining time discipline. Operations Research, 14:670\u2013684, 1966.","journal-title":"Operations Research"},{"key":"2_CR40","first-page":"372","volume":"47","author":"F. Schreiber","year":"1993","unstructured":"F. Schreiber. Properties and applications of the optimal queueing strategy SRPT-a survey. Archiv fur Elektronik und Uebertragungstechnik, 47:372\u2013378, 1993.","journal-title":"Archiv fur Elektronik und Uebertragungstechnik"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"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\u2019 00), August 2000.","DOI":"10.21236\/ADA377091"},{"key":"2_CR42","unstructured":"A. Silberschatz and P. Galvin. Operating System Concepts, 5th Edition. John Wiley & Sons, 1998."},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/opre.26.1.197","volume":"26","author":"D.R. Smith","year":"1976","unstructured":"D.R. Smith. A new proof of the optimality of the shortest remaining processing time discipline. Operations Research, 26:197\u2013199, 1976.","journal-title":"Operations Research"},{"key":"2_CR44","unstructured":"W. Stallings. Operating Systems, 2nd Edition. Prentice Hall, 1995."},{"key":"2_CR45","unstructured":"A.S. Tanenbaum. Modern Operating Systems. Prentice Hall, 1992."}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45540-X_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:04:01Z","timestamp":1737061441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45540-X_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428176","9783540455400"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/3-540-45540-x_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}