
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Wickus Nienaber, Xin Yuan, Zhenhai Duan, "LID Assignment in InfiniBand Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 4, pp. 484497, April, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.144, author = {Wickus Nienaber and Xin Yuan and Zhenhai Duan}, title = {LID Assignment in InfiniBand Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {4}, issn = {10459219}, year = {2009}, pages = {484497}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.144}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  LID Assignment in InfiniBand Networks IS  4 SN  10459219 SP484 EP497 EPD  484497 A1  Wickus Nienaber, A1  Xin Yuan, A1  Zhenhai Duan, PY  2009 KW  Interconnection architectures KW  Network management VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] A. Bermudez, R. Casado, F.J. Quiles, T.M. Pinkston, and J. Duato, “Evaluation of a Subnet Management Mechanism for InfiniBand Networks,” Proc. 32nd Int'l Conf. Parallel Processing (ICPP '03), pp.117124, Oct. 2003.
[2] A. Bermudez, R. Casado, F.J. Quiles, and J. Duato, “Use of Provisional Routes to SpeedUp Change Assimilation in InfiniBand, Networks,” Proc. Workshop Comm. Architecture for Clusters (CAC '04), p. 186, Apr. 2004.
[3] A. Bermudez, R. Casado, F.J. Quiles, and J. Duato, “Fast Routing Computation on InfiniBand Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 3, pp. 215226, Mar. 2006.
[4] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks, An Engineering Approach. Morgan Kaufmann, 2003.
[5] C. Gomez, F. Gilabert, M.E. Gomez, P. Lopez, and J. Duato, “Deterministic versus Adaptive Routing in FatTrees,” Proc. Workshop Comm. Architecture for Clusters (CAC '07), pp. 18, Apr. 2007.
[6] M. Koibuchi, A. Funahashi, A. Jouraku, and H. Amano, “LTurn Routing: An Adaptive Routing in Irregular Networks,” Proc. Int'l Conf. Parallel Processing (ICPP '01), pp. 383392, Sept. 2001.
[7] X. Lin, Y. Chung, and T. Huang, “A Multiple LID Routing Scheme for FatTreeBased InfiniBand Networks,” Proc. 18th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '04), p. 11a, Apr. 2004.
[8] P. Lopez, J. Flich, and J. Duato, “DeadlockFree Routing in InfiniBand through Destination Renaming,” Proc. Int'l Conf. Parallel Processing (ICPP '01), pp. 427434, Sept. 2001.
[9] lp_solve Reference Guide, http://lpsolve.sourceforge.net5.5/, 2008.
[10] InfiniBand Trade Association, InfiniBand Architecture Specification, Release 1.2, Oct. 2004.
[11] O. Lysne, T. Skeie, S. Reinemo, and I. Theiss, “Layered Routing in Irregular Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 1, pp. 5165, Jan. 2006.
[12] M. Koibuchi, A. Jouraku, and H. Amano, “Path Selection Algorithm: The Strategy for Designing Deterministic Routing from Alternative Paths,” Parallel Computing, vol. 31, no. 1, pp.117130, 2005.
[13] J.C. Sancho, A. Robles, and J. Duato, “A New Methodology to Compute DeadlockFree Routing Tables for Irregular Networks,” Proc. Fourth Workshop Comm. Architecture and Applications for NetworkBased Parallel Computing, Jan. 2000.
[14] J.C. Sancho, A. Robles, and J. Duato, “Effective Strategy to Computing Forwarding Tables for InfiniBand Networks,” Proc. Int'l Conf. Parallel Processing (ICPP '01), pp. 4857, Sept. 2001.
[15] J.C. Sancho, A. Robles, and J. Duato, “Effective Methodology for DeadlockFree Minimal Routing in InfiniBand Networks,” Proc. Int'l Conf. Parallel Processing (ICPP '02), pp. 409418, 2002.
[16] M.D. Schroeder, A.D. Birrell, M. Burrow, H. Murray, R.M. Needham, and T.L. Rodeheffer, “Autonet: A HighSpeed SelfConfiguring Local Area Network Using PointtoPoint Links,” IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp.13181335, 1991.
[17] J.Y. Yen, “Finding the $k$ Shortest Loopless Paths in a Network,” Management Science, vol. 17, no. 11, July 1971.
[18] X. Yuan, W. Nienaber, Z. Duan, and R. Melhem, “Oblivious Routing for FatTree Based System Area Networks with Uncertain Traffic Demands,” Proc. ACM SIGMETRICS '07, pp. 337348, June 2007.
[19] E.W. Zegura, K. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. IEEE INFOCOM '96, pp. 594602, Apr. 1996.