Compact network reconfiguration in fat-trees
| Autor: | Feroz Zahid, Tor Skeie, Ernst Gunnar Gran, Evangelos Tasoulas, Bjorn Dag Johnsen, Bartosz Bogdanski |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Routing protocol
Dynamic Source Routing Computer science Equal-cost multi-path routing Routing table Distributed computing Enhanced Interior Gateway Routing Protocol Wireless Routing Protocol Geographic routing 02 engineering and technology Network topology Theoretical Computer Science Routing Information Protocol 0202 electrical engineering electronic engineering information engineering Destination-Sequenced Distance Vector routing Hierarchical routing Triangular routing 020203 distributed computing Interconnection Zone Routing Protocol Static routing business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Policy-based routing Path vector protocol DSRFLOW Control reconfiguration 020202 computer hardware & architecture Link-state routing protocol Routing domain Hardware and Architecture Multipath routing business Software Information Systems Computer network |
| Zdroj: | The Journal of Supercomputing. 72:4438-4467 |
| ISSN: | 1573-0484 0920-8542 |
| Popis: | In large high-performance computing systems, the probability of component failure is high. At the same time, for a sustained system performance, reconfiguration is often needed to ensure high utilization of available resources. Reconfiguration in interconnection networks, like InfiniBand (IB), typically involves computation and distribution of a new set of routes in order to maintain connectivity and performance. In general, current routing algorithms do not consider the existing routes in a network when calculating new ones. Such configuration-oblivious routing might result in substantial modifications to the existing paths, and the reconfiguration becomes costly as it potentially involves a large number of source–destination pairs. In this paper, we propose a novel routing algorithm for IB-based fat-tree topologies, SlimUpdate. SlimUpdate employs path preservation techniques to achieve a decrease of up to 80 % in the number of total path modifications, as compared to the OpenSM’s fat-tree routing algorithm, in most reconfiguration scenarios. Furthermore, we present a metabase-aided re-routing method for fat-trees, based on destination leaf-switch multipathing. Our proposed method significantly reduces network reconfiguration overhead, while providing greater routing flexibility. On successive runs, our proposed method saves up to 85 % of the total routing time over the traditional re-routing scheme. Based on the metabase-aided routing, we also present a modified SlimUpdate routing algorithm to dynamically optimize routes for a given MPI node order. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|