{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:19:30Z","timestamp":1773944370003,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":62,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540666769","type":"print"},{"value":"9783540479543","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-47954-6_4","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T07:39:08Z","timestamp":1191569948000},"page":"67-90","source":"Crossref","is-referenced-by-count":80,"title":["Benchmarks and Standards for the Evaluation of Parallel Job Schedulers"],"prefix":"10.1007","author":[{"given":"Steve J.","family":"Chapin","sequence":"first","affiliation":[]},{"given":"Walfredo","family":"Cirne","sequence":"additional","affiliation":[]},{"given":"Dror G.","family":"Feitelson","sequence":"additional","affiliation":[]},{"given":"James Patton","family":"Jones","sequence":"additional","affiliation":[]},{"given":"Scott T.","family":"Leutenegger","sequence":"additional","affiliation":[]},{"given":"Uwe","family":"Schwiegelshohn","sequence":"additional","affiliation":[]},{"given":"Warren","family":"Smith","sequence":"additional","affiliation":[]},{"given":"David","family":"Talby","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,7,14]]},"reference":[{"issue":"6","key":"4_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/C-M.1976.218610","volume":"9","author":"A. K. Agrawala","year":"1976","unstructured":"A. K. Agrawala, J. M. Mohr, and R. M. Bryant, \u201cAn approach to the workload characterization problem.\u201d Computer 9 (6), pp. 18\u201332, Jun 1976.","journal-title":"Computer"},{"key":"4_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-60153-8_21","volume-title":"Scheduling on the Tera MTA.\u201d In Job Scheduling Strategies for Parallel Processing","author":"G. Alverson","year":"1995","unstructured":"G. Alverson, S. Kahan, R. Korry, C. McCann, and B. Smith, \u201cScheduling on the Tera MTA.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 19\u201344, Springer-Verlag, 1995. Lect. Notes Comput. Sci. vol. 949."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"P. Barford and M. Crovella, \u201cGenerating representative web workloads for network and server performance evaluation.\u201d In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 151\u2013160, Jun 1998.","DOI":"10.1145\/277851.277897"},{"key":"4_CR4","unstructured":"A. Batat. Master\u2019s thesis, Hebrew University, 1999. (in preparation)."},{"key":"4_CR5","unstructured":"F. Berman, \u201cHigh-performance schedulers.\u201d In The Grid: Blueprint for a New Computing Infrastructure, I. Foster and C. Kesselman (eds.), pp. 279\u2013309, Morgan Kaufmann, 1999."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"F. Berman, R. Wolski, S. Figueira, J. Schopf, and G. Shao., \u201cApplication-level scheduling on distributed heterogeneous networks.\u201d In Supercomputing\u2019 96, 1996.","DOI":"10.1145\/369028.369109"},{"key":"4_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/BFb0046616","volume-title":"High-Performance Computing and Networking","author":"M. Calzarossa","year":"1995","unstructured":"M. Calzarossa, G. Haring, G. Kotsis, A. Merlo, and D. Tessera, \u201cA hierarchical approach to workload characterization for parallel systems.\u201d In High-Performance Computing and Networking, pp. 102\u2013109, Springer-Verlag, May 1995. Lect. Notes Comput. Sci. vol. 919."},{"key":"4_CR8","unstructured":"S. J. Chapin, \u201cDistributed scheduling support in the presence of autonomy.\u201d In Proc. 4th Heterogeneous Computing Workshop, pp. 22\u201329, Apr 1995. Santa Barbara, CA."},{"issue":"4","key":"4_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1155\/1994\/326352","volume":"3","author":"S. J. Chapin","year":"1994","unstructured":"S. J. Chapin and E. H. Spafford, \u201cSupport for implementing scheduling algorithms using MESSIAHS.\u201d Scientiffc Programming 3 (4), pp. 325\u2013340, Winter 1994.","journal-title":"Scientiffc Programming"},{"key":"4_CR10","unstructured":"W. Cirne and F. Berman, \u201cS3: a metacomputing-friendly parallel scheduler.\u201d Manuscript, UCSD, In preparation."},{"key":"4_CR11","unstructured":"W. Cirne and K. Marzullo, \u201cThe computational co-op: gathering clusters into a metacomputer.\u201d In Second Merged Symposium IPPS\/SPDP 1999, 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing, pp. 160\u2013166, April 1999."},{"key":"4_CR12","unstructured":"D. E. Culler, J. P. Singh, and A. Gupta, Parallel Computer Architecture: A Hardware\/Software Approach. Morgan Kaufmann, 1999."},{"key":"4_CR13","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"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"A. B. Downey, \u201cPredicting queue times on space-sharing parallel computers.\u201d In 11th Intl. Parallel Processing Symp., pp. 209\u2013218, Apr 1997.","DOI":"10.1109\/IPPS.1997.580894"},{"key":"4_CR15","series-title":"Lect Notes Comput Sci","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":"A. B. Downey, \u201cUsing queue time predictions for processor allocation.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 35\u201357, Springer-Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291."},{"issue":"4","key":"4_CR16","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 Perf. Eval. Rev. 26 (4), pp. 14\u201329, Mar 1999.","journal-title":"Perf. Eval. Rev."},{"key":"4_CR17","series-title":"Lect Notes Comput Sci","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":"D. G. Feitelson, \u201cMemory usage in the LANL CM-5 workload.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 78\u201394, Springer-Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291."},{"key":"4_CR18","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. 1162."},{"key":"4_CR19","unstructured":"D. G. Feitelson, \u201cParallel workloads archive.\u201d http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/ ."},{"key":"4_CR20","unstructured":"D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct 1994."},{"key":"4_CR21","series-title":"Lect Notes Comput Sci","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":"D. G. Feitelson and B. Nitzberg, \u201cJob characteristics of a production parallel scientific workload on the NASA Ames iPSC\/860.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 337\u2013360, Springer-Verlag, 1995. Lect. Notes Comput. Sci. vol. 949."},{"issue":"5","key":"4_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/2.53356","volume":"23","author":"D. G. Feitelson","year":"1990","unstructured":"D. G. Feitelson and L. Rudolph, \u201cDistributed hierarchical control for parallel processing.\u201d Computer 23 (5), pp. 65\u201377, May 1990.","journal-title":"Computer"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0743-7315(92)90014-E","volume":"16","author":"D. G. Feitelson","year":"1992","unstructured":"D. G. Feitelson and L. Rudolph, \u201cGang scheduling performance benefits for finegrain synchronization\u210d. J. Parallel & Distributed Comput. 16 (4), pp. 306\u2013318, Dec 1992.","journal-title":"J. Parallel & Distributed Comput"},{"key":"4_CR24","series-title":"Lect Notes Comput Sci","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":"D. G. Feitelson and L. Rudolph, \u201cMetrics and benchmarking for parallel job scheduling\u210d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1\u201324, Springer-Verlag, 1998. Lect. Notes Comput. Sci. vol. 1459."},{"key":"4_CR25","series-title":"Lect Notes Comput Sci","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":"D. G. Feitelson and L. Rudolph, \u201cToward convergence in job schedulers for parallel supercomputers\u210d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1\u201326, Springer-Verlag, 1996. Lect. Notes Comput. Sci. vol. 1162."},{"issue":"4","key":"4_CR26","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/C-M.1972.216939","volume":"5","author":"D. Ferrari","year":"1972","unstructured":"D. Ferrari, \u201cWorkload characterization and selection in computer performance measurement.\u201d Computer 5 (4), pp. 18\u201324, Jul\/Aug 1972.","journal-title":"Computer"},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1177\/109434209701100205","volume":"11","author":"I. Foster","year":"1997","unstructured":"I. Foster and C. Kesselman, \u201cGlobus: a metacomputing infrastructure toolkit.\u201d International Journal of Supercomputing Applications 11 (2), pp. 115\u2013128, 1997.","journal-title":"International Journal of Supercomputing Applications"},{"key":"4_CR28","unstructured":"I. Foster and C. Kesselman (eds.), The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1999."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt, and A. Roy, \u201cA distributed resource management architecture that supports advance reservations and co-allocation.\u201d In International Workshop on Quality of Service, 1999.","DOI":"10.1109\/IWQOS.1999.766475"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"H. Franke, P. Pattnaik, and L. Rudolph, \u201cGang scheduling for highly efficient distributed multiprocessor systems.\u201d In 6th Symp. Frontiers Massively Parallel Comput., pp. 1\u20139, Oct 1996.","DOI":"10.1109\/FMPC.1996.558056"},{"key":"4_CR31","series-title":"Lect Notes Comput Sci","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"G. Ghare","year":"1999","unstructured":"G. Ghare and S. T. Leutenegger, \u201cThe effect of correlating quantum allocation and job size for gang scheduling.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1999. Lect. Notes Comput. Sci. vol. 1659."},{"key":"4_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-63574-2_16","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"R. Gibbons","year":"1997","unstructured":"R. Gibbons, \u201cA historical application profiler for use by parallel schedulers.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 58\u201377, Springer-Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291."},{"issue":"3","key":"4_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/jpdc.1994.1058","volume":"21","author":"A. S. Grimshaw","year":"1994","unstructured":"A. S. Grimshaw, J. B. Weissman, E. A. West, and E. C. Loyot, Jr., \u201cMetasystems: an approach combining parallel processing and heterogeneous distributed computing systems.\u201d J. Parallel & Distributed Comput. 21 (3), pp. 257\u2013270, Jun 1994.","journal-title":"J. Parallel & Distributed Comput."},{"issue":"1","key":"4_CR34","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/242857.242867","volume":"40","author":"A. S. Grimshaw","year":"1997","unstructured":"A. S. Grimshaw, W. A. Wulf, and the Legion team, \u201cThe Legion vision of a worldwide virtual computer.\u201d Comm. ACM 40 (1), pp. 39\u201345, Jan 1997.","journal-title":"Comm. ACM"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"A. Gupta, A. Tucker, and S. Urushibara, \u201cThe impact of operating system scheduling policies and synchronization methods on the performance of parallel applications.\u201d In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 120\u2013132, May 1991.","DOI":"10.1145\/107971.107985"},{"issue":"1","key":"4_CR36","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/71.113085","volume":"3","author":"M. A. Holliday","year":"1992","unstructured":"M. A. Holliday and C. S. Ellis, \u201cAccuracy of memory reference traces of parallel computations in trace-driven simulation.\u201d IEEE Trans. Parallel & Distributed Syst. 3 (1), pp. 97\u2013109, Jan 1992.","journal-title":"IEEE Trans. Parallel & Distributed Syst."},{"key":"4_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BFb0022285","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"S. Hotovy","year":"1996","unstructured":"S. Hotovy, \u201cWorkload evolution on the Cornell Theory Center IBM SP2.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 27\u201340, Springer-Verlag, 1996. Lect. Notes Comput. Sci. vol. 1162."},{"key":"4_CR38","unstructured":"R. Jain, The Art of Computer Systems Performance Analysis. John Wiley & Sons, 1991."},{"key":"4_CR39","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."},{"issue":"6","key":"4_CR40","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1109\/12.286300","volume":"43","author":"R. E. Kessler","year":"1994","unstructured":"R. E. Kessler, M. D. Hill, and D. A. Wood, \u201cA comparison of trace-sampling techniques for multi-megabyte caches.\u201d IEEE Trans. Comput. 43 (6), pp. 664\u2013675, Jun 1994.","journal-title":"IEEE Trans. Comput."},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"E. J. Koldinger, S. J. Eggers, and H. M. Levy, \u201cOn the validity of trace-driven simulation for multiprocessors.\u201d In 18th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 244\u2013253, May 1991.","DOI":"10.1145\/115952.115977"},{"key":"4_CR42","series-title":"Lect Notes Comput Sci","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J. Krallmann","year":"1999","unstructured":"J. Krallmann, U. Schwiegelshohn, and R. Yahyapour, \u201cOn the design and evaluation of job scheduling systems.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1999. Lect. Notes Comput. Sci. vol. 1659."},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"M. Krunz and S. K. Tripathi, \u201cOn the characterization of VBR MPEG streams.\u201d In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 192\u2013202, Jun 1997.","DOI":"10.1145\/258612.258688"},{"key":"4_CR44","series-title":"Lect Notes Comput Sci","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":"W. Lee, M. Frank, V. Lee, K. Mackenzie, and L. Rudolph, \u201cImplications of I\/O for gang scheduled workloads.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 215\u2013237, Springer-Verlag, 1997. Lect. Notes Comput. Sci. vol. 1291."},{"issue":"1","key":"4_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/90.282603","volume":"2","author":"W. E. Leland","year":"1994","unstructured":"W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, \u201cOn the self-similar nature of Ethernet traffic.\u201d IEEE\/ACM Trans. Networking 2 (1), pp. 1\u201315, Feb 1994.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"-M. J. Litzkow, M. Livny, and M. W. Mutka, \u201cCondor-a hunter of idle workstations.\u201d In 8th Intl. Conf. Distributed Comput. Syst., pp. 104\u2013111, Jun 1988.","DOI":"10.1109\/DCS.1988.12507"},{"key":"4_CR47","unstructured":"U. Lublin, A Workload Model for Parallel Computer Systems. Master\u2019s thesis, Hebrew University, 1999. (In Hebrew)."},{"issue":"10","key":"4_CR48","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/71.539739","volume":"7","author":"N. Nieuwejaar","year":"1996","unstructured":"N. Nieuwejaar, D. Kotz, A. Purakayastha, C. S. Ellis, and M. L. Best, \u201cFile-access characteristics of parallel scientific workloads.\u201d IEEE Trans. Parallel & Distributed Syst. 7 (10), pp. 1075\u20131089, Oct 1996.","journal-title":"IEEE Trans. Parallel & Distributed Syst."},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"J. K. Ousterhout, H. Da Costa, D. Harrison, J. A. Kunze, M. Kupfer, and J. G. Thompson, \u201cA trace-driven analysis of the UNIX 4.2 BSD file system.\u201d In 10th Symp. Operating Systems Principles, pp. 15\u201324, Dec 1985.","DOI":"10.1145\/323647.323631"},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"E.W. Parsons and K. C. Sevcik, \u201cCoordinated allocation of memory and processors in multiprocessors.\u201d In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 57\u201367, May 1996.","DOI":"10.1145\/233013.233023"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"V. G. J. Peris, M. S. Squillante, and V. K. Naik, \u201cAnalysis of the impact of memory in distributed parallel processing systems.\u201d In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 5\u201318, May 1994.","DOI":"10.1145\/183018.183021"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"A. Polze, M. Werner, and G. Fohler, \u201cPredictable network computing.\u201d In 17th Intl. Conf. Distributed Comput. Syst., pp. 423\u2013431, May 1997.","DOI":"10.1109\/ICDCS.1997.598076"},{"key":"4_CR53","doi-asserted-by":"crossref","unstructured":"E. Rosti, G. Serazzi, E. Smirni, and M. S. Squillante, \u201cThe impact of I\/O on program behavior and parallel scheduling.\u201d In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 56\u201365, Jun 1998.","DOI":"10.1145\/277851.277873"},{"key":"4_CR54","doi-asserted-by":"crossref","unstructured":"U. Schwiegelshohn and R. Yahyapour, \u201cResource allocation and scheduling in metasystems.\u201d In Proc. Distributed Computing & Metacomputing Workshop at HPCN Europe, P. Sloot, M. Bibak, A. Hoekstra, and B. Hertzberger (eds.), pp. 851\u2013860, Springer-Verlag, Apr 1999. Lect. Notes in Comput. Sci. vol. 1593.","DOI":"10.1007\/BFb0100645"},{"issue":"2-3","key":"4_CR55","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0166-5316(94)90036-1","volume":"19","author":"K. C. Sevcik","year":"1994","unstructured":"K. C. Sevcik, \u201cApplication scheduling and processor allocation in multiprogrammed parallel processing systems.\u201d Performance Evaluation 19 (2-3, pp. 107\u2013140, Mar 1994.","journal-title":"Performance Evaluation"},{"key":"4_CR56","doi-asserted-by":"crossref","unstructured":"R. L. Sites and A. Agarwal, \u201cMultiprocessor cache analysis using ATUM.\u201d In 15th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 186\u2013195, 1988.","DOI":"10.1109\/ISCA.1988.5228"},{"key":"4_CR57","series-title":"Lect Notes Comput Sci","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Smith","year":"1999","unstructured":"W. Smith, V. Taylor, and I. Foster, \u201cUsing run-time predictions to estimate queue wait times and improve scheduler performance.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1999. Lect. Notes Comput. Sci. vol. 1659."},{"key":"4_CR58","series-title":"Lect Notes Comput Sci","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Talby","year":"1999","unstructured":"D. Talby, D. G. Feitelson, and A. Raveh, \u201cComparing logs and models of parallel workloads using the co-plot method.\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1999. Lect. Notes Comput. Sci."},{"issue":"4","key":"4_CR59","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/12.135552","volume":"41","author":"D. Thi\u00e9baut","year":"1993","unstructured":"D. Thi\u00e9baut;, J. L. Wolf, and H. S. Stone, \u201cSynthetic traces for trace-driven simulation of cache memories.\u201dIEEE Trans. Comput. 41(4), pp. 388\u2013410, Apr 1992.(Corrected in IEEE Trans. Comput. 42 (5) p. 635, May 1993.","journal-title":"IEEE Trans. Comput."},{"key":"4_CR60","doi-asserted-by":"crossref","unstructured":"K. Windisch, V. Lo, R. Moore, D. Feitelson, and B. Nitzberg, \u201cA comparison of workload traces from two production parallel machines.\u201d In 6th Symp. Frontiers Massively Parallel Comput., pp. 319\u2013326, Oct 1996.","DOI":"10.1109\/FMPC.1996.558107"},{"key":"4_CR61","doi-asserted-by":"crossref","unstructured":"R. Wolski, N. T. Spring, and J. Hayes, \u201cThe network weather service: a distributed resource performance forecasting service for metacomputing.\u201d Journal of Future Generation Computing Systems, 1999.","DOI":"10.1016\/S0167-739X(99)00025-4"},{"key":"4_CR62","doi-asserted-by":"crossref","unstructured":"S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta, \u201cThe SPLASH-2 programs: characterization and methodological considerations.\u201d In 22nd Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 24\u201336, Jun 1995.","DOI":"10.1145\/223982.223990"}],"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-47954-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:06:19Z","timestamp":1556895979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47954-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666769","9783540479543"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/3-540-47954-6_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}