{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:54:16Z","timestamp":1742986456449,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030882235"},{"type":"electronic","value":"9783030882242"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88224-2_2","type":"book-chapter","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:38:17Z","timestamp":1633459097000},"page":"35-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Collection of Job Scheduling Prediction Methods"],"prefix":"10.1007","author":[{"given":"Mehmet","family":"Soysal","sequence":"first","affiliation":[]},{"given":"Achim","family":"Streit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,6]]},"reference":[{"key":"2_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":"2_CR2","doi-asserted-by":"crossref","unstructured":"Soysal, M., Berghoff, M., Klus\u00e1\u010dek, D., Streit, A.: On the quality of wall time estimates for resource allocation prediction. In: Proceedings of the 48th International Conference on Parallel Processing: Workshops, ICPP 2019, Kyoto, Japan, pp. 23:1\u201323:8. ACM, New York (2019)","DOI":"10.1145\/3339186.3339204"},{"key":"2_CR3","unstructured":"Xsede. https:\/\/www.xsede.org\/"},{"key":"2_CR4","unstructured":"Karnak start\/wait time predictions. http:\/\/karnak.xsede.org\/karnak\/index.html"},{"issue":"10","key":"2_CR5","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":"2_CR6","unstructured":"Parallel workloads archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-10632-4_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M Soysal","year":"2019","unstructured":"Soysal, M., Berghoff, M., Streit, A.: Analysis of job metadata for enhanced wall time prediction. In: Klus\u00e1\u010dek, D., Cirne, W., Desai, N. (eds.) JSSPP 2018. LNCS, vol. 11332, pp. 1\u201314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10632-4_1"},{"key":"2_CR8","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":"2_CR9","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":"2_CR10","doi-asserted-by":"crossref","unstructured":"Downey, A.B.: Predicting queue times on space-sharing parallel computers. In: Proceedings of the 11th International Parallel Processing Symposium 1997, pp. 209\u2013218. IEEE (1997)","DOI":"10.1109\/IPPS.1997.580894"},{"key":"2_CR11","unstructured":"Klus\u00e1\u010dek, D., T\u00f3th, \u0160., Podoln\u00edkov\u00e1, G.: Complex job scheduling simulations with Alea 4. In: Ninth EAI International Conference on Simulation Tools and Techniques (SimuTools 2016), pp. 124\u2013129. ACM (2016)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kapadia, N.H., Fortes, J.A.B.: 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 1998, pp. 71\u201380. IEEE (1998)","DOI":"10.1109\/HPDC.1998.709958"},{"issue":"6","key":"2_CR13","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":"2_CR14","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":"2_CR15","doi-asserted-by":"crossref","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) (2007)","DOI":"10.1109\/TPDS.2007.70606"},{"key":"2_CR16","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"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Lee, B.-D., et al.: Run-time prediction of parallel applications on shared environments. In: 2003 Proceedings IEEE International Conference on Cluster Computing, pp. 487\u2013491. IEEE (2003)","DOI":"10.1109\/CLUSTR.2003.1253355"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.future.2010.09.004","volume":"27","author":"S Seneviratne","year":"2011","unstructured":"Seneviratne, S., Levy, D.C.: Task profiling model for load profile prediction. Future Gener. Comput. Syst. 27(3), 245\u2013255 (2011)","journal-title":"Future Gener. Comput. Syst."},{"key":"2_CR19","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: Proceedings of the Eighth International Symposium on High Performance Distributed Computing (Cat. No. 99TH8469), pp. 47\u201354. IEEE (1999)","DOI":"10.1109\/HPDC.1999.805281"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Iverson, M.A., Ozguner, F., Potter, L.C.: Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment. In: Proceedings of the Eighth Heterogeneous Computing Workshop (HCW 1999), pp. 99\u2013111. IEEE (1999)","DOI":"10.1109\/HCW.1999.765115"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Miu, T., Missier, P.: Predicting the execution time of workflow activities based on their input features. In: 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, pp. 64\u201372. IEEE (2012)","DOI":"10.1109\/SC.Companion.2012.21"},{"key":"2_CR22","unstructured":"Li, H., Groep, D., Wolters, L.: An evaluation of learning and heuristic techniques for application run time predictions. In: Proceedings of 11th Annual Conference of the Advance School for Computing and Imaging (ASCI), Netherlands. Citeseer (2005)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Silva, R.F.D., Juve, G., Rynge, M., Deelman, E., Livny, M.: Online task resource consumption prediction for scientific workflows. Parallel Process. Lett. 25(03), 1541003 (2015)","DOI":"10.1142\/S0129626415410030"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Matsunaga, A., Fortes, J.A.B.: 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"},{"issue":"3","key":"2_CR25","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"issue":"9","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1093\/bioinformatics\/btu033","volume":"30","author":"A Stamatakis","year":"2014","unstructured":"Stamatakis, A.: RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics 30(9), 1312\u20131313 (2014)","journal-title":"Bioinformatics"},{"key":"2_CR27","unstructured":"The Standard Workload Format"},{"key":"2_CR28","unstructured":"The University of Luxemburg Gaia Cluster Log. https:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/l_unilu_gaia\/index.html"},{"key":"2_CR29","unstructured":"Scikit - Mean absolute error. http:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.metrics.mean_absolute_error.html#sklearn.metrics.mean_absolute_error"},{"key":"2_CR30","unstructured":"Scikit - Median absolute error. http:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.metrics.median_absolute_error.html#sklearn.metrics.median_absolute_error"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.neucom.2015.12.114","volume":"192","author":"A de Myttenaere","year":"2016","unstructured":"de Myttenaere, A., Golden, B., Le Grand, B., Rossi, F.: Mean absolute percentage error for regression models. Neurocomputing 192, 38\u201348 (2016)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88224-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:17:02Z","timestamp":1725877022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88224-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030882235","9783030882242"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88224-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 October 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - 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 (provided by the conference organizers)"}},{"value":"3,4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}