{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T12:26:57Z","timestamp":1763987217580},"publisher-location":"Berlin, Heidelberg","reference-count":82,"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_13","type":"book-chapter","created":{"date-parts":[[2005,12,8]],"date-time":"2005-12-08T13:01:31Z","timestamp":1134046891000},"page":"257-282","source":"Crossref","is-referenced-by-count":45,"title":["Pitfalls in Parallel Job Scheduling Evaluation"],"prefix":"10.1007","author":[{"given":"Eitan","family":"Frachtenberg","sequence":"first","affiliation":[]},{"given":"Dror G.","family":"Feitelson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/BFb0053983","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"K. Aida","year":"1998","unstructured":"Aida, K., Kasahara, H., Narita, S.: Job scheduling scheme for pure space sharing among rigid jobs. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 98\u2013121. Springer, Heidelberg (1998)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-60153-8_21","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"G. Alverson","year":"1995","unstructured":"Alverson, G., Kahan, S., Korry, R., McCann, C., Smith, B.: Scheduling on the Tera MTA. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 19\u201344. Springer, Heidelberg (1995)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Antonopoulos, C.D., Nikolopoulos, D.S., Papatheodorou, T.S.: Informing algorithms for efficient scheduling of synchronizing threads on multiprogrammed SMPs. In: 30th International Conference on Parallel Processing (ICPP), Valencia, Spain, September 2001, pp. 123\u2013130 (2001)","DOI":"10.1109\/ICPP.2001.952054"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1145\/380749.380764","volume":"19","author":"A.C. Arpaci-Dusseau","year":"2001","unstructured":"Arpaci-Dusseau, A.C.: Implicit Coscheduling: Coordinated scheduling with implicit information in distributed systems. ACM Transactions on Computer Systems\u00a019(3), 283\u2013331 (2001)","journal-title":"ACM Transactions on Computer Systems"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bailey, D.H.: Misleading performance in the supercomputing field. In: IEEE\/ACM Supercomputing, Minneapolis, MN, November 1992, pp. 155\u2013158 (1992)","DOI":"10.1109\/SUPERC.1992.236699"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bailey, D.H., Dagum, L., Barszcz, E., Simon, H.D.: NAS parallel benchmark results. In: IEEE\/ACM Supercomputing, Minneapolis, MN, November 1992, pp. 386\u2013393 (1992)","DOI":"10.1109\/SUPERC.1992.236665"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Batat, A., Feitelson, D.G.: Gang scheduling with memory considerations. In: 14th International Parallel and Distributed Processing Symposium (IPDPS), May 2000, pp. 109\u2013114 (2000)","DOI":"10.1109\/IPDPS.2000.845971"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-63574-2_20","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"T.B. Brecht","year":"1997","unstructured":"Brecht, T.B.: An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291, pp. 139\u2013165. Springer, Heidelberg (1997)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-47954-6_4","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"S.J. Chapin","year":"1999","unstructured":"Chapin, S.J., Cirne, W., Feitelson, D.G., Jones, J.P., Leutenegger, S.T., Schwiegelshohn, U., Smith, W., Talby, D.: Benchmarks and standards for the evaluation of parallel job schedulers. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol.\u00a01659, pp. 67\u201390. Springer, Heidelberg (1999)"},{"key":"13_CR10","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\u2013207. Springer, Heidelberg (2000)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45540-X_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M.E. Crovella","year":"2001","unstructured":"Crovella, M.E.: Performance evaluation with heavy tailed distributions. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol.\u00a02221, pp. 1\u201310. Springer, Heidelberg (2001)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Cypher, R., Ho, A., Konstantinidou, S., Messina, P.: Architectural requirements of parallel scientific applications with explicit communication. In: 20th International Symposium on Computer Architecture (ISCA), May 1993, pp. 2\u201313 (1993)","DOI":"10.1145\/173682.165124"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Downey, A.B.: A model for speedup of parallel programs. Technical Report UCB\/CSD-97-933, University of California, Berkeley, CA (January 1997)","DOI":"10.21236\/ADA637068"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/309746.309750","volume":"26","author":"A.B. Downey","year":"1999","unstructured":"Downey, A.B., Feitelson, D.G.: The elusive goal of workload characterization. Performance Evaluation Review\u00a026(4), 14\u201329 (1999)","journal-title":"Performance Evaluation Review"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/10968987_9","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"C. Ernemann","year":"2003","unstructured":"Ernemann, C., Song, B., Yahyapour, R.: Scaling of workload traces. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 166\u2013182. Springer, Heidelberg (2003)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0022289","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1996","unstructured":"Feitelson, D.G.: Packing schemes for gang scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol.\u00a01162, pp. 89\u2013110. Springer, Heidelberg (1996)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-63574-2_17","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"Feitelson, D.G.: Memory usage in the LANL CM-5 workload. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291, pp. 78\u201394. Springer, Heidelberg (1997)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-39997-6_5","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"2000","unstructured":"Feitelson, D.G.: A critique of ESP. In: Feitelson, D.G., Rudolph, L. (eds.) IPDPS-WS 2000 and JSSPP 2000. LNCS, vol.\u00a01911, pp. 68\u201373. Springer, Heidelberg (2000)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-45540-X_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"2001","unstructured":"Feitelson, D.G.: Metrics for parallel job scheduling and their convergence. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol.\u00a02221, pp. 188\u20131205. Springer, Heidelberg (2001)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45798-4_6","volume-title":"Performance Evaluation of Complex Systems: Techniques and Tools","author":"D.G. Feitelson","year":"2002","unstructured":"Feitelson, D.G.: Workload modeling for performance evaluation. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol.\u00a02459, pp. 114\u2013141. Springer, Heidelberg (2002)"},{"issue":"9","key":"13_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MC.2003.1231190","volume":"36","author":"D.G. Feitelson","year":"2003","unstructured":"Feitelson, D.G.: Metric and workload effects on computer systems evaluation. Computer\u00a036(9), 18\u201325 (2003)","journal-title":"Computer"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-63574-2_24","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"Feitelson, D.G., Jette, M.A.: Improved utilization and responsiveness with gang scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291, pp. 238\u2013261. Springer, Heidelberg (1997)"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/1052796.1052797","volume":"36","author":"D.G. Feitelson","year":"2005","unstructured":"Feitelson, D.G., Mu\u2019alem, A.W.: On the definition of \u201con-line\u201d in job scheduling problems. ACM SIGACT News\u00a036(1), 122\u2013131 (2005)","journal-title":"ACM SIGACT News"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-60153-8_38","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1995","unstructured":"Feitelson, D.G., Nitzberg, B.: Job characteristics of a production parallel scientific workload on the NASA Ames iPSC\/860. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 337\u2013360. Springer, Heidelberg (1995)"},{"issue":"4","key":"13_CR25","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0743-7315(92)90014-E","volume":"16","author":"D.G. Feitelson","year":"1992","unstructured":"Feitelson, D.G., Rudolph, L.: Gang scheduling performance benefits for fine-grain synchronization. Journal of Parallel and Distributed Computing\u00a016(4), 306\u2013318 (1992)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/BF02577787","volume":"23","author":"D.G. Feitelson","year":"1995","unstructured":"Feitelson, D.G., Rudolph, L.: Coscheduling based on run-time identification of activity working sets. International Journal of Parallel Programming\u00a023(2), 136\u2013160 (1995)","journal-title":"International Journal of Parallel Programming"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60153-8","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1995","unstructured":"Feitelson, D.G., Rudolph, L.: Parallel job scheduling: Issues and approaches. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 1\u201318. Springer, Heidelberg (1995)"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/jpdc.1996.0064","volume":"35","author":"D.G. Feitelson","year":"1996","unstructured":"Feitelson, D.G., Rudolph, L.: Evaluation of design choices for gang scheduling using distributed hierarchical control. Journal of Parallel and Distributed Computing\u00a035(1), 18\u201334 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0022284","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1996","unstructured":"Feitelson, D.G., Rudolph, L.: Toward convergence in job schedulers for parallel supercomputers. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol.\u00a01162, pp. 1\u201326. Springer, Heidelberg (1996)"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0053978","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1998","unstructured":"Feitelson, D.G., Rudolph, L.: Metrics and benchmarking for parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 1\u201324. Springer, Heidelberg (1998)"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11407522_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"2005","unstructured":"Feitelson, D.G., Rudolph, L., Schwigelshohn, U.: Parallel job scheduling \u2013 A status report. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., Weil, A.M.: Utilization and predictability in scheduling the IBM SP2 with backfilling. In: 12th International Parallel Processing Symposium (IPPS), April 1998, pp. 542\u2013546 (1998)","DOI":"10.1109\/IPPS.1998.669970"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/10968987_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E. Frachtenberg","year":"2003","unstructured":"Frachtenberg, E., Feitelson, D.G., Fernandez-Peinador, J., Petrini, F.: Parallel job scheduling under dynamic workloads. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 208\u2013227. Springer, Heidelberg (2003)"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Frachtenberg, E., Feitelson, D.G., Petrini, F., Fernandez, J.: Adaptive parallel job scheduling with flexible coscheduling. IEEE Transactions on Parallel and Distributed Systems (to appear)","DOI":"10.1109\/TPDS.2005.130"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Gupta, A., Tucker, A., Urushibara, S.: The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications. In: SIGMETRICS Measurement & Modeling of Computer Systems, San Diego, CA, May 1991, pp. 120\u2013132 (1991)","DOI":"10.1145\/107971.107985"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11407522_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"G. Holt","year":"2005","unstructured":"Holt, G.: Time-critical scheduling on a well utilised HPC system at ECMWF using LoadLeveler with resource reservation. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 102\u2013124. Springer, Heidelberg (2005)"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BFb0053989","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"A. Hori","year":"1998","unstructured":"Hori, A., Tezuka, H., Ishikawa, Y.: Overhead analysis of preemptive gang scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 217\u2013230. Springer, Heidelberg (1998)"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-63574-2_18","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J. Jann","year":"1997","unstructured":"Jann, J., Pattnaik, P., Franke, H., Wang, F., Skovira, J., Riodan, J.: Modeling of workload in MPPs. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291, pp. 95\u2013116. Springer, Heidelberg (1997)"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47954-6_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J.P. Jones","year":"1999","unstructured":"Jones, J.P., Nitzberg, B.: Scheduling for parallel supercomputing: A historical perspective of achievable utilization. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol.\u00a01659, pp. 1\u201316. Springer, Heidelberg (1999)"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-36180-4_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E. Krevat","year":"2002","unstructured":"Krevat, E., Casta\u00f1os, J.G., Moreira, J.E.: Job scheduling for the BlueGene\/L system. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol.\u00a02537, pp. 38\u201354. Springer, Heidelberg (2002)"},{"key":"13_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/11407522_14","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"C.B. Lee","year":"2005","unstructured":"Lee, C.B., Schwartzman, Y., Hardy, J., Snavely, A.: Are user runtime estimates inherently inaccurate? In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 253\u2013263. Springer, Heidelberg (2005)"},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-63574-2_23","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Lee","year":"1997","unstructured":"Lee, W., Frank, M., Lee, V., Mackenzie, K., Rudolph, L.: Implications of I\/O for gang scheduled workloads. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291, pp. 215\u2013237. Springer, Heidelberg (1997)"},{"key":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/11407522_10","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"H. Li","year":"2005","unstructured":"Li, H., Groep, D., Wolters, L.: Workload characteristics of a multi-cluster supercomputer. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 176\u2013193. Springer, Heidelberg (2005)"},{"key":"13_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-60153-8_35","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Lifka","year":"1995","unstructured":"Lifka, D.: The ANL\/IBM SP scheduling system. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 295\u2013303. Springer, Heidelberg (1995)"},{"key":"13_CR45","doi-asserted-by":"crossref","unstructured":"Liu, W., Lo, V., Windisch, K., Nitzberg, B.: Non-contiguous processor allocation algorithms for distributed memory multicomputers. In: IEEE\/ACM Supercomputing, November 1994, pp. 227\u2013236 (1994)","DOI":"10.1145\/602770.602811"},{"key":"13_CR46","doi-asserted-by":"crossref","unstructured":"Lo, V., Mache, J.: Job scheduling for prime time vs. non-prime time. In: Fourth Proceedings of the IEEE International Conference on Cluster Computing, September 2002, pp. 488\u2013493 (2002)","DOI":"10.1109\/CLUSTR.2002.1137789"},{"key":"13_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BFb0053979","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"V. Lo","year":"1998","unstructured":"Lo, V., Mache, J., Windisch, K.: A comparative study of real workload traces and synthetic workload models for parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 25\u201346. Springer, Heidelberg (1998)"},{"issue":"11","key":"13_CR48","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/S0743-7315(03)00108-4","volume":"63","author":"U. Lublin","year":"2003","unstructured":"Lublin, U., Feitelson, D.G.: The workload on parallel supercomputers: Modeling the characteristics of rigid jobs. Journal of Parallel and Distributed Computing\u00a063(11), 1105\u20131122 (2003)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR49","volume-title":"Simulating Computer Systems: Techniques and Tools","author":"M.H. MacDougall","year":"1987","unstructured":"MacDougall, M.H.: Simulating Computer Systems: Techniques and Tools. MIT Press, Cambridge (1987)"},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"Moreira, J.E., Chan, W., Fong, L.L., Franke, H., Jette, M.A.: An infrastructure for efficient parallel job execution in terascale computing environments. In: IEEE\/ACM Supercomputing, Orlando, FL (November 1998)","DOI":"10.1109\/SC.1998.10026"},{"issue":"6","key":"13_CR51","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A.W. 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 Transactions on Parallel and Distributed Systems\u00a012(6), 529\u2013543 (2001)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BFb0022294","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"T.D. Nguyen","year":"1996","unstructured":"Nguyen, T.D., Vaswani, R., Zahorjan, J.: Parallel application characterization for multiprocessor scheduling policy design. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol.\u00a01162, pp. 175\u2013199. Springer, Heidelberg (1996)"},{"issue":"10","key":"13_CR53","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/71.539739","volume":"7","author":"N. Nieuwejaar","year":"1996","unstructured":"Nieuwejaar, N., Kotz, D., Purakayastha, A., Ellis, C.S., Best, M.L.: File-access characteristics of parallel scientific workloads. IEEE Transactions on Parallel and Distributed Systems\u00a07(10), 1075\u20131089 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR54","unstructured":"Parallel workload archive, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload"},{"key":"13_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-60153-8_26","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E.W. Parsons","year":"1995","unstructured":"Parsons, E.W., Sevcik, K.C.: Multiprocessor scheduling for high-variability service time distributions. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 127\u2013145. Springer, Heidelberg (1995)"},{"issue":"2","key":"13_CR56","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/78919.78921","volume":"22","author":"K. Pawlikowski","year":"1990","unstructured":"Pawlikowski, K.: Steady-state simulation of queueing processes: A survey of problems and solutions. ACM Computing Surveys\u00a022(2), 123\u2013170 (1990)","journal-title":"ACM Computing Surveys"},{"key":"13_CR57","doi-asserted-by":"crossref","unstructured":"Peris, V.G.J., Squillante, M.S., Naik, V.K.: Analysis of the impact of memory in distributed parallel processing systems. In: SIGMETRICS Measurement & Modeling of Computer Systems, Nashville, TN, May 1994, pp. 5\u201318 (1994)","DOI":"10.1145\/183018.183021"},{"key":"13_CR58","unstructured":"ASCI program. ASCI technology prospectus: Simulation and computational science. Technical Report DOE\/DP\/ASC-ATP-001, National Nuclear Security Agency (July 2001)"},{"key":"13_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-39997-6_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"L. Rudolph","year":"2000","unstructured":"Rudolph, L., Smith, P.: Valuation of ultra-scale computing systems. In: Feitelson, D.G., Rudolph, L. (eds.) IPDPS-WS 2000 and JSSPP 2000. LNCS, vol.\u00a01911, pp. 39\u201355. Springer, Heidelberg (2000)"},{"key":"13_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BFb0053987","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"U. Schwiegelshohn","year":"1998","unstructured":"Schwiegelshohn, U., Yahyapour, R.: Improving first-come-first-serve job scheduling by gang scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 180\u2013198. Springer, Heidelberg (1998)"},{"key":"13_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-60153-8_27","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"S.K. Setia","year":"1995","unstructured":"Setia, S.K.: The interaction between memory allocation and adaptive partitioning in message-passing multicomputers. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 146\u2013164. Springer, Heidelberg (1995)"},{"key":"13_CR62","doi-asserted-by":"crossref","unstructured":"Smith, K.A., Seltzer, M.I.: File system aging\u2014Increasing the relevance of file system benchmarks. In: SIGMETRICS Measurement & Modeling of Computer Systems, June 1997, pp. 203\u2013213 (1997)","DOI":"10.1145\/258612.258689"},{"key":"13_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-60153-8_25","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"P.G. Sobalvarro","year":"1995","unstructured":"Sobalvarro, P.G., Weihl, W.E.: Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 106\u2013126. Springer, Heidelberg (1995)"},{"key":"13_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11407522_16","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"A.C. Sodan","year":"2005","unstructured":"Sodan, A.C., Lan, L.: LOMARC\u2014Lookahead matchmaking for multi-resource coscheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 288\u2013315. Springer, Heidelberg (2005)"},{"key":"13_CR65","doi-asserted-by":"crossref","unstructured":"Squillante, M., Zhang, Y., Sivasubramaniam, S., Gautam, N., Franke, H., Moreira, J.: Modeling and analysis of dynamic coscheduling in parallel and distributed environments. In: SIGMETRICS Measurement & Modeling of Computer Systems, Marina Del Rey, CA, June 2002, pp. 43\u201354 (2002)","DOI":"10.1145\/511334.511341"},{"key":"13_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-60153-8_31","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M.S. Squillante","year":"1995","unstructured":"Squillante, M.S.: On the benefits and limitations of dynamic partitioning in parallel computer systems. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 219\u2013238. Springer, Heidelberg (1995)"},{"key":"13_CR67","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0166-5316(99)00035-8","volume":"37","author":"M.S. Squillante","year":"1999","unstructured":"Squillante, M.S., Yao, D.D., Zhang, L.: Analysis of job arrival patterns and parallel scheduling performance. Performance Evaluation\u00a036\u201337, 137\u2013163 (1999)","journal-title":"Performance Evaluation"},{"key":"13_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-47954-6_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Talby","year":"1999","unstructured":"Talby, D., Feitelson, D.G., Raveh, A.: Comparing logs and models of parallel workloads using the Co-Plot method. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol.\u00a01659, pp. 43\u201366. Springer, Heidelberg (1999)"},{"key":"13_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/BFb0053986","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"S. Tongsima","year":"1998","unstructured":"Tongsima, S., Chantrapornchai, C., Sha, E.H.-M.: Probabilistic loop scheduling considering communication overhead. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 158\u2013179. Springer, Heidelberg (1998)"},{"key":"13_CR70","unstructured":"Top 500 supercomputers, http:\/\/www.top500.org"},{"key":"13_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-45798-4_14","volume-title":"Performance Evaluation of Complex Systems: Techniques and Tools","author":"K.S. Trivedi","year":"2002","unstructured":"Trivedi, K.S., Vaidyanathan, K.: Software reliability and rejuvenation: Modeling and analysis. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol.\u00a02459, pp. 318\u2013345. Springer, Heidelberg (2002)"},{"key":"13_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11605300_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Tsafrir","year":"2005","unstructured":"Tsafrir, D., Etsion, Y., Feitelson, D.G.: Modeling user runtime estimates. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol.\u00a03834, pp. 1\u201335. Springer, Heidelberg (2005)"},{"key":"13_CR73","unstructured":"Tsafrir, D., Feitelson, D.G.: Workload flurries. Technical Report 2003-85, Hebrew University (November 2003)"},{"key":"13_CR74","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0022287","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M. Wan","year":"1996","unstructured":"Wan, M., Moore, R., Kremenek, G., Steube, K.: A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol.\u00a01162, pp. 48\u201364. Springer, Heidelberg (1996)"},{"key":"13_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-63574-2_26","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"F. Wang","year":"1997","unstructured":"Wang, F., Papaefthymiou, M., Squillante, M.: Performance evaluation of gang scheduling for parallel and distributed multiprogramming. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291, pp. 277\u2013298. Springer, Heidelberg (1997)"},{"key":"13_CR76","doi-asserted-by":"crossref","unstructured":"Willinger, W., Taqqu, M.S., Sherman, R., Wilson, D.V.: Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level. In: ACM SIGCOMM, pp. 100\u2013113 (1995)","DOI":"10.1145\/217391.217418"},{"issue":"6","key":"13_CR77","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/TPDS.2003.1206505","volume":"14","author":"Y. Wiseman","year":"2003","unstructured":"Wiseman, Y., Feitelson, D.G.: Paired gang scheduling. IEEE Transactions on Parallel and Distributed Systems\u00a014(6), 581\u2013592 (2003)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR78","doi-asserted-by":"crossref","unstructured":"Wong, A.T., Oliker, L., Kramer, W.T.C., Kaltz, T.L., Bailey, D.H.: ESP: A system utilization benchmark. In: IEEE\/ACM Supercomputing, Dallas, TX, November 2000, pp. 52\u201352 (2000)","DOI":"10.1109\/SC.2000.10056"},{"key":"13_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-60153-8_29","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"K.K. Yue","year":"1995","unstructured":"Yue, K.K., Lilja, D.J.: Loop-level process control: An effective processor allocation policy for multiprogrammed shared-memory multiprocessors. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 182\u2013199. Springer, Heidelberg (1995)"},{"key":"13_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45540-X_9","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Y. Zhang","year":"2001","unstructured":"Zhang, Y., Franke, H., Moreira, J.E., Sivasubramaniam, A.: An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol.\u00a02221, pp. 133\u2013158. Springer, Heidelberg (2001)"},{"key":"13_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/10968987_10","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Y. Zhang","year":"2003","unstructured":"Zhang, Y., Yang, A., Sivasubramaniam, A., Moreira, J.: Gang scheduling extensions for I\/O intensive workloads. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 183\u2013207. Springer, Heidelberg (2003)"},{"key":"13_CR82","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0053985","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"B.B. Zhou","year":"1998","unstructured":"Zhou, B.B., Brent, R.P., Walsh, D., Suzaki, K.: Job scheduling strategies for networks of workstations. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 143\u2013157. Springer, Heidelberg (1998)"}],"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_13.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_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310242","9783540316176"],"references-count":82,"URL":"https:\/\/doi.org\/10.1007\/11605300_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}