{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T05:27:02Z","timestamp":1770960422099,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319157887","type":"print"},{"value":"9783319157894","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15789-4_7","type":"book-chapter","created":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T10:25:31Z","timestamp":1423823131000},"page":"108-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Prediction of Queue Waiting Times for Metascheduling on Parallel Batch Systems"],"prefix":"10.1007","author":[{"given":"Rajath","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Sathish","family":"Vadhiyar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"key":"7_CR1","unstructured":"IBM Load Leveler. http:\/\/www.redbooks.ibm.com\/abstracts\/sg246038.html"},{"key":"7_CR2","unstructured":"PBS Works. http:\/\/www.pbsworks.com"},{"key":"7_CR3","unstructured":"Tera Grid Karnak Prediction Service. http:\/\/karnak.teragrid.org\/karnak\/index.html"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-35867-8_11","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"R Kumar","year":"2013","unstructured":"Kumar, R., Vadhiyar, S.: Identifying quick starters: towards an integrated framework for efficient predictions of queue waiting times of batch parallel jobs. In: Cirne, W., Desai, N., Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2012. LNCS, vol. 7698, pp. 196\u2013215. Springer, Heidelberg (2013)"},{"key":"7_CR5","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)"},{"key":"7_CR6","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)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11407522_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"2005","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U.: Parallel job scheduling - a status report. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"7_CR8","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. 4942, pp. 76\u2013101. Springer, Heidelberg (2008)"},{"key":"7_CR9","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":"7_CR10","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":"7_CR11","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":"7_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10723-007-9068-6","volume":"5","author":"H Casanova","year":"2007","unstructured":"Casanova, H.: Benefits and drawbacks of redundant batch requests. J. Grid Comput. 5, 235\u2013250 (2007)","journal-title":"J. Grid Comput."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Subramani, V., Kettimuthu, R., Srinivasan, S., Sadayappan, P.: Distributed job scheduling on computational grids using multiple simultaneous requests. In: Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, pp. 359\u2013366 (2002)","DOI":"10.1109\/HPDC.2002.1029936"},{"key":"7_CR14","unstructured":"Sabin, G., Lang, M.: Moldable parallel job schedulingusing jobefficiency: an iterative approach. In: Workshop on JobScheduling Strategies for Parallel Processing (JSSPP), in conjunction withACM SIGMETRICS (2006)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.future.2006.04.009","volume":"23","author":"H Li","year":"2007","unstructured":"Li, H., Groep, D., Wolters, L.: Mining performance data for metascheduling decision support in the grid. J. Future Gener. Comput. Syst. - Special Section: Data mining in grid computing environments 23(1), 92\u201399 (2007)","journal-title":"J. Future Gener. Comput. Syst. - Special Section: Data mining in grid computing environments"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1613\/jair.346","volume":"6","author":"D Wilson","year":"1997","unstructured":"Wilson, D., Martinez, T.: Improved heterogeneous distance functions. J. Artif. Intell. Res. 6, 134 (1997)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR17","unstructured":"Machine Learning in Python. http:\/\/scikit-learn.org\/stable"},{"key":"7_CR18","unstructured":"Parallel Workload Archive. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/logs.htm"},{"key":"7_CR19","unstructured":"Standard Workload Format. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/swf.htm"},{"issue":"13","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1002\/cpe.710","volume":"14","author":"R Buyya","year":"2002","unstructured":"Buyya, R., Murshed, M.: Gridsim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. Concurrency Comput. Pract. Exp. (CCPE) 14(13), 1175\u20131220 (2002)","journal-title":"Concurrency Comput. Pract. Exp. (CCPE)"},{"key":"7_CR21","unstructured":"Redundant Batch Requests Simulator. http:\/\/sourceforge.net\/projects\/redsim"},{"key":"7_CR22","unstructured":"Parallel Workload Models. http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/models.htm"},{"issue":"11","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/S0743-7315(03)00108-4","volume":"63","author":"U Lublin","year":"2003","unstructured":"Lublin, U., Feitelson, D.G.: The workload on parallelsupercomputers: modeling the characteristics of rigid jobs. J. Parallel Distrib. Comput. 63(11), 1105\u20131122 (2003)","journal-title":"J. Parallel Distrib. Comput."}],"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-319-15789-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:22:10Z","timestamp":1747614130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15789-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319157887","9783319157894"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15789-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}