On 14:54 Wed 26 Sep , Keshetti Mahesh wrote: > > The sharing paths is orthogonal to the min-hop requirement. > > The min-hop requirements is a common way to avoid routing loops. > > All algorithms I know are using it. > > Even with that requirement there regularly multiple paths from A to B > > available both for fat-tree or mesh/tori topologies. > > Thanks for clarifying it. Now, I can see that openSM supports four different > algorithms(Min-hop being the default). Depending on the physical network > topology whether the openSM decides the routing policy on its own or one > has to configure openSM's routing algorithm before starting it.
Desired routing algorithm should be specified with -R option (refer OpenSM man page for more usage details). > Is there any > document describing which algorithm should be used when? And is there > document describing the current openSM routing algorithms in detail ? Some basic explanations are in OpenSM man page. Sasha _______________________________________________ general mailing list general@lists.openfabrics.org http://lists.openfabrics.org/cgi-bin/mailman/listinfo/general To unsubscribe, please visit http://openib.org/mailman/listinfo/openib-general
