{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T01:23:19Z","timestamp":1776993799081,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3473521","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:39:57Z","timestamp":1633459197000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["PREP: Predicting Job Runtime with Job Running Path on Supercomputers"],"prefix":"10.1145","author":[{"given":"Longfang","family":"Zhou","sequence":"first","affiliation":[{"name":"Southwest University of Science and Technology, China"}]},{"given":"Xiaorong","family":"Zhang","sequence":"additional","affiliation":[{"name":"South West University of Science and Technology, China"}]},{"given":"Wenxiang","family":"Yang","sequence":"additional","affiliation":[{"name":"China Aerodynamics Research and Development Center, China"}]},{"given":"Yongguo","family":"Han","sequence":"additional","affiliation":[{"name":"Southwest University of Science and Technology, China"}]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[{"name":"China Aerodynamics Research and Development Center, China"}]},{"given":"Yadong","family":"Wu","sequence":"additional","affiliation":[{"name":"Sichuan University of Science and Engineering, China"}]},{"given":"Jie","family":"Yu","sequence":"additional","affiliation":[{"name":"China Aerodynamics Research and Development Center, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2021. Levenshtein Distance. https:\/\/en.wikipedia.org\/wiki\/Levenshtein_distance.  2021. Levenshtein Distance. https:\/\/en.wikipedia.org\/wiki\/Levenshtein_distance."},{"key":"e_1_3_2_1_2_1","unstructured":"2021. Pearson correlation coefficient. https:\/\/en.wikipedia.org\/wiki\/Pearson_correlation_coefficient.  2021. Pearson correlation coefficient. https:\/\/en.wikipedia.org\/wiki\/Pearson_correlation_coefficient."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.492.0425"},{"key":"e_1_3_2_1_4_1","volume-title":"Job Scheduling Strategies for Parallel Processing, Dror\u00a0G. Feitelson","author":"Bailey\u00a0Lee Cynthia","unstructured":"Cynthia Bailey\u00a0Lee . 2005. Are User Runtime Estimates Inherently Inaccurate? . In Job Scheduling Strategies for Parallel Processing, Dror\u00a0G. Feitelson , Larry Rudolph, and Uwe Schwiegelshohn(Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 253\u2013263. Cynthia Bailey\u00a0Lee. 2005. Are User Runtime Estimates Inherently Inaccurate?. In Job Scheduling Strategies for Parallel Processing, Dror\u00a0G. Feitelson, Larry Rudolph, and Uwe Schwiegelshohn(Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 253\u2013263."},{"key":"e_1_3_2_1_5_1","first-page":"200","article-title":"A new proposed round robin with highest response ratio next (rrhrrn) scheduling algorithm for soft real time system","volume":"37","author":"Behera HS","year":"2012","unstructured":"HS Behera and Swain. 2012 . A new proposed round robin with highest response ratio next (rrhrrn) scheduling algorithm for soft real time system . International Journal of Engineering and Advanced Technology 37 (2012), 200 \u2013 206 . HS Behera and Swain. 2012. A new proposed round robin with highest response ratio next (rrhrrn) scheduling algorithm for soft real time system. International Journal of Engineering and Advanced Technology 37 (2012), 200\u2013206.","journal-title":"International Journal of Engineering and Advanced Technology"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSNW.2013.6615513"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/WWC.2001.990753"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.08.010"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2007.01.001"},{"key":"e_1_3_2_1_10_1","volume-title":"Trade-Off Between Prediction Accuracy and Underestimation Rate in Job Runtime Estimates. In 2017 IEEE International Conference on Cluster Computing (CLUSTER). 530\u2013540","author":"Fan Y.","year":"2017","unstructured":"Y. Fan and P. Rich . 2017 . Trade-Off Between Prediction Accuracy and Underestimation Rate in Job Runtime Estimates. In 2017 IEEE International Conference on Cluster Computing (CLUSTER). 530\u2013540 . https:\/\/doi.org\/10.1109\/CLUSTER. 2017 .11 Y. Fan and P. Rich. 2017. Trade-Off Between Prediction Accuracy and Underestimation Rate in Job Runtime Estimates. In 2017 IEEE International Conference on Cluster Computing (CLUSTER). 530\u2013540. https:\/\/doi.org\/10.1109\/CLUSTER.2017.11"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. 1\u201310","author":"Gaussier E.","unstructured":"E. Gaussier and D. Glesser . 2015. Improving backfilling by using machine learning to predict running times. In SC \u201915 : Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. 1\u201310 . https:\/\/doi.org\/10.1145\/2807591.2807646 E. Gaussier and D. Glesser. 2015. Improving backfilling by using machine learning to predict running times. In SC \u201915: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. 1\u201310. https:\/\/doi.org\/10.1145\/2807591.2807646"},{"key":"e_1_3_2_1_12_1","unstructured":"Wu Guibao and Shen Yu. 2019. Runtime Prediction of Jobs for Backfilling Optimizaion. Small microcomputer system(2019).  Wu Guibao and Shen Yu. 2019. Runtime Prediction of Jobs for Backfilling Optimizaion. Small microcomputer system(2019)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/WISE.2003.1254471"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.18"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2009.77"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11508380_24"},{"key":"e_1_3_2_1_18_1","first-page":"124","article-title":"Comparision analysis of CPU scheduling: FCFS, SJF and Round Robin","volume":"4","author":"Putera\u00a0Utama Siahaan Andysah","year":"2016","unstructured":"Andysah Putera\u00a0Utama Siahaan . 2016 . Comparision analysis of CPU scheduling: FCFS, SJF and Round Robin . International Journal of Engineering Development and Research 4 , 3(2016), 124 \u2013 132 . Andysah Putera\u00a0Utama Siahaan. 2016. Comparision analysis of CPU scheduling: FCFS, SJF and Round Robin. International Journal of Engineering Development and Research 4, 3(2016), 124\u2013132.","journal-title":"International Journal of Engineering Development and Research"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47954-6_11"},{"key":"e_1_3_2_1_20_1","volume-title":"Job Scheduling Strategies for Parallel Processing, Dror\u00a0G. Feitelson","author":"Srinivasan Srividya","unstructured":"Srividya Srinivasan . 2002. Selective Reservation Strategies for Backfill Job Scheduling . In Job Scheduling Strategies for Parallel Processing, Dror\u00a0G. Feitelson , Larry Rudolph, and Uwe Schwiegelshohn(Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 55\u201371. Srividya Srinivasan. 2002. Selective Reservation Strategies for Backfill Job Scheduling. In Job Scheduling Strategies for Parallel Processing, Dror\u00a0G. Feitelson, Larry Rudolph, and Uwe Schwiegelshohn(Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 55\u201371."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICoIA.2013.6650262"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70606"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3005572"}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","location":"Lemont IL USA","acronym":"ICPP 2021"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3473521","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3473521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:23Z","timestamp":1750191443000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3473521"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":22,"alternative-id":["10.1145\/3472456.3473521","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3473521","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}