• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Øvrige samlinger
  • Høstingsarkiver
  • CRIStin høstingsarkiv
  • View Item
  •   Home
  • Øvrige samlinger
  • Høstingsarkiver
  • CRIStin høstingsarkiv
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Tasoulas, Evangelos; Zahid, Feroz; Gran, Ernst Gunnar; Begnum, Kyrre; Johnsen, Bjørn Dag; Skeie, Tor
Journal article; AcceptedVersion; Peer reviewed
View/Open
cacpae_self_archived.pdf (2.126Mb)
Year
2019
Permanent link
http://urn.nb.no/URN:NBN:no-76894

CRIStin
1660844

Metadata
Show metadata
Appears in the following Collection
  • Institutt for informatikk [3656]
  • CRIStin høstingsarkiv [17102]
Original version
Concurrency and Computation. 2019, 31 (2):e4443, DOI: https://doi.org/10.1002/cpe.4443
Abstract
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.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy