Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-40047-6_69 | international conference on parallel processing |
Keywords | DocType | Volume |
infiniband cluster,routing problem,infiniband routers,ib-ib routers,inter-subnet ib routing,network scalable,interconnecting large cluster,inter-subnet routing,new routing algorithm,current solution,routing algorithm,current implementation | Conference | 8097 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bartosz Bogdanski | 1 | 41 | 4.53 |
| Bjorn Dag Johnsen | 2 | 29 | 5.92 |
| Sven-Arne Reinemo | 3 | 184 | 12.64 |
| José Flich | 4 | 268 | 26.03 |