Lines Matching full:routing
156 \fB\-R\fR, \fB\-\-routing_engine\fR <Routing engine names>
157 This option chooses routing engine(s) to use instead of Min Hop
158 algorithm (default). Multiple routing engines can be specified
159 separated by commas so that specific ordering of routing algorithms
160 will be tried if earlier routing engines fail. If all configured
161 routing engines fail, OpenSM will always attempt to route with Min Hop
162 unless 'no_fallback' is included in the list of routing engines.
167 This option enables additional analysis for the lash routing engine to
169 may reduce the number of SLs required to give a deadlock free routing.
172 This option sets the starting VL to use for the lash routing algorithm.
176 This option enables unicast routing cache and prevents routing
179 when the topology change does not require new routing calculation,
182 A very common case that is handled by the unicast routing cache
183 is host reboot, which otherwise would cause two full routing
188 This option enforces routing engines (up/down and
200 from where switch forwarding tables will be loaded when using "file" routing
208 Set the root nodes for the Up/Down or Fat-Tree routing
212 Set the compute nodes for the Fat-Tree or DFSSSP/SSSP routing algorithms
216 Set the I/O nodes for the Fat-Tree or DFSSSP/SSSP routing algorithms
219 In the case of Fat-Tree routing:
224 In the case of (DF)SSSP routing:
234 patterns. This routing option will "shift" routing around in an
238 This option is used to randomize port selection in routing rather than
249 by Up/Down routing algorithm instead of node GUIDs
254 and Up/Down routing algorithms to the guids provided in the
316 This option tweaks the routing. It suitable for two cases:
317 1. While using DOR routing algorithm.
319 on a per switch basis for the DOR routing engine. The file consists
326 2. While using general routing algorithm.
327 This option provides the order of the ports that would be chosen for routing,
339 on a per switch basis for the DOR routing engine. The file consists
453 information needed for the torus-2QoS routing engine. The default
484 0x40 - ROUTING (dump FDB routing information)
871 .SH ROUTING
873 OpenSM now offers nine routing engines:
878 2. UPDN Unicast routing algorithm - also based on the minimum hops to each
883 3. DNUP Unicast routing algorithm - similar to UPDN but allows routing in
887 4. Fat Tree Unicast routing algorithm - this algorithm optimizes routing
892 Similar to UPDN, Fat Tree routing is constrained to ranking rules.
894 5. LASH unicast routing algorithm - uses Infiniband virtual layers
895 (SL) to provide deadlock-free shortest-path routing while also
897 deadlock-free topology-agnostic routing algorithm to the non-minimal
900 6. DOR Unicast routing algorithm - based on the Min Hop algorithm, but
906 7. Torus-2QoS unicast routing algorithm - a DOR-based routing algorithm
908 routing while supporting two quality of service (QoS) levels. In addition
913 8. DFSSSP unicast routing algorithm - a deadlock-free
914 single-source-shortest-path routing, which uses the SSSP algorithm
918 9. SSSP unicast routing algorithm - a single-source-shortest-path routing
920 optimize link utilization. This routing algorithm has no restrictions
924 can load routes from a table. See \'Modular Routing Engine\' for more
927 The basic routing algorithm is comprised of two stages:
933 For standard routing, a "relaxation" algorithm is used to propagate
935 For Up/Down routing, a BFS from every target is used. The BFS tracks link
941 This step is common to standard and Up/Down routing. Each port has a
955 OpenSM will preserve existing routing in any case where there is no change in
969 if the port is no longer UP or no longer the MinHop. When routing changes
972 In the case of using the file based routing, any topology changes are
973 currently ignored The 'file' routing engine just loads the LFTs from the file
976 switches will be skipped. Multicast is not affected by 'file' routing engine
982 The Min Hop algorithm is invoked by default if no routing algorithm is
1007 such, the UPDN routing algorithm should be used if the subnet is not a pure
1024 Min Hop routing algorithm.
1039 Note: Up/Down routing does not allow LID routing communication between
1079 Fat-tree Routing Algorithm
1081 The fat-tree algorithm optimizes routing for "shift" communication pattern.
1115 Topologies that do not comply cause a fallback to min hop routing.
1120 ratio, the routing will not be as balanced as in case of integer CBB ratio.
1125 pure and symmetrical fat-tree, the more optimal the routing will be.
1130 will match the routing tables.
1132 Routing between non-CN nodes
1151 is not used, routing algorithm will detect roots automatically.
1155 Note: LMC > 0 is not supported by fat-tree routing. If this is
1156 specified, the default routing algorithm is invoked instead.
1159 LASH Routing Algorithm
1161 LASH is an acronym for LAyered SHortest Path Routing. It is a
1162 deterministic shortest path routing algorithm that enables topology
1163 agnostic deadlock-free routing within communication networks.
1165 When computing the routing function, LASH analyzes the network
1198 reduce to Dimension Order Routing in certain topologies, it is topology
1214 Note: LMC > 0 is not supported by the LASH routing. If this is
1215 specified, the default routing algorithm is invoked instead.
1218 routing algorithm. For toroidal meshes on the other hand there
1219 are routing loops that can cause deadlocks. LASH can be used to
1230 DOR Routing Algorithm
1232 The Dimension Order Routing algorithm is based on the Min Hop
1254 DFSSSP and SSSP Routing Algorithm
1256 The (Deadlock-Free) Single-Source-Shortest-Path routing algorithm is
1258 while supporting arbitrary topologies. The DFSSSP routing algorithm
1312 the SSSP routing algorithm as an alternative, when all deadlock-free
1313 routing algorithms fail to route the network for whatever reason.
1316 routing algorithm.
1335 can result in a 'bad' routing of the I/O traffic as long as (DF)SSSP routing
1351 \'-G\' or \'--io_guid_file\' options (similar to the Fat-Tree routing).
1374 Torus-2QoS Routing Algorithm
1376 Torus-2QoS is routing algorithm designed for large-scale 2D/3D torus fabrics;
1383 Routing References
1385 To learn more about deadlock-free routing, see the article
1386 "Deadlock Free Message Routing in Multiprocessor Interconnection Networks"
1398 "Layered Routing in Irregular Networks", Lysne et al, IEEE
1405 "Layered Shortest Path (LASH) Routing in Irregular System Area
1409 To learn more about the DFSSSP and SSSP routing algorithm,
1412 J. Domke, T. Hoefler and W. Nagel: Deadlock-Free Oblivious Routing
1416 T. Hoefler, T. Schneider and A. Lumsdaine: Optimized Routing for
1422 Modular routing engine structure allows for the ease of
1423 "plugging" new routing modules.
1428 One existing routing module is up-down "updn", which may be
1434 There is also a trivial routing module which is able
1452 To activate file based routing module, use:
1456 If the lfts_file is not found or is in error, the default routing
1463 file (introduced by 'file' routing engine), but new lid matrix file
1472 When routing engine 'file' is activated, but the lfts file is not specified
1477 as input for forwarding tables loading by 'file' routing engine.
1505 0x40 - ROUTING (dump FDB routing information)