{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T16:01:15Z","timestamp":1767888075923,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540710349","type":"print"},{"value":"9783540710356","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71035-6_5","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T07:29:39Z","timestamp":1179300579000},"page":"94-114","source":"Crossref","is-referenced-by-count":17,"title":["Moldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Sabin","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Lang","sequence":"additional","affiliation":[]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Feitelson, D.: Workshops on job scheduling strategies for parallel processing, http:\/\/www.cs.huji.ac.il\/~feit\/parsched\/"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-63574-2","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"Feitelson, D.G., et al.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing. LNCS, vol.\u00a01291, pp. 1\u201334. Springer, Heidelberg (1997)"},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A.M. Weil","year":"2001","unstructured":"Weil, A.M., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the ibm sp2 with backfilling. IEEE Trans. Parallel Distrib. Syst.\u00a012(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BFb0022286","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J. Skovira","year":"1996","unstructured":"Skovira, J., et al.: The easy - loadleveler api project. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing. LNCS, vol.\u00a01162, pp. 41\u201347. Springer, Heidelberg (1996)"},{"key":"5_CR5","unstructured":"Frachtenberg, E., et al.: Flexible CoScheduling: Mitigating load imbalance and improving utilization of heterogeneous resources. In: IPDPS, vol. 17 (2003)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-39997-6_12","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Cirne","year":"2000","unstructured":"Cirne, W., Berman, F.: Adaptive selection of partition size for supercomputer requests. In: Feitelson, D.G., Rudolph, L. (eds.) IPDPS-WS 2000 and JSSPP 2000. LNCS, vol.\u00a01911, pp. 187\u2013208. Springer, Heidelberg (2000)"},{"issue":"10","key":"5_CR7","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1016\/S0743-7315(02)91869-1","volume":"62","author":"W. Cirne","year":"2002","unstructured":"Cirne, W., Berman, F.: Using moldability to improve the performance of supercomputer jobs. J. Parallel Distrib. Comput.\u00a062(10), 1571\u20131601 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-36265-7_17","volume-title":"High Performance Computing - HiPC 2002","author":"S. Srinivasan","year":"2002","unstructured":"Srinivasan, S., et al.: Effective selection of partition sizes for moldable scheduling of parallel jobs. In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol.\u00a02552, pp. 174\u2013183. Springer, Heidelberg (2002)"},{"key":"5_CR9","first-page":"92","volume-title":"CLUSTER","author":"S. Srinivasan","year":"2003","unstructured":"Srinivasan, S., Krishnamoorthy, S., Sadayappan, P.: A robust scheduling strategy for moldable scheduling of parallel jobs. In: CLUSTER, pp. 92\u201399. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"5_CR10","first-page":"514","volume-title":"ICPP Workshops","author":"S. Srinivasan","year":"2002","unstructured":"Srinivasan, S., et al.: Characterization of backfilling strategies for parallel job scheduling. In: ICPP Workshops, pp. 514\u2013522. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11605300_13","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E. Frachtenberg","year":"2005","unstructured":"Frachtenberg, E., Feitelson, D.G.: Pitfalls in parallel job scheduling evaluation. In: Feitelson, D.G., et al. (eds.) JSSPP 2005. LNCS, vol.\u00a03834, pp. 257\u2013282. Springer, Heidelberg (2005)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"2005","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U.: Parallel job scheduling - a status report. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"5_CR13","unstructured":"Feitelson, D.G.: Logs of real parallel workloads from production systems, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J., Leung, J.Y.T.: Complexity of scheduling parallel task systems. SIAM J. Discret. Math.\u00a02(4), 473\u2013487 (1989)","journal-title":"SIAM J. Discret. Math."},{"issue":"12","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1109\/12.214665","volume":"41","author":"R. Krishnamurti","year":"1992","unstructured":"Krishnamurti, R., Ma, E.: An approximation algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems. IEEE Transactions on Computers\u00a041(12), 1572\u20131579 (1992)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Graham, R.L.: Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput.\u00a04(2), 187\u2013200 (1975)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput.\u00a04(4), 397\u2013411 (1975)","journal-title":"SIAM J. Comput."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Li, K., Cheng, K.H.: Job scheduling in partitionable mesh connected systems. In: ICPP, vol. 2, pp. 65\u201372 (1989)","DOI":"10.1016\/0743-7315(90)90024-J"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TSE.1985.232189","volume":"11","author":"D.L. Tuomenoksa","year":"1985","unstructured":"Tuomenoksa, D.L., Siegel, H.J.: Task scheduling on the pasm parallel processing system. IEEE Trans. Software Eng.\u00a011(2), 145\u2013157 (1985)","journal-title":"IEEE Trans. Software Eng."},{"key":"5_CR20","unstructured":"Eager, D.L., Zahorjan, J., Lazowska, E.D.: Speedup versus efficiency in parallel systems, pp. 76\u201391 (1995)"},{"issue":"5","key":"5_CR21","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/32.90447","volume":"17","author":"D. Ghosal","year":"1991","unstructured":"Ghosal, D., Serazzi, G., Tripathi, S.K.: The processor working set and its use in scheduling multiprocessor systems. IEEE Trans. Softw. Eng.\u00a017(5), 443\u2013453 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"5_CR22","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/32.135776","volume":"18","author":"L. Kleinrock","year":"1992","unstructured":"Kleinrock, L., Huang, J.H.: On parallel processing systems: Amdahl\u2019s law generalized and some results on optimal design. IEEE Trans. Softw. Eng.\u00a018(5), 434\u2013447 (1992)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/151244.151246","volume":"11","author":"C. McCann","year":"1993","unstructured":"McCann, C., Vaswani, R., Zahorjan, J.: A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Trans. Comput. Syst.\u00a011(2), 146\u2013178 (1993)","journal-title":"ACM Trans. Comput. Syst."},{"key":"5_CR24","unstructured":"Sevcik, K.C.: Application scheduling and processor allocation in multiprogrammed parallel processing systems. Technical Report CSRI-282, Computer Systems Research Institute, University of Toronto, Toronto, Canada, M5S 1A1 (1993)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-60153-8_28","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E. Rosti","year":"1995","unstructured":"Rosti, E., et al.: Analysis of non-work-conserving processor partitioning policies. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing. LNCS, vol.\u00a0949, pp. 165\u2013181. Springer, Heidelberg (1995)"},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/3-540-63574-2_15","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"A.B. Downey","year":"1997","unstructured":"Downey, A.B.: Using queue time predictions for processor allocation. In: Feitelson, D.G., Rudolph, L. (eds.) Job Scheduling Strategies for Parallel Processing, pp. 35\u201357. Springer, Heidelberg (1997)"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1019077214124","volume":"1","author":"A.B. Downey","year":"1998","unstructured":"Downey, A.B.: A parallel workload model and its implications for processor allocation. Cluster Computing\u00a01(1), 133\u2013145 (1998)","journal-title":"Cluster Computing"},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/75372.75391","volume":"17","author":"K.C. Sevcik","year":"1989","unstructured":"Sevcik, K.C.: Characterizations of parallelism in applications and their use in scheduling. SIGMETRICS Perform. Eval. Rev.\u00a017(1), 171\u2013180 (1989)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Chiang, S.H., Mansharamani, R.K., Vernon, M.K.: Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. In: SIGMETRICS, pp. 33\u201344 (1994)","DOI":"10.1145\/183018.183023"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Downey, A.B.: A model for speedup of parallel programs. Technical Report CSD-97-933 (1997)","DOI":"10.21236\/ADA637068"},{"key":"5_CR31","unstructured":"Rajan, A.: Evaluation of scheduling strategies for moldable parallel jobs. Master\u2019s thesis, The Ohio State University (2004)"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71035-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:35:16Z","timestamp":1620016516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71035-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540710349","9783540710356"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71035-6_5","relation":{},"subject":[]}}