vFtree-A fat-tree routing algorithm using virtual lanes to alleviate congestion
It is a well known fact that multiple virtual lanes can improve performance in interconnection
networks, but this knowledge has had little impact on real clusters. Currently, a large number …
networks, but this knowledge has had little impact on real clusters. Currently, a large number …
Recent research development in flip-chip routing
The flip-chip package is introduced for modern IC designs with higher integration density,
larger I/O counts, faster speed, better signal integrity, etc. To ease design changes, an extra …
larger I/O counts, faster speed, better signal integrity, etc. To ease design changes, an extra …
Fast pattern-specific routing for fat tree networks
In the context of eXtended Generalized Fat Tree (XGFT) topologies, widely used in HPC and
datacenter network designs, we propose a generic method, based on Integer Linear …
datacenter network designs, we propose a generic method, based on Integer Linear …
[PDF][PDF] Optimized routing for fat-tree topologies
B Bogdanski - submitted for the degree of Philosophy …, 2014 - web-backend.simula.no
In recent years, InfiniBand has become one of the leading interconnects for
highperformance systems. InfiniBand is not only the most popular interconnect used in the …
highperformance systems. InfiniBand is not only the most popular interconnect used in the …
dFtree: a fat-tree routing algorithm using dynamic allocation of virtual lanes to alleviate congestion in infiniband networks
End-point hotspots can cause major slowdowns in interconnection networks due to head-of-
line blocking and congestion. Therefore, avoiding congestion is important to ensure high …
line blocking and congestion. Therefore, avoiding congestion is important to ensure high …
Discovery and routing of degraded fat-trees
B Bogdanski, BD Johnsen, SA Reinemo… - … on Parallel and …, 2012 - ieeexplore.ieee.org
The fat-tree topology has become a popular choice for InfiniBand enterprise systems due to
its deadlock freedom, fault-tolerance and full bisection bandwidth. In the HPC domain …
its deadlock freedom, fault-tolerance and full bisection bandwidth. In the HPC domain …
sFtree: a fully connected and deadlock-free switch-to-switch routing algorithm for fat-trees
Existing fat-tree routing algorithms fully exploit the path diversity of a fat-tree topology in the
context of compute node traffic, but they lack support for deadlock-free and fully connected …
context of compute node traffic, but they lack support for deadlock-free and fully connected …
Multi-homed fat-tree routing with InfiniBand
SA Reinemo, B Bogdanski… - 2014 22nd Euromicro …, 2014 - ieeexplore.ieee.org
For clusters where the topology consists of a fat-tree or more than one fat-tree combined into
one subnet, there are several properties that the routing algorithms should support, beyond …
one subnet, there are several properties that the routing algorithms should support, beyond …
[PDF][PDF] Dynamic Reconfiguration in Interconnection Networks
WL Guay - 2014 - web-backend.simula.no
Interconnection networks are widely deployed as the communication fabric in different
systems, ranging from internal networks in clusters to the wide area networks in public …
systems, ranging from internal networks in clusters to the wide area networks in public …
New routing algorithms for heterogeneous exaflopic supercomputers
J Gliksberg - 2022 - theses.hal.science
Building efficient supercomputers requires optimising communications, and their exaflopic
scale causes an unavoidable risk of relatively frequent failures. For a cluster with given …
scale causes an unavoidable risk of relatively frequent failures. For a cluster with given …