[openib-general] [PATCH] osm: Added FatTree routing to the osm manual

[Hal Rosenstock]

On Tue, 2006-12-19 at 16:43, Yevgeny Kliteynik wrote:
> Added FatTree routing to the osm manual
> 
> Signed-off-by: Yevgeny Kliteynik <kliteyn at dev.mellanox.co.il>

Thanks. Applied.

>  osm/man/opensm.8 |   8 +++++++-
>  1 files changed, 7 insertions(+), 1 deletions(-)
> 
> diff --git a/osm/man/opensm.8 b/osm/man/opensm.8
> index 316232d..225918d 100644
> --- a/osm/man/opensm.8
> +++ b/osm/man/opensm.8
> @@ -391,7 +391,7 @@ Examples:
>  
>  .SH ROUTING
>  .PP
> -OpenSM offers two routing engines:
> +OpenSM offers three routing engines:
>  
>  1.  Min Hop Algorithm - based on the minimum hops to each node where the
>  path length is optimized.
> @@ -401,6 +401,12 @@ node, but it is constrained to ranking r
>  if the subnet is not a pure Fat Tree, and deadlock may occur due to a
>  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 CBB ratio.
> +Similar to UPDN, Fat Tree routing is constrained to ranking rules.

Is there a reference or a more complete writeup of what it does ? See
the descriptions of the other algorithms for what I'm referring to here.

-- Hal

>  OpenSM also supports a file method which can load routes from a table. See
>  \'Modular Routing Engine\' for more information on this.