Compact network reconfiguration in fat-trees

Zahid, Feroz; Gran, Ernst Gunnar; Bogdański, Bartosz; Johnsen, Bjorn Dag; Skeie, Tor; Tasoulas, Evangelos

doi:10.1007/s11227-016-1759-y

Cited by 4 publications

(8 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our previous work, 37 we presented a metabase-driven fast network reconfiguration scheme for Fat-Trees. In the proposed method, routing is divided into two stages.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient routing and reconfiguration in virtualized HPC environments with vSwitch‐enabled lossless networks

Tasoulas

Zahid

Gran

et al. 2018

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

To meet the demands of communication-intensive workloads in the cloud, virtual machines (VMs) should utilize low overhead network communication paradigms. In general, such paradigms enable VMs to directly communicate with the hardware by means of a passthrough technology like Single-Root I/O Virtualization (SR-IOV). However, when passthrough-based virtualization is coupled with lossless interconnection networks, live migrations introduce scalability challenges due to the substantial network reconfiguration overhead. With these challenges in mind, we proposed a virtual switch (vSwitch) SR-IOV architecture for InfiniBand in our previous work titled "Towards the InfiniBand SR-IOV vSwitch Architecture". In this paper, we first suggest solutions to rectify the space-domain scalability issues that are present in vSwitch-enabled subnets as a result of the VMs using dedicated layer-two addresses. Then, we discuss routing strategies for virtualized environments using vSwitches and present a routing algorithm for Fat-Trees. We also present a reconfiguration method that minimizes imposed reconfiguration overhead on Fat-Trees.We perform an extensive evaluation of our prototype algorithms, and as vSwitch-enabled hardware does not yet exist, we deduce from empirical observations by emulating vSwitches with existing hardware, as well as large-scale simulations. Our results show significant reduction in the reconfiguration times as route recalculations can be eliminated, and for certain scenarios, the number of reconfiguration subnet management packets sent to switches is reduced from several hundred thousand down to a single one without degrading the routing quality.

show abstract

“…In our previous work, 37 we presented a metabase-driven fast network reconfiguration scheme for Fat-Trees. In the proposed method, routing is divided into two stages.…”

Section: Related Workmentioning

confidence: 99%

“…Since the provisional and the optimal routes are calculated based on the same acyclic graph, deadlock freedom is guaranteed. In our previous work, we presented a metabase‐driven fast network reconfiguration scheme for Fat‐Trees. In the proposed method, routing is divided into two stages.…”

Section: Related Workmentioning

confidence: 99%

Efficient routing and reconfiguration in virtualized HPC environments with vSwitch‐enabled lossless networks

Tasoulas

Zahid

Gran

et al. 2018

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…As the network topology remains the same, the existing paths in the network can actually be calculated only once. This is the idea behind our proposed metabase-aided re-routing method presented in Paper V [151]. In the proposed metabase-aided network reconfiguration method, routing is divided into two distinct phases: calculation of the paths in the topology, and the assignment of the calculated paths to the actual destinations.…”

Section: Efficient Network Reconfiguration Mechanismsmentioning

confidence: 99%

“…Paper V [151] is an extended version of Paper IV [150]. In this paper, we introduced a new metabase-aided network reconfiguration method as briefed in Section 3.1.2.…”

Section: Paper V: Compact Network Reconfiguration In Fat-treesmentioning

confidence: 99%

“…However, the same approach can be also be applied for fault-tolerance. In particular, for the metabase-aided reconfiguration method presented in Paper V [151], the routing algorithm can pre-calculate a number of alternative paths that can be quickly assigned to fix disconnected routing in case of a failure in the network. Such an approach can improve the routing efficiency in case of failures in large HPC systems, and can be beneficial to the fail-in-place network design as well [143].…”

Section: Future Workmentioning

confidence: 99%

See 1 more Smart Citation