{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:33:34Z","timestamp":1743147214391,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662437780"},{"type":"electronic","value":"9783662437797"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43779-7_7","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T22:40:31Z","timestamp":1402440031000},"page":"116-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Heuristics for Resource Matching in Intel\u2019s Compute Farm"],"prefix":"10.1007","author":[{"given":"Ohad","family":"Shai","sequence":"first","affiliation":[]},{"given":"Edi","family":"Shmueli","sequence":"additional","affiliation":[]},{"given":"Dror G.","family":"Feitelson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"key":"7_CR1","unstructured":"The parallel workloads archive (2013). http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload"},{"issue":"7","key":"7_CR2","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/71.877834","volume":"11","author":"Y Amir","year":"2000","unstructured":"Amir, Y., Awerbuch, B., Barak, A., Borgstrom, R.S., Keren, A.: An opportunity cost approach for job assignment in a scalable computing cluster. IEEE Trans. Parallel Distrib. Syst. 11(7), 760\u2013768 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bentley, B.: Validating the Intel\u00ae Pentium\u00ae 4 microprocessor. In: Proceedings of the 38th Design Automation Conference, pp. 244\u2013248, June 2001","DOI":"10.1145\/378239.378473"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Deng, K., Verboon, R., Ren, K., Iosup, A.: A periodic portfolio scheduler for scientic computing in the data center. In: 17th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP 2013), Boston, USA, May 2013","DOI":"10.1007\/978-3-662-43779-7_9"},{"key":"7_CR5","volume-title":"Business Innovation and Disruptive Technology: Harnessing the Power of Breakthrough Technology for Competitive Advantage","author":"ND Evans","year":"2003","unstructured":"Evans, N.D.: Business Innovation and Disruptive Technology: Harnessing the Power of Breakthrough Technology for Competitive Advantage. Financial Times Prentice Hall, Upper Saddle River (2003)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Eyerman, S., Eeckhout, L.: Probabilistic job symbiosis modeling for SMT processor scheduling. In: 15th Intel Conference Architecture Support for Programming Language & Operating Systems, pp. 91\u2013102, March 2010","DOI":"10.1145\/1735970.1736033"},{"key":"7_CR7","unstructured":"Lee, S., Panigrahy, R., Prabhakaran, V., Ramasubramanian, V., Talwar, K., Uyeda, L., Wieder, U.: Validating heuristics for virtual machines consolidation. Technical report MSR-TR-2011-9, Microsoft Research, January 2011"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Mishra, M., Sahoo, A.: On theory of VM placement: anomalies in existing methodologies and their mitigation using a novel vector based approach. In: IEEE Intel Conference Cloud, Computing, pp. 275\u2013282 (2011)","DOI":"10.1109\/CLOUD.2011.38"},{"key":"7_CR9","unstructured":"Panigrahy, R., Talwar, K., Uyeda, L., Wieder, U.: Heuristics for vector bin packing. Technical report, Microsoft Research (2011)"},{"key":"7_CR10","unstructured":"Shai, O.: Batch simulator (simba). Open source project hosted (2012). http:\/\/code.google.com\/p\/batch-simulator"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1016\/j.jpdc.2005.05.003","volume":"65","author":"E Shmueli","year":"2005","unstructured":"Shmueli, E., Feitelson, D.G.: Backfilling with lookahead to optimize the packing of parallel jobs. J. Parallel Distrib. Comput. 65, 1090\u20131107 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Singh, A., Korupolu, M., Mohapatra, D., Server-storage virtualization: integration and load balancing in data centers. In: SC 2008: High Performance Computing, Networking, Storage and Analysis, pp. 1\u201312 (2008)","DOI":"10.1109\/SC.2008.5222625"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Snavely, A., Tullsen, D.M.: Symbiotic jobscheduling for a simultaneous multithreading processor. In: 9th Intel Conference Architecture Support for Programming Language & Operating Systems, pp. 234\u2013244, November 2000","DOI":"10.1145\/384264.379244"},{"key":"7_CR14","unstructured":"Talby, D., Feitelson, D.G.: Improving and stabilizing parallel computer performance using adaptive backfilling. In: 19th Intel Parallel & Distributed Processing Symposium, April 2005"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-71035-6_10","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J Weinberg","year":"2007","unstructured":"Weinberg, J., Snavely, A.: Symbiotic space-sharing on SDSC\u2019s dataStar system. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2006. LNCS, vol. 4376, pp. 192\u2013209. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/71.993204","volume":"13","author":"L Xiao","year":"2002","unstructured":"Xiao, L., Chen, S., Zhang, X.: Dynamic cluster resource allocations for jobs with known and unknown memory demands. IEEE Trans. Parallel Distrib. Syst. 13(3), 223\u2013240 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Phan, L.T.X., Tan, G., Jain, S., Duong, H., Loo, B.T., Lee, I.: On the feasibility of dynamic rescheduling on the intel distributed computing platform. In: Proceedings 11th Intel Middleware Conference Industrial track, pp. 4\u201310. ACM, New York (2010)","DOI":"10.1145\/1891719.1891720"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43779-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T15:20:19Z","timestamp":1674832819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43779-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662437780","9783662437797"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43779-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"11 June 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}