{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:20:32Z","timestamp":1765887632640,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319103525"},{"type":"electronic","value":"9783319103532"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10353-2_19","type":"book-chapter","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T16:19:46Z","timestamp":1406909986000},"page":"219-230","source":"Crossref","is-referenced-by-count":6,"title":["Network Resource Control System for HPC Based on SDN"],"prefix":"10.1007","author":[{"given":"Petr","family":"Polezhaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shukhman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Ushakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Feitelson, D., Weil, A.: Utilization and predictability in scheduling the IBM SP2 with backfilling. In: Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, pp. 542\u2013546 (1998)","DOI":"10.1109\/IPPS.1998.669970"},{"key":"19_CR2","unstructured":"Kovalenko, V.N., Semyachkin, D.A.: Using BackFill in grid-systems. In: Proceedings of the International Conference on Distributing Computing and Grid-technologies in Science and Education, pp. 139\u2013144 (2004)"},{"issue":"6,211","key":"19_CR3","first-page":"79","volume":"35","author":"P.N. Polezhaev","year":"2010","unstructured":"Polezhaev, P.N.: Simulator of cluster and its management system used for research of job scheduling algorithms. Bulletin of SUSU \u2013 Mathematical Modeling and Programming\u00a035(6,211), 79\u201390 (2010)","journal-title":"Bulletin of SUSU \u2013 Mathematical Modeling and Programming"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N. McKeown","year":"2008","unstructured":"McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: Openflow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review\u00a038, 69\u201374 (2008)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"19_CR5","unstructured":"Intro to OpenFlow, https:\/\/www.opennetworking.org\/standards\/intro-to-openflow"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Chowdhury, M.: Managing data transfers in computer clusters with Orchestra. In: Proceedings of the ACM SIGCOMM 2011, pp. 98\u2013109 (2011)","DOI":"10.1145\/2018436.2018448"},{"issue":"4","key":"19_CR7","first-page":"127","volume":"42","author":"C.-Y. Hong","year":"2012","unstructured":"Hong, C.-Y., Caesar, M., Godfrey, P.B.: Finishing flows quickly with preemptive scheduling. ACM SIGCOMM Computer Communication Review, Special October Issue SIGCOMM 2012\u00a042(4), 127\u2013138 (2012)","journal-title":"ACM SIGCOMM Computer Communication Review, Special October Issue SIGCOMM 2012"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Narayan, S., Bailey, S., Daga, A.: Hadoop acceleration in an OpenFlow-based cluster. In: Proceedings of 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, pp. 535\u2013538 (2012)","DOI":"10.1109\/SC.Companion.2012.76"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Narayan, S., Bailey, S., Daga, A., et al.: Openflow enabled Hadoop over local and wide area clusters. In: Proceedings of High Performance Computing, Networking, Storage and Analysis, pp. 1625\u20131628 (2012)","DOI":"10.1109\/SC.Companion.2012.340"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Stoica, I.: Coflow: a networking abstraction for cluster applications. In: Proceedings of the 11th ACM Workshop on Hot Topics in Networks, pp. 31\u201336 (2012)","DOI":"10.1145\/2390231.2390237"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Stoica, I.: Coflow: an application layer abstraction for cluster networking. Technical report EECS-2012-184 (2012)","DOI":"10.1145\/2390231.2390237"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00453-007-9037-2","volume":"50","author":"M.A. Bender","year":"2008","unstructured":"Bender, M.A., Bunde, D.P., Fekete, S.P., Leung, V.J., Meijer, H., Phillips, C.A.: Communication-aware processor allocation for supercomputers: finding point sets of small average distance. Algorithmica\u00a050(2), 279\u2013298 (2008)","journal-title":"Algorithmica"},{"key":"19_CR13","unstructured":"Mache, J., Lo, V., Windisch, K.: Minimizing message-passing contention in fragmentation-free processor allocation (2012), http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.55.390&rep=rep1&type=pdf"},{"key":"19_CR14","unstructured":"NOX-Classic wiki, https:\/\/github.com\/noxrepo\/nox-classic\/wiki"},{"key":"19_CR15","unstructured":"Cbench - Scalable Cluster Benchmarking and Testing, http:\/\/sourceforge.net\/apps\/trac\/cbench\/"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Aida, K., Kasahara, H., Narita, S.: Job Scheduling Scheme for Pure Space Sharing among Rigid Jobs. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1998. LNCS, vol.\u00a01459, pp. 98\u2013121. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0053983"},{"key":"19_CR17","unstructured":"Feitelson, G.: Workload Modeling for Computer Systems Performance Evaluation. Workload modeling book draft, Ver. 0.37, 508 p. (2012)"},{"issue":"11","key":"19_CR18","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/S0743-7315(03)00108-4","volume":"63","author":"U. Lublin","year":"2003","unstructured":"Lublin, U., Feitelson, G.: The workload on parallel supercomputers: modeling the characteristics of rigid job. Journal of Parallel and Distributed Computing\u00a063(11), 542\u2013546 (2003)","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10353-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T01:37:23Z","timestamp":1746322643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10353-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319103525","9783319103532"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10353-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}