Hi Sasha, Mentioning in the man page that fat-tree can be used on "symmetrical or almost symmetrical" trees, instead of the previous "symmetrical" only.
Signed-off-by: Yevgeny Kliteynik <[EMAIL PROTECTED]> --- opensm/man/opensm.8.in | 8 ++++---- 1 files changed, 4 insertions(+), 4 deletions(-) diff --git a/opensm/man/opensm.8.in b/opensm/man/opensm.8.in index d34b9c8..b5ffd24 100644 --- a/opensm/man/opensm.8.in +++ b/opensm/man/opensm.8.in @@ -539,10 +539,10 @@ loop in the subnet. 3. Fat Tree Unicast routing algorithm - this algorithm optimizes routing for congestion-free "shift" communication pattern. -It should be chosen if a subnet is a symmetrical Fat Trees of various types, -not just K-ary-N-Trees: non-constant K, not fully staffed, any Constant -Bisectional Bandwidth (CBB) ratio. Similar to UPDN, Fat Tree routing is -constrained to ranking rules. +It should be chosen if a subnet is a symmetrical or almost symmetrical +fat-tree of various types, not just K-ary-N-Trees: non-constant K, not +fully staffed, any Constant Bisectional Bandwidth (CBB) ratio. +Similar to UPDN, Fat Tree routing is constrained to ranking rules. 4. LASH unicast routing algorithm - uses Infiniband virtual layers (SL) to provide deadlock-free shortest-path routing while also -- 1.5.1.4 _______________________________________________ general mailing list [email protected] http://lists.openfabrics.org/cgi-bin/mailman/listinfo/general To unsubscribe, please visit http://openib.org/mailman/listinfo/openib-general
