{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:09Z","timestamp":1725567069459},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_64","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"632-643","source":"Crossref","is-referenced-by-count":1,"title":["Server Allocation Algorithms for Tiered Systems"],"prefix":"10.1007","author":[{"given":"Kamalika","family":"Chaudhuri","sequence":"first","affiliation":[]},{"given":"Anshul","family":"Kothari","sequence":"additional","affiliation":[]},{"given":"Rudi","family":"Pendavingh","sequence":"additional","affiliation":[]},{"given":"Ram","family":"Swaminathan","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Tarjan","sequence":"additional","affiliation":[]},{"given":"Yunhong","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"64_CR1","unstructured":"Appleby, K., Fakhouri, S., Fong, L., Goldszmidt, G., Kalantar, M.: Oc\u00e9ano \u2013 SLAbased management of a computing utility. In: Proc. 7th IFIP\/IEEE Intl. Symp. on Integrated Network Management (May 2001)"},{"key":"64_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems\u00a030, 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(76)90048-7","volume":"3","author":"A. Chandra","year":"1976","unstructured":"Chandra, A., Hirschberg, D., Wong, C.: Approximate algorithms for some generalized knapsack problems. Theoretical Computer Science\u00a03, 293\u2013304 (1976)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"64_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"G.N. Frederickson","year":"1982","unstructured":"Frederickson, G.N., Johnson, D.B.: The complexity of selection and ranking in x+y and matrices with sorted columns. Journal of Computer and System Sciences\u00a024(2), 197\u2013208 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Garg, P.K., Hao, M., Santos, C., Tang, H.-K., Zhang, A.: Web transaction analysis and optimization (TAO). In: Proceedings of the 3rd Workshop on Software and Performance, pp. 286\u2013293 (2002)","DOI":"10.1145\/584369.584413"},{"key":"64_CR6","first-page":"31","volume":"6","author":"G. Gens","year":"1978","unstructured":"Gens, G., Levner, E.: Approximation algorithms for certain universal problems in scheduling theory. Soviet J. of Computers & System Sciences\u00a06, 31\u201336 (1978)","journal-title":"Soviet J. of Computers & System Sciences"},{"key":"64_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u0151tschel","year":"1988","unstructured":"Gr\u0151tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"},{"key":"64_CR8","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S.: A nonlinear knapsack problem. Operations Research Letters\u00a0(17), 103\u2013110 (1995)","DOI":"10.1016\/0167-6377(95)00009-9"},{"key":"64_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"key":"64_CR10","series-title":"Computer Applications","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1976","unstructured":"Kleinrock, L.: Queueing Systems. Computer Applications, vol.\u00a0II. Wiley, Chichester (1976)"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer linear programming with a fixed number of variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"64_CR12","unstructured":"Menasce, D.A., Almeida, V.A.: Capacity Planning for Web Performance"},{"key":"64_CR13","unstructured":"Zhang, A., et al.: Optimal server resource allocation using an open queueing network model of response time. Technical Report HPL-2002-301, HP Labs (2002)"},{"key":"64_CR14","unstructured":"Zhu, X., Singhal, S.: Optimal resource assignment in internet data centers. In: Proc. 9th MASCOTS, Cincinnati, OH, August 15-18, 2001, pp. 61\u201369 (2001)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:58:01Z","timestamp":1553155081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11533719_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}