{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T15:27:20Z","timestamp":1762010840166,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030106317"},{"type":"electronic","value":"9783030106324"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10632-4_1","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T09:33:04Z","timestamp":1547285584000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of Job Metadata for Enhanced Wall Time Prediction"],"prefix":"10.1007","author":[{"given":"Mehmet","family":"Soysal","sequence":"first","affiliation":[]},{"given":"Marco","family":"Berghoff","sequence":"additional","affiliation":[]},{"given":"Achim","family":"Streit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10968987_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M Hovestadt","year":"2003","unstructured":"Hovestadt, M., Kao, O., Keller, A., Streit, A.: Scheduling in HPC resource management systems: queuing vs. planning. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 1\u201320. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10968987_1"},{"key":"1_CR2","unstructured":"Oeste, S., Kluge, M., Soysal, M., Streit, A., Vef, M., Brinkmann, A.: Exploring opportunities for job-temporal file systems with ada-fs. In: 1st Joint International Workshop on Parallel Data Storage and Data Intensive Scalable Computing Systems (2016)"},{"key":"1_CR3","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.G., Rudolph, L. (eds.) JSSPP 1997. LNCS, vol. 1291, pp. 58\u201377. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63574-2_16"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Downey, A.B.: Predicting queue times on space-sharing parallel computers. In: 11th International Proceedings on Parallel Processing Symposium, pp. 209\u2013218. IEEE (1997)","DOI":"10.1109\/IPPS.1997.580894"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Gibbons, R.: A historical profiler for use by parallel schedulers. Master\u2019s thesis, University of Toronto (1997)","DOI":"10.1007\/3-540-63574-2_16"},{"key":"1_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.G., Rudolph, L. (eds.) JSSPP 1998. LNCS, vol. 1459, pp. 122\u2013142. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053984"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-47954-6_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"W Smith","year":"1999","unstructured":"Smith, W., Taylor, V., Foster, I.: Using run-time predictions to estimate queue wait times and improve scheduler performance. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999. LNCS, vol. 1659, pp. 202\u2013219. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-47954-6_11"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Matsunaga, A., AB Fortes, J.: On the use of machine learning to predict the time and resources consumed by applications. In: Proceedings of the 2010 10th IEEE\/ACM International Conference on Cluster, Cloud and Grid Computing, pp. 495\u2013504. IEEE Computer Society (2010)","DOI":"10.1109\/CCGRID.2010.98"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Kapadia, N.H., AB Fortes, J.: On the design of a demand-based network-computing system: the purdue university network-computing hubs. In: Proceedings of the Seventh International Symposium on High Performance Distributed Computing, pp. 71\u201380. IEEE (1998)","DOI":"10.1109\/HPDC.1998.709958"},{"issue":"6","key":"1_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"AW 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 Trans. Parallel Distrib. Syst. 12(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Nadeem, F., Fahringer, T.: Using templates to predict execution time of scientific workflow applications in the grid. In: Proceedings of the 2009 9th IEEE\/ACM International Symposium on Cluster Computing and the Grid, pp. 316\u2013323. IEEE Computer Society (2009)","DOI":"10.1109\/CCGRID.2009.77"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Smith, W.: Prediction services for distributed computing. In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2007, pp. 1\u201310. IEEE (2007)","DOI":"10.1109\/IPDPS.2007.370276"},{"issue":"6","key":"1_CR13","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 Trans. Parallel Distrib. Syst. 18(6), 789\u2013803 (2007)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR14","unstructured":"Xsede. https:\/\/www.xsede.org\/"},{"key":"1_CR15","unstructured":"Karnak start\/wait time predictions. http:\/\/karnak.xsede.org\/karnak\/index.html"},{"key":"1_CR16","volume-title":"Foundations of Machine Learning","author":"M Mohri","year":"2012","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. MIT Press, Cambridge (2012)"},{"key":"1_CR17","first-page":"2962","volume-title":"Advances in Neural Information Processing Systems","author":"M Feurer","year":"2015","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., Hutter, F.: Efficient and robust automated machine learning. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 28, pp. 2962\u20132970. Curran Associates Inc., New York (2015)"},{"key":"1_CR18","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR19","unstructured":"Buitinck, L., et al.: API design for machine learning software: experiences from the scikit-learn project. In: ECML PKDD Workshop: Languages for Data Mining and Machine Learning, pp. 108\u2013122 (2013)"},{"key":"1_CR20","unstructured":"Parallel Workloads Archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/"},{"key":"1_CR21","unstructured":"The Standard Workload Format. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/swf.html"},{"key":"1_CR22","unstructured":"Forhlr i, kit\/scc. https:\/\/www.scc.kit.edu\/dienste\/forhlr1.php"},{"key":"1_CR23","unstructured":"Forhlr ii, kit\/scc. https:\/\/www.scc.kit.edu\/dienste\/forhlr2.php"},{"issue":"10","key":"1_CR24","doi-asserted-by":"publisher","first-page":"2967","DOI":"10.1016\/j.jpdc.2014.06.013","volume":"74","author":"DG Feitelson","year":"2014","unstructured":"Feitelson, D.G., Tsafrir, D., Krakov, D.: Experience with using the parallel workloads archive. J. Parallel Distrib. Comput. 74(10), 2967\u20132982 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR25","unstructured":"scikit - regression metrics. http:\/\/scikit-learn.org\/stable\/modules\/model_evaluation.html#regression-metrics"},{"key":"1_CR26","unstructured":"scikit - r2 score. http:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.metrics.r2_score.html#sklearn.metrics.r2_score"},{"key":"1_CR27","unstructured":"scikit - mean absolute error. http:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.metrics.mean_absolute_error.html#sklearn.metrics.mean_absolute_error"},{"key":"1_CR28","unstructured":"scikit - median absolute error. http:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.metrics.median_absolute_error.html#sklearn.metrics.median_absolute_error"},{"key":"1_CR29","unstructured":"scikit - datasset spliting"},{"key":"1_CR30","unstructured":"scikit - model persistence. http:\/\/scikit-learn.org\/stable\/modules\/model_persistence.html"},{"key":"1_CR31","volume-title":"Dynamic Programming","author":"R Bellman","year":"2013","unstructured":"Bellman, R.: Dynamic Programming. Courier Corporation, North Chelmsford (2013)"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TIT.1968.1054102","volume":"14","author":"G Hughes","year":"1968","unstructured":"Hughes, G.: On the mean accuracy of statistical pattern recognizers. IEEE Trans. Inf. Theory 14(1), 55\u201363 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1_CR33","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K Pearson","year":"1901","unstructured":"Pearson, K.: LIII. on lines and planes of closest fit to systems of points in space. Lond, Edinb, Dublin Philos. Mag. J. Sci. 2(11), 559\u2013572 (1901)","journal-title":"Lond, Edinb, Dublin Philos. Mag. J. Sci."}],"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\/978-3-030-10632-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T07:31:52Z","timestamp":1573716712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-10632-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030106317","9783030106324"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10632-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JSSPP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Job Scheduling Strategies for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/jsspp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}