{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T02:27:57Z","timestamp":1794364077786,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648253","type":"print"},{"value":"9783540685364","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053984","type":"book-chapter","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T10:59:07Z","timestamp":1152183547000},"page":"122-142","source":"Crossref","is-referenced-by-count":158,"title":["Predicting application run times using historical information"],"prefix":"10.1007","author":[{"given":"Warren","family":"Smith","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian","family":"Foster","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerie","family":"Taylor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"issue":"6","key":"7_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/129888.129890","volume":"35","author":"C. Catlett","year":"1992","unstructured":"C. Catlett and L. Smarr. Metacomputing. Communications of the ACM, 35(6):44\u201352, 1992.","journal-title":"Communications of the ACM"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"K. Czajkowski, I. Foster, C. Kesselman, S. Martin, W. Smith, and S. Tuecke. A Resource Management Architecture for Metasystems. Lecture Notes on Computer Science, 1998.","DOI":"10.1007\/BFb0053981"},{"issue":"12","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1109\/32.58769","volume":"15","author":"M. Devarakonda","year":"1989","unstructured":"Murthy Devarakonda and Ravishankar Iyer. Predictability of Process Resource Usage: A Measurement-Based Study on UNIX. IEEE Transactions on Software Engineering, 15(12):1579\u20131586, December 1989.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Allen Downey. Predicting Queue Times on Space-Sharing Parallel Computers. In International Parallel Processing Symposium, 1997.","DOI":"10.1109\/IPPS.1997.580894"},{"key":"7_CR5","unstructured":"N. R. Draper and H. Smith. Applied Regression Analysis, 2nd Edition. John Wiley and Sons, 1981."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Dror Feitelson and Bill Nitzberg. Job Characteristics of a Production Parallel Scientific Workload on the NASA Ames iPSC\/860. Lecture Nodes on Computer Science, 949, 1995.","DOI":"10.1007\/3-540-60153-8_38"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1177\/109434209701100205","volume":"11","author":"I. Foster","year":"1997","unstructured":"Ian Foster and Carl Kesselman. Globus: A Metacomputing Infrastructure Toolkit. International Journal of Supercomputing Applications, 11(2):115\u2013128, 1997.","journal-title":"International Journal of Supercomputing Applications"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Richard Gibbons. A Historical Application Profiler for Use by Parallel Scheculers. Lecture Notes on Computer Science, pages 58\u201375, 1997.","DOI":"10.1007\/3-540-63574-2_16"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Richard Gibbons. A Historical Profiler for Use by Parallel Schedulers. Master's thesis, University of Toronto, 1997.","DOI":"10.1007\/3-540-63574-2_16"},{"key":"7_CR10","unstructured":"David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989."},{"key":"7_CR11","unstructured":"Neil Weiss and Matthew Hassett. Introductory Statistics. Addison-Wesley, 1982."}],"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\/BFb0053984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T17:22:48Z","timestamp":1555694568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648253","9783540685364"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0053984","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0053977","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}