{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:03:35Z","timestamp":1730225015016,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1109\/hipc.2009.5433217","type":"proceedings-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T14:33:20Z","timestamp":1269441200000},"page":"129-139","source":"Crossref","is-referenced-by-count":0,"title":["A framework for routing and resource allocation in network virtualization"],"prefix":"10.1109","author":[{"given":"Ashild Gronstad","family":"Solheim","sequence":"first","affiliation":[]},{"given":"Olav","family":"Lysne","sequence":"additional","affiliation":[]},{"given":"Tor","family":"Skeie","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Sodring","sequence":"additional","affiliation":[]},{"given":"Sven-Arne","family":"Reinemo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676939"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1303307"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/71.598346"},{"key":"ref12","first-page":"120","article-title":"Minimizing message passing contention in fragmentation free processor allocation","author":"mache","year":"1997","journal-title":"International Conference on Parallel and Distributed Computing Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.12"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2002.1040897"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2004.1316144"},{"journal-title":"TOP 500 Supercomputer Sites","year":"2008","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-7315(91)90032-5","article-title":"A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system","volume":"12","author":"li","year":"1991","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1991.148674"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/71.615439"},{"journal-title":"Design realization and evaluation of a component-based compositional software architecture for network simulation","year":"2002","author":"tyan","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2008.391"},{"key":"ref27","article-title":"Autonet: A high-speed, self-configuring local area network using point-to-point links","volume":"59","author":"schroeder","year":"1990","journal-title":"SRC Research"},{"journal-title":"Amazon Elastic Compute Cloud","year":"0","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.39"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BFb0053979","article-title":"A comparative study of real workload traces and synthetic workload models for parallel job scheduling","author":"lo","year":"1998","journal-title":"Workshop Job Scheduling Strategies Parallel Process"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/71.914767"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1189585"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1197130"},{"journal-title":"SunTM Grid Compute Utility - Reference guide","year":"2006","author":"microsystems","key":"ref2"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0743-7315(92)90016-G","article-title":"Efficient processor allocation strategies for mesh-connected parallel computers","volume":"16","author":"zhu","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"journal-title":"Interconnection Networks An Engineering Approach","year":"2003","author":"duato","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/71.770192"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/71.852400"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/12.980016"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/71.663881","article-title":"On submesh allocation for mesh multicomputers: A best-fit allocation and a virtual submesh allocation for faulty meshes","volume":"9","author":"kim","year":"1998","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"ref23","first-page":"164","article-title":"Contiguous and noncontiguous processor allocation algorithms for k-ary n-cubes","volume":"2","author":"windisch","year":"1995","journal-title":"International Conference on Parallel Processing (ICPP'95)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77220-0_46"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.2172\/918344","article-title":"Algorithmic support for commodity-based parallel computing systems","author":"leung","year":"2003"}],"event":{"name":"2009 16th International Conference on High Performance Computing (HiPC)","start":{"date-parts":[[2009,12,16]]},"location":"Kochi","end":{"date-parts":[[2009,12,19]]}},"container-title":["2009 International Conference on High Performance Computing (HiPC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5426440\/5433175\/05433217.pdf?arnumber=5433217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T06:14:57Z","timestamp":1580624097000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5433217\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/hipc.2009.5433217","relation":{},"subject":[],"published":{"date-parts":[[2009,12]]}}}