{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:05:39Z","timestamp":1774595139308,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428176","type":"print"},{"value":"9783540455400","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45540-x_11","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:37:01Z","timestamp":1180672621000},"page":"188-205","source":"Crossref","is-referenced-by-count":68,"title":["Metrics for Parallel Job Scheduling and Their Convergence"],"prefix":"10.1007","author":[{"given":"Dror G.","family":"Feitelson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"11_CR1","unstructured":"P. Brinch Hansen, \u201cAn analysis of response ratio scheduling\u201d. In IFIP Congress, Ljubljana, pp. TA\u20133 150\u2013154, Aug 1971."},{"key":"11_CR2","series-title":"Lect Notes Comput Sci","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":"W. Cirne and F. Berman, \u201cAdaptive selection of partition size for supercomputer requests\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 187\u2013207, Springer Verlag, 2000. Lect. Notes Comput. Sci. vol. 1911."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"M. E. Crovella and A. Bestavros, \u201cSelf-similarity in world wide web traffic: evidence and possible causes\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 160\u2013169, May 1996.","DOI":"10.1145\/233013.233038"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"M. E. Crovella and L. Lipsky, \u201cLong-lasting transient conditions in simulations with heavy-tailed workloads\u201d. In Winter Simulation conf., Dec 1997.","DOI":"10.1145\/268437.268733"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"A. B. Downey, \u201cA parallel workload model and its implications for processor allocation\u201d. In 6th Intl. Symp. High Performance Distributed Comput., Aug 1997.","DOI":"10.1109\/HPDC.1997.622368"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/309746.309750","volume":"26","author":"A. B. Downey","year":"1999","unstructured":"A. B. Downey and D. G. Feitelson, \u201cThe elusive goal of workload characterization\u201d. Performance Evaluation Rev. 26(4), pp. 14\u201329, Mar 1999.","journal-title":"Performance Evaluation Rev."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"D. L. Eager, E. D. Lazowska, and J. Zahorjan, \u201cThe limited performance benefits of migrating active processes for load sharing\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 63\u201372, May 1988.","DOI":"10.1145\/55595.55604"},{"key":"11_CR8","series-title":"Lect Notes Comput Sci","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":"D. G. Feitelson, \u201cPacking schemes for gang scheduling\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 89\u2013110, Springer-Verlag, 1996. Lect. Notes Comput. Sci. vol. 1"},{"key":"11_CR9","series-title":"Lect Notes Comput Sci","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":"D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong, \u201cTheory and practice in parallel job scheduling\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1\u201334, Springer Verlag, 1997. Lect. Notes Comput. Sci. vol. 1"},{"issue":"8","key":"11_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/2.402073","volume":"28","author":"R. Giladi","year":"1995","unstructured":"R. Giladi and N. Ahituv, \u201cSPEC as a performance evaluation measure\u201d. Computer 28(8), pp. 33\u201342, Aug 1995.","journal-title":"Computer"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"M. Harchol-Balter, M. E. Crovella, and C. D. Murta, \u201cOn choosing a task assignment policy for a distributed server system\u201d. In Computer Performance Evaluation, R. Puigjaner, N. Savino, and B. Serra (eds.), pp. 231\u2013242, Springer-Verlag, 1998.","DOI":"10.1007\/3-540-68061-6_19"},{"issue":"3","key":"11_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/263326.263344","volume":"15","author":"M. Harchol-Balter","year":"1997","unstructured":"M. Harchol-Balter and A. B. Downey, \u201cExploiting process lifetime distributions for dynamic load balancing\u201d. ACM Trans. Comput. Syst. 15(3), pp. 253\u2013285, Aug 1997.","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/203091.203094","volume":"5","author":"P. Heidelberger","year":"1995","unstructured":"P. Heidelberger, \u201cFast simulation of rare events in queueing and reliability models\u201d. ACM Trans. Modeling & Comput. Simulation 5(1), pp. 43\u201385, Jan 1995.","journal-title":"ACM Trans. Modeling & Comput. Simulation"},{"key":"11_CR14","unstructured":"R. Jain, The Art of Computer Systems Performance Analysis. John Wiley & Sons, 1991."},{"key":"11_CR15","series-title":"Lect Notes Comput Sci","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":"J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riodan, \u201cModeling of workload in MPPs\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 95\u2013116, Springer Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291."},{"key":"11_CR16","unstructured":"E. D. Lazowska, \u201cThe use of percentiles in modeling CPU service time distributions\u201d. In Computer Performance, K. M. Chandy and M. Reiser (eds.), pp. 53\u201366, North-Holland, 197"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"W. E. Leland and T. J. Ott, \u201cLoad-balancing heuristics and process behavior\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 54\u201369, 1986.","DOI":"10.1145\/317499.317539"},{"key":"11_CR18","series-title":"Lect Notes Comput Sci","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":"D. Lifka, \u201cThe ANL\/IBM SP scheduling system\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 295\u2013303, Springer-Verlag, 1995. Lect. Notes Comput. Sci. vol. 949."},{"key":"11_CR19","unstructured":"U. Lublin, A Workload Model for Parallel Computer Systems. Master\u2019s thesis, Hebrew University, 1999. (In Hebrew)."},{"key":"11_CR20","unstructured":"M. H. MacDougall, Simulating Computer Systems: Techniques and Tools. MIT Press, 1987."},{"issue":"6","key":"11_CR21","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A. W. Mualem","year":"2001","unstructured":"A. W. Mu\u2019alem and D. G. Feitelson, \u201cUtilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling\u201d. IEEE Trans. Parallel & Distributed Syst. 12(6), pp. 529\u2013543, Jun 2001.","journal-title":"IEEE Trans. Parallel & Distributed Syst."},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/78919.78921","volume":"22","author":"K. Pawlikowski","year":"1990","unstructured":"K. Pawlikowski, \u201cSteady-state simulation of queueing processes: a survey of problems and solutions\u201d. ACM Comput. Surv. 22(2), pp. 123\u2013170, Jun 1990.","journal-title":"ACM Comput. Surv."},{"issue":"7","key":"11_CR23","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/364995.365690","volume":"8","author":"R. F. Rosin","year":"1965","unstructured":"R. F. Rosin, \u201cDetermining a computing center environment\u201d. Comm. ACM 8(7), pp. 465\u2013468, Jul 1965.","journal-title":"Comm. ACM"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"D. Zotkin and P. J. Keleher, \u201cJob-length estimation and performance in backfilling schedulers\u201d. In 8th Intl. Symp. High Performance Distributed Comput., Aug 1999.","DOI":"10.1109\/HPDC.1999.805303"}],"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\/3-540-45540-X_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T02:34:34Z","timestamp":1550370874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45540-X_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428176","9783540455400"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45540-x_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}