{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:07:24Z","timestamp":1742965644782,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_5","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T22:40:31Z","timestamp":1402440031000},"page":"81-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Multi Resource Fairness: Problems and Challenges"],"prefix":"10.1007","author":[{"given":"Dalibor","family":"Klus\u00e1\u010dek","sequence":"first","affiliation":[]},{"given":"Hana","family":"Rudov\u00e1","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Jaro\u0161","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"key":"5_CR1","unstructured":"Adaptive Computing Enterprises, Inc. Maui Scheduler Administrator\u2019s Guide, version 3.2, February 2013. http:\/\/docs.adaptivecomputing.com"},{"key":"5_CR2","unstructured":"Adaptive Computing Enterprises, Inc. Moab workload manager administrator\u2019s guide, version 7.2.1, February 2013. http:\/\/docs.adaptivecomputing.com"},{"key":"5_CR3","unstructured":"Adaptive Computing Enterprises, Inc. TORQUE Admininstrator Guide, version 4.2.0, February 2013. http:\/\/docs.adaptivecomputing.com"},{"key":"5_CR4","unstructured":"Apache.org. Hadoop Capacity Scheduler, February 2013. http:\/\/hadoop.apache.org\/docs\/r1.1.1\/capacity_scheduler.html"},{"key":"5_CR5","unstructured":"Apache.org. Hadoop Fair Scheduler, February 2013. http:\/\/hadoop.apache.org\/docs\/r1.1.1\/fair_scheduler.html"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0167-8191(98)00104-5","volume":"25","author":"J Blazewicz","year":"1999","unstructured":"Blazewicz, J., Drozdowski, M., Markiewicz, M.: Divisible task scheduling - concept and verification. Parallel Comput. 25(1), 87\u201398 (1999)","journal-title":"Parallel Comput."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feitelson, D.G., Halpern, J.Y., Kupferman, R., Linial, N.: No justified complaints: on fair sharing of multiple resources. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS \u201912, pp. 68\u201375. ACM, New York (2012)","DOI":"10.1145\/2090236.2090243"},{"key":"5_CR8","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: fair allocation of multiple resource types. In: 8th USENIX Symposium on Networked Systems Design and Implementation (2011)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., Goldberg, A.: Quincy: fair scheduling for distributed computing clusters. In: SOSP\u201909 (2009)","DOI":"10.1145\/1629575.1629601"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-45540-X_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DB Jackson","year":"2001","unstructured":"Jackson, D.B., Snell, Q.O., Clement, M.J.: Core algorithms of the Maui scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 87\u2013102. Springer, Heidelberg (2001)"},{"key":"5_CR11","unstructured":"Jain, R., Chiu, D.-M., Hawe, W.: A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Technical report TR-301, Digital Equipment Corporation (1984)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Joe-Wong, C., Sen, S., Lan, T., Chiang, M.: Multi-resource allocation: fairness-efficiency tradeoffs in a unifying framework. In: INFOCOM (2012)","DOI":"10.1109\/INFCOM.2012.6195481"},{"key":"5_CR13","unstructured":"Jones, J.P.: PBS Professional 7, administrator guide. Altair, April 2005"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Kleban, S.D., Clearwater, S.H.: Fair share on high performance computing systems: what does fair really mean? In: Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid\u201903), pp. 146\u2013153. IEEE Computer Society (2003)","DOI":"10.1109\/CCGRID.2003.1199363"},{"key":"5_CR15","unstructured":"Klus\u00e1\u010dek, D., Ruda, M., Rudov\u00e1, H.: New fairness and performance metrics for current grids. In: Cracow Grid Workshop, pp. 73\u201374. ACC Cyfronet AGH (2012)"},{"key":"5_CR16","unstructured":"MetaCentrum, February 2013. http:\/\/www.metacentrum.cz\/"},{"issue":"6","key":"5_CR17","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"AW Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans. Parallel Distrib. Syst. 12(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR18","unstructured":"Ohio Supercomputer Center. Batch Processing at OSC, February 2013. https:\/\/www.osc.edu\/supercomputing\/batch-processing-at-osc"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/10968987_12","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E Shmueli","year":"2003","unstructured":"Shmueli, E., Feitelson, D.G.: Backfilling with lookahead to optimize the performance of parallel job scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 228\u2013251. Springer, Heidelberg (2003)"},{"issue":"6","key":"5_CR20","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TPDS.2007.70606","volume":"18","author":"D Tsafrir","year":"2007","unstructured":"Tsafrir, D., Etsion, Y., Feitelson, D.G.: Backfilling using system-generated predictions rather than user runtime estimates. IEEE Trans. Parallel Distrib. Syst. 18(6), 789\u2013803 (2007)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T17:10:07Z","timestamp":1676394607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43779-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662437780","9783662437797"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43779-7_5","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"}}]}}