{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:10:02Z","timestamp":1748733002552,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319280332"},{"type":"electronic","value":"9783319280349"}],"license":[{"start":{"date-parts":[[2015,12,25]],"date-time":"2015-12-25T00:00:00Z","timestamp":1451001600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28034-9_9","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T08:27:04Z","timestamp":1450945624000},"page":"75-86","source":"Crossref","is-referenced-by-count":2,"title":["Storage Load Control Through Meta-Scheduler Using Predictive Analytics"],"prefix":"10.1007","author":[{"given":"Kumar","family":"Dheenadayalan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. N.","family":"Muralidhara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopalakrishnan","family":"Srinivasaraghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00453-006-0193-6","volume":"47","author":"N Avrahami","year":"2007","unstructured":"Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. Algorithmica 47(3), 253\u2013268 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"9_CR3","unstructured":"CERN: European Laboratory for Particle Physics (2014). http:\/\/home.web.cern.ch\/about\/computing . Accessed 30 September 2014"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Zhou, B.B., Wang, C., Lu, P., Wang, P., Zomaya, A.: Throughput enhancement through selective time sharing and dynamic grouping. In: 2013 IEEE 27th International Symposium on Parallel Distributed Processing (IPDPS), pp. 1183\u20131192 (2013)","DOI":"10.1109\/IPDPS.2013.34"},{"key":"9_CR5","unstructured":"Choudhury, B.R.: IBM Platform Load Sharing Facility (LSF) Integration with Netapp Storage. Technical report (2013)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Dheenadayalan, K., Muralidhara, V., Datla, P., Srinivasaraghavan, G., Shah, M.: Premonition of storage response class using skyline ranked ensemble method. In: 2014 21st International Conference on High Performance Computing (HiPC), pp. 1\u201310, December 2014","DOI":"10.1109\/HiPC.2014.7116886"},{"key":"9_CR7","volume-title":"The grid: blueprint for a new computing infrastructure","author":"I Foster","year":"1999","unstructured":"Foster, I., Kesselman, C.: The grid: blueprint for a new computing infrastructure. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"9_CR8","unstructured":"Gulati, A., Kumar, C., Ahmad, I., Kumar, K.: BASIL: Automated IO load balancing across storage devices. In: Proceedings of the 8th USENIX Conference on File and Storage Technologies, FAST 2010, p. 13. USENIX Association, Berkeley (2010)"},{"key":"9_CR9","unstructured":"Hameed, S.: Integrating lsf storage-aware plug-in with operations manager. Technical report (2011)"},{"key":"9_CR10","unstructured":"Katcher, J.: PostMark: A New File System Benchmark. Technical report (1997)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Kosar, T.: A new paradigm in data intensive computing: stork and the data-aware schedulers. In: 2006 IEEE Challenges of Large Applications in Distributed Environments, pp. 5\u201312 (2006)","DOI":"10.1109\/CLADE.2006.1652048"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-89894-8_9","volume-title":"High Performance Computing - HiPC 2008","author":"D Kunkle","year":"2008","unstructured":"Kunkle, D., Schindler, J.: A load balancing framework for clustered storage systems. In: Sadayappan, P., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2008. LNCS, vol. 5374, pp. 57\u201372. Springer, Heidelberg (2008)"},{"key":"9_CR13","unstructured":"Liang, H., Faner, M., Ming, H.: A dynamic load balancing system based on data migration. In: Proceedings of the 8th International Conference on Computer Supported Cooperative Work in Design, vol. 1, pp. 493\u2013499, May 2004"},{"issue":"3","key":"9_CR14","first-page":"18","volume":"2","author":"A Liaw","year":"2002","unstructured":"Liaw, A., Wiener, M.: Classification and regression by randomforest. R News 2(3), 18\u201322 (2002)","journal-title":"R News"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-45227-0_21","volume-title":"Database and Expert Systems Applications","author":"A Mondal","year":"2003","unstructured":"Mondal, A., Goda, K., Kitsuregawa, M.: Effective load-balancing via migration and replication in spatial grids. In: Ma\u0159\u00edk, V., \u0160t\u011bp\u00e1nkov\u00e1, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 202\u2013211. Springer, Heidelberg (2003)"},{"key":"9_CR16","unstructured":"Norcott, W., Capps, D.: IOzone file system benchmark. Technical report (2006)"},{"key":"9_CR17","unstructured":"Quintero, D., Denham, S., Garcia da Silva, R., Ortiz, A., Guedes Pinto, A., Sasaki, A., Tucker, R., Wong, J., Ramos, E.: IBM Platform Computing Solutions (IBM Redbooks). IBM Press (2012)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Thompson, S., Lipsky, L., Tasneem, S., Zhang, F.: Analysis of round-robin implementations of processor sharing, including overhead. In: Eighth IEEE International Symposium on Network Computing and Applications, NCA 2009, pp. 60\u201365 (2009)","DOI":"10.1109\/NCA.2009.57"},{"key":"9_CR19","unstructured":"Venkataraman, S., Panda, A., Ananthanarayanan, G., Franklin, M.J., Stoica, I.: The power of choice in data-aware cluster scheduling. In: Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation, OSDI 2014, pp. 301\u2013316. USENIX Association, Berkeley (2014)"},{"key":"9_CR20","unstructured":"Wei, X., Li, W.W., Tatebe, O., Xu, G., Hu, L., Ju, J.: Implementing data aware scheduling in Gfarm(r) using LSF $$^{TM}$$ scheduler plugin mechanism. In: Arabnia, H.R., Ni, J. (eds.) GCA, pp. 3\u201310. CSREA Press (2005)"},{"key":"9_CR21","unstructured":"Zhang, F., Tasneem, S., Lipsky, L., Thompson, S.: Analysis of round-robin variants: favoring newly arrived jobs. In: Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009 (2009)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28034-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T22:51:04Z","timestamp":1748731864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28034-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,25]]},"ISBN":["9783319280332","9783319280349"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28034-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,25]]}}}