{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T05:54:02Z","timestamp":1737870842164,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772194"},{"type":"electronic","value":"9783540772200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77220-0_46","type":"book-chapter","created":{"date-parts":[[2008,1,21]],"date-time":"2008-01-21T20:07:56Z","timestamp":1200946076000},"page":"500-513","source":"Crossref","is-referenced-by-count":8,"title":["Routing-Contained Virtualization Based on Up*\/Down* Forwarding"],"prefix":"10.1007","author":[{"given":"\u00c5shild Gr\u00f8nstad","family":"Solheim","sequence":"first","affiliation":[]},{"given":"Olav","family":"Lysne","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"S\u00f8dring","sequence":"additional","affiliation":[]},{"given":"Tor","family":"Skeie","sequence":"additional","affiliation":[]},{"given":"Jakob Aleksander","family":"Libak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Bulh\u00f5es, P.T., et\u00a0al.: N1 grid engine 6 features and capabilities. Sun Microsystems White Paper (2004)"},{"key":"46_CR2","unstructured":"HP. Adaptive enterprise: Business and IT synchronized to capitalize on change. HP White Paper (2005)"},{"key":"46_CR3","unstructured":"IBM. Unleash the power of e-business on demand. IBM White Paper (2003)"},{"key":"46_CR4","unstructured":"Sun Microsystems. Sun grid compute utility - reference guide. Part No. 819-5131-10 (2006)"},{"key":"46_CR5","unstructured":"Amazon Elastic\u00a0Compute Cloud, amazon.com\/gp\/browse.html?node=,201590011"},{"key":"46_CR6","volume-title":"Interconnection Networks: An Engineering Approach","author":"J. Duato","year":"2003","unstructured":"Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann, San Francisco (2003)"},{"key":"46_CR7","unstructured":"Lysne, O., et\u00a0al.: The interconnection network - architectural challenges for Utility Computing Data Centres. Computer (December 2006) (submitted)"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Subramani, V., et al.: Selective buddy allocation for scheduling parallel jobs on clusters. In: 4th IEEE Int\u2019l. Conf. Cluster Comp., pp. 107\u2013116 (2002)","DOI":"10.1109\/CLUSTR.2002.1137735"},{"issue":"3","key":"46_CR9","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1109\/71.914767","volume":"12","author":"H.-L. Chen","year":"2001","unstructured":"Chen, H.-L., Hu, S.-H.: Submesh determination in faulty tori and meshes. IEEE Trans. Par. and Dist. Syst.\u00a012(3), 272\u2013282 (2001)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Ding, J., Bhuyan, L.N.: An adaptive submesh allocation strategy for two dimensional mesh connected systems. In: Int\u2019l. Conf. Par. Proc., p. 193 (1993)","DOI":"10.1109\/ICPP.1993.39"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, V., Jayendran, A.: A flexible processor allocation strategy for mesh connected parallel systems. In: Int\u2019l. Conf. Par. Proc., p. 166 (1996)","DOI":"10.1109\/ICPP.1996.538572"},{"issue":"5","key":"46_CR12","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TC.2003.1197130","volume":"52","author":"M. Kang","year":"2003","unstructured":"Kang, M., et al.: Isomorphic strategy for processor allocation in k-ary n-cube systems. IEEE Trans. Comp.\u00a052(5), 645\u2013657 (2003)","journal-title":"IEEE Trans. Comp."},{"issue":"2","key":"46_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/71.663881","volume":"9","author":"G. Kim","year":"1998","unstructured":"Kim, G., Yoon, H.: On submesh allocation for mesh multicomputers: A best-fit allocation and a virtual submesh allocation for faulty meshes. IEEE Trans. Par. and Dist. Syst.\u00a09(2), 175\u2013185 (1998)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"issue":"3","key":"46_CR14","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TPDS.2003.1189585","volume":"14","author":"F. Wu","year":"2003","unstructured":"Wu, F., Hsu, C.-C., Chou, L.-P.: Processor allocation in the mesh multiprocessors using the Leapfrog method. IEEE Trans. Par. and Dist. Syst.\u00a014(3), 276\u2013289 (2003)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"issue":"4","key":"46_CR15","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0743-7315(92)90016-G","volume":"16","author":"Y. Zhu","year":"1992","unstructured":"Zhu, Y.: Efficient processor allocation strategies for mesh-connected parallel computers. Jrnl. Par. and Dist. Comp.\u00a016(4), 328\u2013337 (1992)","journal-title":"Jrnl. Par. and Dist. Comp."},{"key":"46_CR16","unstructured":"Qiao, W., Ni, L.M.: Efficient processor allocation for 3D tori. In: 9th Int\u2019l. Par. Proc. Symp., pp. 466\u2013471 (1995)"},{"issue":"5","key":"46_CR17","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/71.852401","volume":"11","author":"P.-J. Chuang","year":"2000","unstructured":"Chuang, P.-J., Wu, C.-M.: An efficient recognition-complete processor allocation strategy for k-ary n-cube multiprocessors. IEEE Trans. Par. and Dist. Syst.\u00a011(5), 485\u2013490 (2000)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Mao, W., Chen, J., Watson III, W.: Efficient subtorus processor allocation in a multi-dimensional torus. In: 8th Int\u2019l. Conf. High-Perf. Comp. Asia-Pacific Reg., p. 53 (2005)","DOI":"10.1109\/HPCASIA.2005.35"},{"issue":"5","key":"46_CR19","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1109\/71.852400","volume":"11","author":"H. Choo","year":"2000","unstructured":"Choo, H., Yoo, S.-M., Youn, H.Y.: Processor scheduling and allocation for 3D torus multicomputer systems. IEEE Trans. Par. and Dist. Syst.\u00a011(5), 475\u2013484 (2000)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"issue":"5","key":"46_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/71.770192","volume":"10","author":"G.-M. Chiu","year":"1999","unstructured":"Chiu, G.-M., Chen, S.-K.: An efficient submesh allocation scheme for two-dimensional meshes with little overhead. IEEE Trans. Par. and Dist. Syst.\u00a010(5), 471 (1999)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"key":"46_CR21","doi-asserted-by":"crossref","unstructured":"Bunde, D.P., Leung, V.J., Mache, J.: Communication patterns and allocation strategies. In: 18th Int\u2019l. Par. and Dist. Proc. Symp., p. 248 (2004)","DOI":"10.1109\/IPDPS.2004.1303307"},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"Leung, V., et\u00a0al.: Processor allocation on Cplant: Achieving general processor locality using one-dimensional allocation strategies. In: 4th IEEE Int\u2019l. Conf. Cluster Comp., pp. 296\u2013304 (2002)","DOI":"10.2172\/800975"},{"issue":"7","key":"46_CR23","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/71.598346","volume":"8","author":"V. Lo","year":"1997","unstructured":"Lo, V., et al.: Non-contiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Trans. Par. and Dist. Syst.\u00a08(7), 712\u2013726 (1997)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"key":"46_CR24","unstructured":"Mache, J., Lo, V., Windisch, K.: Minimizing message passing contention in fragmentation free processor allocation. In: 10th Int\u2019l. Conf. Par. and Dist. Comp. Syst., pp. 120\u2013124 (1997)"},{"key":"46_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-7315(91)90032-5","volume":"12","author":"K. Li","year":"1991","unstructured":"Li, K., Cheng, K.: A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Jrnl. Par. and Dist. Comp.\u00a012, 79\u201383 (1991)","journal-title":"Jrnl. Par. and Dist. Comp."},{"issue":"1","key":"46_CR26","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TPDS.2006.12","volume":"17","author":"O. Lysne","year":"2006","unstructured":"Lysne, O., et\u00a0al.: Layered routing in irregular networks. IEEE Trans. Par. and Dist. Syst.\u00a017(1), 51\u201365 (2006)","journal-title":"IEEE Trans. Par. and Dist. Syst."},{"key":"46_CR27","doi-asserted-by":"crossref","unstructured":"Sancho, J.C., et\u00a0al.: Effective methodology for deadlock-free minimal routing in InfiniBand networks. In: Int\u2019l. Conf. Par. Proc., pp. 409\u2013418 (2002)","DOI":"10.1109\/ICPP.2002.1040897"},{"key":"46_CR28","doi-asserted-by":"crossref","unstructured":"Skeie, T., et\u00a0al.: LASH-TOR: A generic transition-oriented routing algorithm. In: 11th Int\u2019l. Conf. Par. and Dist. Syst. (2004)","DOI":"10.1109\/ICPADS.2004.1316144"},{"key":"46_CR29","unstructured":"Schroeder, M.D., et al.: Autonet: a high-speed, self-configuring local area network using point-to-point links. SRC Res. Rep.\u00a059, Digital Equipment Corp. (1990)"},{"key":"46_CR30","unstructured":"Windisch, K., Lo, V., Bose, B.: Contiguous and non-contiguous processor allocation algorithms for k-ary n-cubes. In: Int\u2019l. Conf. Par. Proc., p. 164 (1995)"},{"key":"46_CR31","doi-asserted-by":"crossref","unstructured":"Chuang, P.-J., Tzeng, N.-F.: An efficient submesh allocation strategy for mesh computer systems. In: 11th Int\u2019l. Conf. Dist. Comp. Syst., p. 256 (1991)","DOI":"10.1109\/ICDCS.1991.148674"},{"key":"46_CR32","unstructured":"J-Sim, http:\/\/www.j-sim.org"},{"key":"46_CR33","unstructured":"Condor, http:\/\/www.cs.wisc.edu\/condor"},{"key":"46_CR34","first-page":"267","volume":"3","author":"P. Kermani","year":"1979","unstructured":"Kermani, P., Kleinrock, L.: Virtual cut-through: A new computer communication switching technique. Computer Networks\u00a03, 267\u2013286 (1979)","journal-title":"Computer Networks"},{"issue":"8","key":"46_CR35","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/TPDS.2004.28","volume":"15","author":"J.C. Sancho","year":"2004","unstructured":"Sancho, J.C., Robles, A., Duato, J.: An effective methodology to improve the performance of the Up*\/Down* routing algorithm. IEEE Trans. Par. and Dist. Syst.\u00a015(8), 740\u2013754 (2004)","journal-title":"IEEE Trans. Par. and Dist. Syst."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2013 HiPC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77220-0_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T23:51:57Z","timestamp":1737849117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77220-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772194","9783540772200"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77220-0_46","relation":{},"subject":[]}}