{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T07:28:31Z","timestamp":1750750111815,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698135"},{"type":"electronic","value":"9783540698142"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69814-2_1","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:39:36Z","timestamp":1217486376000},"page":"1-3","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling for Server Farms: Approaches and Open Problems"],"prefix":"10.1007","author":[{"given":"Mor","family":"Harchol-Balter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M., Downey, A.: Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems 15(3) (1997)","DOI":"10.1145\/263326.263344"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barford, P., Crovella, M.E.: Generating representative Web workloads for network and server performance evaluation. In: ACM SIGMETRICS Conference, pp. 151\u2013160 (July 1998)","DOI":"10.1145\/277858.277897"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Shaikh, A., Rexford, J., Shin, K.G.: Load-sensitive routing of long-lived ip flows. In: Proceedings of SIGCOMM (September 1999)","DOI":"10.1145\/316188.316225"},{"issue":"2","key":"1_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/B:CLUS.0000018564.05723.a2","volume":"7","author":"B. Schroeder","year":"2004","unstructured":"Schroeder, B., Harchol-Balter, M.: Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness. Cluster Computing: The journal of Networks, Software Tools, and Applications\u00a07(2), 151\u2013161 (2004)","journal-title":"Cluster Computing: The journal of Networks, Software Tools, and Applications"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/762483.762486","volume":"21","author":"M. Harchol-Balter","year":"2003","unstructured":"Harchol-Balter, M., Schroeder, B., Bansal, N., Agrawal, M.: Size-based Scheduling to Improve Web Performance. Transactions of Computer Systems\u00a021(2), 207\u2013233 (2003)","journal-title":"Transactions of Computer Systems"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Wierman, A., Harchol-Balter, M.: Classifying Scheduling Policies with respect to Unfairness in an M\/GI\/1. In: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pp. 238\u2013249 (June 2003)","DOI":"10.1145\/885651.781057"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Brown, P.: Comparing FB and PS Scheduling Policies. In: Eighth Workkshop on Mathematical Performance Modeling and Analysis (MAMA 2006) (June 2006)","DOI":"10.1145\/1215956.1215965"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Schroeder, B., Harchol-Balter, M.: Web servers under overload: How scheduling can help. ACMTOIT 6(1) (February 2006)","DOI":"10.1145\/1125274.1125276"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Yang, C.W., Wierman, A., Shakkottai, S., Harchol-Balter, M.: Tail asymptotics for policies favoring short jobs in a many-flows regime. In: ACM Sigmetrics 2006 Conference on Measurement and Modeling of Computer Systems (2006)","DOI":"10.1145\/1140277.1140290"},{"key":"1_CR10","unstructured":"Schroeder, B., Wierman, A., Harchol-Balter, M.: Closed versus Open System Models: a Cautionary Tale. In: Proceedings of Networked Systems Design and Implementation (NSDI 2006), pp. 239\u2013252 (May 2006)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jpdc.1999.1577","volume":"59","author":"M. Harchol-Balter","year":"1999","unstructured":"Harchol-Balter, M., Crovella, M., Murta, C.: On Choosing a Task Assignment Policy for a Distributed Server System. IEEE Journal of Parallel and Distributed Computing\u00a059, 204\u2013228 (1999)","journal-title":"IEEE Journal of Parallel and Distributed Computing"},{"key":"1_CR12","unstructured":"Harchol-Balter, M., Vesilo, R.: To Balance or Unbalance Load in Size-Interval Task Allocation (in submission, 2008)"},{"issue":"4","key":"1_CR13","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.peva.2004.09.003","volume":"61","author":"T. Osogami","year":"2005","unstructured":"Osogami, T., Harchol-Balter, M., Scheller-Wolf, A.: Analysis of cycle stealing with switching times and thresholds. Performance Evaluation\u00a061(4), 369\u2013374 (2005)","journal-title":"Performance Evaluation"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00535168","volume":"47","author":"G. Fayole","year":"1979","unstructured":"Fayole, G., Iasnogorodski, R.: Two coupled processors: the reduction to a reimann-hilbert problem. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete\u00a047, 325\u2013351 (1979)","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"key":"1_CR15","unstructured":"Foley, R., McDonald, D.: Exact asymptotics of a queueing network with a cross-trained server. In: Proceedings of INFORMS Annual Meeting (2003)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1021852431091","volume":"43","author":"S. Borst","year":"2003","unstructured":"Borst, S., Boxma, O., van Uitert, M.: The asymptotic workload behavior of two coupled queues. Queueing Systems: Theory and Applications\u00a043, 81\u2013102 (2003)","journal-title":"Queueing Systems: Theory and Applications"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/506147.506154","volume":"49","author":"M. Harchol-Balter","year":"2002","unstructured":"Harchol-Balter, M.: Task Assignment with Unknown Duration. Journal of the ACM\u00a049(2), 260\u2013288 (2002)","journal-title":"Journal of the ACM"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Nelson, R.D., Philips, T.K.: An Approximation to the Response Time for Shortest Queue Routing. In: ACM SIGMETRICS Conference, pp. 181\u2013189 (May 1989)","DOI":"10.1145\/75372.75392"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0166-5316(93)90004-E","volume":"17","author":"R.D. Nelson","year":"1993","unstructured":"Nelson, R.D., Philips, T.K.: An Approximation for the Mean Response Time for Shortest Queue Routing with General Interarrival and Service Times. Performance Evaluation\u00a017, 123\u2013139 (1993)","journal-title":"Performance Evaluation"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02412240","volume":"8","author":"J. Wessels","year":"1991","unstructured":"Wessels, J., Adan, I., Zijm, W.: Analysis of the asymmetric shortest queue problem. Queueing Systems: Theory and Applications\u00a08, 1\u201358 (1991)","journal-title":"Queueing Systems: Theory and Applications"},{"key":"1_CR21","unstructured":"Gupta, V., Harchol-Balter, M., Sigman, K., Whitt, W.: Analysis of join-the-shortest-queue routing for web server farms. In: PERFORMANCE 2007 Conference. IFIP WG 7.3 International Symposium on Computer Modeling, Measurement and Evaluation, Cologne, Germany (October 2007)"},{"issue":"3-4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s11134-005-2898-7","volume":"51","author":"M. Harchol-Balter","year":"2005","unstructured":"Harchol-Balter, M., Osogami, T., Scheller-Wolf, A., Wierman, A.: Multi-server queueing systems with multiple priority classes. Queueing Systems: Theory and Applications\u00a051(3-4), 331\u2013360 (2005)","journal-title":"Queueing Systems: Theory and Applications"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: ACM Symposium on Theory of Computing, pp. 110\u2013119 (1997)","DOI":"10.1145\/258533.258562"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), pp. 11\u201318 (2003)","DOI":"10.1145\/777412.777415"}],"container-title":["Lecture Notes in Computer Science","Performance Evaluation: Metrics, Models and Benchmarks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69814-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:06:58Z","timestamp":1715058418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69814-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540698135","9783540698142"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69814-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}