Abstract
As InfiniBand clusters grow in size and complexity, the need arises to segment the network into manageable sections. Up until now, InfiniBand routers have not been used extensively and little research has been done to accommodate them. However, the limits imposed on local addressing space, inability to logically segment fabrics, long reconfiguration times for large fabrics in case of faults, and, finally, performance issues when interconnecting large clusters, have rekindled the industry's interest into IB-IB routers. In this paper, we examine the routing problems that exist in the current implementation of OpenSM and we introduce two new routing algorithms for inter-subnet IB routing. We evaluate the performance of our routing algorithms against the current solution and we show an improvement of up to 100 times that of OpenSM. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Bogdański, B., Johnsen, B. D., Reinemo, S. A., & Flich, J. (2013). Making the network scalable: Inter-subnet routing in InfiniBand. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8097 LNCS, pp. 685–698). https://doi.org/10.1007/978-3-642-40047-6_69
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
