{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:11:19Z","timestamp":1742382679842},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310242"},{"type":"electronic","value":"9783540316176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11605300_12","type":"book-chapter","created":{"date-parts":[[2005,12,8]],"date-time":"2005-12-08T13:01:31Z","timestamp":1134046891000},"page":"238-256","source":"Crossref","is-referenced-by-count":19,"title":["Unfairness Metrics for Space-Sharing Parallel Job Schedulers"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Sabin","sequence":"first","affiliation":[]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Talby, D., Feitelson, D.: Supporting priorities and improving utilization of the IBM SP scheduler using slack-based backfilling. In: Proceedings of the 13th International Parallel Processing Symposium (1999)","DOI":"10.1109\/IPPS.1999.760525"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A. Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem, A., Feitelson, D.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Transactions on Parallel and Distributed Systems\u00a012, 529\u2013543 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/10968987_5","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"G. Sabin","year":"2003","unstructured":"Sabin, G., Kettimuthu, R., Rajan, A., Sadayappan, P.: Scheduling of parallel jobs in a heterogeneous multi-site environement. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 87\u2013104. Springer, Heidelberg (2003)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/10968987_13","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M. Islam","year":"2003","unstructured":"Islam, M., Balaji, P., Sadayappan, P., Panda, D.K.: QoPS: A QoS based scheme for parallel job scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 252\u2013268. Springer, Heidelberg (2003)"},{"key":"12_CR5","unstructured":"Feitelson, D.: Workshops on job scheduling strategies for parallel processing, http:\/\/www.cs.huji.ac.il\/~feit\/parsched\/"},{"key":"12_CR6","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.: Backfilling with lookahead to optimize the performance of parallel job scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 228\u2013251. Springer, Heidelberg (2003)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P.: Characterization of backfilling strategies for job scheduling. In: 2002 Intl. Workshops on Parallel Processing (2002); held in conjunction with the 2002 Intl. Conf. on Parallel Processing, ICPP 2002","DOI":"10.1109\/ICPPW.2002.1039773"},{"key":"#cr-split#-12_CR8.1","doi-asserted-by":"crossref","unstructured":"Raz, D., Levy, H., Avi-Itzhak, B.: A resource-allocation queueing fairness measure. In: Proceedings of Sigmetrics 2004\/Performance 2004 Joint Conference on Measurement and Modeling of Computer Systems, New York, NY, pp. 130\u2013141 (2004);","DOI":"10.1145\/1005686.1005704"},{"key":"#cr-split#-12_CR8.2","unstructured":"Also appears as Performance Evaluation Review Special Issue\u00a032(1), 130\u2013141"},{"key":"12_CR9","unstructured":"Avi-Itzhak, B., Levy, H., Raz, D.: Quantifying fairness in queueing systems: Principles and applications. Technical Report RRR-26-2004, RUTCOR, Rutgers University (2004)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Raz, D., Levy, H., Avi-Itzhak, B.: RAQFM: a resource allocation queueing fairness measure. Technical Report RRR-32-2004, RUTCOR, Rutgers University (2004)","DOI":"10.1145\/1005686.1005704"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1086\/224787","volume":"75","author":"L. Mann","year":"1969","unstructured":"Mann, L.: Queue culture: The waiting line as a social system. The American Journal of Sociology\u00a075, 340\u2013354 (1969)","journal-title":"The American Journal of Sociology"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1287\/opre.35.6.895","volume":"35","author":"R. Larson","year":"1987","unstructured":"Larson, R.: Perspectives on queues: Social justice and the psychology of queueing. Operations Research\u00a035, 895\u2013905 (1987)","journal-title":"Operations Research"},{"key":"12_CR13","unstructured":"Gordon, E.S.: Slips and Skips in Queues. PhD thesis, Massachusetts Institute of Technology (1989)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.3230140305","volume":"14","author":"W. Whitt","year":"1984","unstructured":"Whitt, W.: The amount of overtaking in a network of queues. Networks\u00a014, 411\u2013426 (1984)","journal-title":"Networks"},{"key":"12_CR15","unstructured":"Rafaeli, A., Kedmi, E., Vashdi, D., Barron, G.: Queues and fairness: A multiple study experimental investigation, http:\/\/queues-fairness.rafaeli.net\/"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1145\/146637.146658","volume":"39","author":"A.G. Greenberg","year":"1992","unstructured":"Greenberg, A.G., Madras, N.: How fair is fair queueing? Association for Computing Machinery\u00a039, 568\u2013598 (1992)","journal-title":"Association for Computing Machinery"},{"key":"12_CR17","first-page":"3","volume":"1","author":"A. Demers","year":"1990","unstructured":"Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. Internetworking Research and Experience\u00a01, 3\u201326 (1990)","journal-title":"Internetworking Research and Experience"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1013724109843","volume":"8","author":"T. Nandagopal","year":"2002","unstructured":"Nandagopal, T., Lu, S., Bharghavan, V.: A unified architecture for the design and evaluation of wireless fair queueing algorithms. Wireless Networks\u00a08, 231\u2013247 (2002)","journal-title":"Wireless Networks"},{"key":"12_CR19","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 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 238\u2013249 (2003)","DOI":"10.1145\/781027.781057"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Bansal, N., Harcol-Balter, M.: Analysis of SRPT scheduling: Investigating unfairness. In: SIGMETRICS (2001)","DOI":"10.1145\/378420.378792"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M., Sigman, K., Wierman, A.: Asymptotic convergence of scheduling policies with respect to slowdown. In: IFIP WG 7.3 International Symposium on Computer Modeling, Measurement and Evaluation (2002)","DOI":"10.1016\/S0166-5316(02)00132-3"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/1099-1425(200009\/10)3:5<297::AID-JOS50>3.0.CO;2-D","volume":"5","author":"U. Schwiegelshohn","year":"2000","unstructured":"Schwiegelshohn, U., Yahyapour, R.: Fairness in parallel job scheduling. Journal of Scheduling\u00a05, 297\u2013320 (2000)","journal-title":"Journal of Scheduling"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Sabin, G., Sahasrabudhe, V., Sadayappan, P.: On fairness in distributed job scheduling across multiple sites. In: Cluster (2004)","DOI":"10.1109\/CLUSTR.2004.1392599"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Sabin, G., Kochhar, G., Sadayappan, P.: Job fairness in non-preemptive job scheduling. In: International Conference on Parallel Processesing (2004)","DOI":"10.1109\/ICPP.2004.1327920"},{"key":"12_CR25","unstructured":"Feitelson, D.G.: Logs of real parallel workloads from production systems, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/"},{"key":"12_CR26","unstructured":"Hansen, B.: An analysis of response ratio. In: IFIP Congress (1971)"},{"key":"12_CR27","unstructured":"Weisstein, E.W.: Spearman rank correlation coefficient, http:\/\/mathworld.wolfram.com\/SpearmanRankCorrelationCoefficient.html From MathWorld\u2013A Wolfram Web Resource"}],"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\/11605300_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:30Z","timestamp":1619507130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605300_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310242","9783540316176"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11605300_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}