{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:17:23Z","timestamp":1743110243422,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207532"},{"type":"electronic","value":"9783642207549"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20754-9_2","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T08:17:41Z","timestamp":1303892261000},"page":"3-12","source":"Crossref","is-referenced-by-count":0,"title":["Job Status Prediction \u2013 Catch Them Before They Fail"],"prefix":"10.1007","author":[{"given":"Igor","family":"Grudenic","sequence":"first","affiliation":[]},{"given":"Nikola","family":"Bogunovic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"IDC HPC Market Update, http:\/\/www.hpcadvisorycouncil.com\/events\/china_workshop\/pdf\/6_IDC.pdf"},{"key":"2_CR2","unstructured":"TOP500 Supercomputing Sites, http:\/\/www.top500.org\/"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-71035-6_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"L. Barsanti","year":"2007","unstructured":"Barsanti, L., Sodan, A.: Adaptive Job Scheduling via Predictive Job Resource Allocation. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2006. LNCS, vol.\u00a04376, pp. 115\u2013140. Springer, Heidelberg (2007)"},{"key":"2_CR4","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. Bailey Lee","year":"2005","unstructured":"Bailey Lee, C., Schwartzman, Y., Hardy, J., Snavely, A.: Are user runtime estimates inherently inaccurate? In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol.\u00a03277, pp. 253\u2013263. Springer, Heidelberg (2005)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"Gibbons, R.: A Historical Application Profiler for Use by Parallel Schedulers. In: Feitelson, D., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol.\u00a01291, pp. 58\u201377. Springer, Heidelberg (1997)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053984","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W. Smith","year":"1998","unstructured":"Smith, W., Foster, I., Taylor, V.: Predicting Application Run Times Using Historical Information. In: Feitelson, D., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 122\u2013142. Springer, Heidelberg (1998)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, S., Loke, S.W., Zaslavsky, A.: Estimating computation times of data-intensive applications. IEEE Distributed Systems Online\u00a05(4) (2004)","DOI":"10.1109\/MDSO.2004.1301253"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Kapadia, N.H., Fortes, J.A.B., Brodley, C.E.: Predictive Application-Performance Modeling in a Computational Grid Environment. In: the Proceedings of the The Eighth IEEE International Symposium on High Performance Distributed Computing, pp. 47\u201354 (1999)","DOI":"10.1109\/HPDC.1999.805281"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TPDS.2007.70606","volume":"18","author":"D. Tsafrir","year":"2007","unstructured":"Tsafrir, D., Etsion, Y., Feitelson, D.G.: Backfilling Using System-Generated Predictions Rather than User Runtime Estimates. IEEE Transactions on Parallel and Distributed Systems\u00a018(6), 789\u2013803 (2007)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-60153-8_35","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.A. Lifka","year":"1995","unstructured":"Lifka, D.A.: The ANL IBM SP Scheduling System. In: Feitelson, D., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 295\u2013303. Springer, Heidelberg (1995)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Tsafrir, D., Feitelson, D.G.: The Dynamics of Backfilling: Solving the Mysteryof Why Increased Inaccuracy May Help. In: Proceedings of 2006 IEEE International Symposium on Workload Characterization, pp. 131\u2013141 (2006)","DOI":"10.1109\/IISWC.2006.302737"},{"key":"2_CR12","unstructured":"Parallel Workloads Archive, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/"},{"key":"2_CR13","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2005","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2005)"},{"key":"2_CR14","volume-title":"C4.5: Programs for machine learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for machine learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"Breiman","year":"2001","unstructured":"Breiman: Random Forests. Machine Learning\u00a045, 5\u201332 (2001)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Advances in Grid and Pervasive Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20754-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T08:30:10Z","timestamp":1741163410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20754-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207532","9783642207549"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20754-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}