{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:19:42Z","timestamp":1745986782629,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358661"},{"type":"electronic","value":"9783642358678"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35867-8_11","type":"book-chapter","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T02:24:52Z","timestamp":1357871092000},"page":"196-215","source":"Crossref","is-referenced-by-count":8,"title":["Identifying Quick Starters: Towards an Integrated Framework for Efficient Predictions of Queue Waiting Times of Batch Parallel Jobs"],"prefix":"10.1007","author":[{"given":"Rajath","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathish","family":"Vadhiyar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"IBM Load Leveler, http:\/\/www.redbooks.ibm.com\/abstracts\/sg246038.html"},{"key":"11_CR2","unstructured":"PBS Works, http:\/\/www.pbsworks.com\/"},{"key":"11_CR3","unstructured":"Platform LSF, http:\/\/www.platform.com\/workload-management\/high-performance-computing"},{"key":"11_CR4","unstructured":"MAUI Scheduler, http:\/\/www.supercluster.org"},{"key":"11_CR5","unstructured":"Tera Grid Karnak Prediction Service, http:\/\/karnak.teragrid.org\/karnak\/index.html"},{"key":"11_CR6","unstructured":"Parallel Workload Archive, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/logs.html"},{"key":"11_CR7","unstructured":"Li, H., Groep, D.L., Wolters, L.: Efficient Response Time Predictions by Exploiting Application and Resource State Similarities. In: GRID 2005 Proceedings of the 6th IEEE\/ACM International Workshop on Grid Computing, pp. 234\u2013241 (2005)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Li, H., Chen, J., Tao, Y., Groep, D.L., Wolters, L.: Improving a Local Learning Technique for Queue Wait Time Predictions. In: CCGRID 2006 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid, pp. 335\u2013342 (2006)","DOI":"10.1109\/CCGRID.2006.57"},{"key":"11_CR9","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.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol.\u00a01459, pp. 122\u2013142. Springer, Heidelberg (1998)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Smith, W., Taylor, V.E., Foster, I.T.: Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance. In: IPPS\/SPDP 1999\/JSSPP 1999: Proceedings of the Job Scheduling Strategies for Parallel Processing, pp. 202\u2013219 (1999)","DOI":"10.1007\/3-540-47954-6_11"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U.: Parallel Job Scheduling - A Status Report. In: JSSPP 2007 Proceedings of the 13th International Conference on Job Scheduling Strategies for Parallel Processing, pp. 1\u201316 (2004)","DOI":"10.1007\/11407522_1"},{"key":"11_CR12","unstructured":"Li, H., Groep, D., Templon, J., Wolters, L.: Predicting Job Start Times on Clusters. In: CCGRID 2004: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Downey, A.B.: Predicting Queue Times on Space-Sharing Parallel Computers. In: IPPS 1997 Proceedings of the 11th International Symposium on Parallel Processing, pp. 209\u2013218 (1997)","DOI":"10.1109\/IPPS.1997.580894"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-78699-3_5","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Nurmi","year":"2008","unstructured":"Nurmi, D., Brevik, J., Wolski, R.: QBETS: Queue Bounds Estimation from Time Series. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2007. LNCS, vol.\u00a04942, pp. 76\u2013101. Springer, Heidelberg (2008)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Brevik, J., Nurmi, D., Wolski, R.: Predicting Bounds on Queuing Delay for Batch-Scheduled Parallel Machines. In: PPoPP 2006: Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 110\u2013118 (2006)","DOI":"10.1145\/1122971.1122989"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Brevik, D.N.J., Wolski, R.: Using Model-Based Clustering to Improve Predictions for Queueing Delay on Parallel Machines, pp. 21\u201346","DOI":"10.1142\/S0129626407002855"},{"key":"11_CR17","unstructured":"Standard Workload Form, http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/swf.html"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Shmueli, E., Feitelson, D.G.: Uncovering the Effect of System Performance on User Behavior from Traces of Parallel Systems. In: MASCOTS 2007 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp. 274\u2013280 (2007)","DOI":"10.1109\/MASCOTS.2007.67"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Zilber, J., Amit, O., Talby, D.: What is worth learning from Parallel Workloads?: A User and Session based Analysis. In: ICS 2005 Proceedings of the 19th Annual International Conference on Supercomputing, pp. 377\u2013386 (2005)","DOI":"10.1145\/1088149.1088200"}],"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-642-35867-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:50:56Z","timestamp":1745945456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35867-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358661","9783642358678"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35867-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}