Lines Matching full:deadlock

169 may reduce the number of SLs required to give a deadlock free routing.
191 violate "pure" deadlock free algorithm, so use it carefully.
880 if the subnet is not a pure Fat Tree, and deadlock may occur due to a
895 (SL) to provide deadlock-free shortest-path routing while also
897 deadlock-free topology-agnostic routing algorithm to the non-minimal
902 two switches.  This provides deadlock free routes for hypercubes when
907 specialized for 2D/3D torus topologies.  Torus-2QoS provides deadlock-free
913 8. DFSSSP unicast routing algorithm - a deadlock-free
916 Infiniband virtual lanes (SL) to provide deadlock-freedom.
1005 of the subnet. A loop-deadlock is a situation in which it is no longer
1008 Fat Tree, and one of its loops may experience a deadlock (due, for example,
1163 agnostic deadlock-free routing within communication networks.
1168 as to avoid deadlock.
1170 Note LASH analyzes routes and ensures deadlock freedom between switch
1172 layers as deadlock will not arise between switch and HCA.
1182 to a layer (SL) if the addition of that route does not cause deadlock
1185 of a path could lead to deadlock, LASH opens a new layer and continues
1241 each step.  This provides the ordering necessary to avoid deadlock.
1256 The (Deadlock-Free) Single-Source-Shortest-Path routing algorithm is
1259 uses Infiniband virtual lanes (SL) to provide deadlock-freedom.
1293 4.2) when a cycle is found, i.e. a possible deadlock is present,
1302 deadlock-free and an relation table is generated, which contains
1308 considered to be deadlock-free for all topologies. But on the one
1310 (5,000+ CAs and deadlock-free by design) to reduce
1312 the SSSP routing algorithm as an alternative, when all deadlock-free
1385 To learn more about deadlock-free routing, see the article
1412 J. Domke, T. Hoefler and W. Nagel: Deadlock-Free Oblivious Routing