[openib-general] RE: OpenSM Routing Scalability Proposal

[Eitan Zahavi]

Hi All,

This is an updated proposal document for your comments.
The main change is in describing the need for preserving enough data to
enable incremental routing algorithm. 
So the actual proposal is to implement the algorithm described in section
4.3.

EZ <<OpenSM Routing.pdf>> 

Eitan Zahavi
Design Technology Director
Mellanox Technologies LTD
Tel:+972-4-9097208
Fax:+972-4-9593245
P.O. Box 586 Yokneam 20692 ISRAEL


-----Original Message-----
From: Eitan Zahavi 
Sent: Thursday, May 05, 2005 6:46 PM
To: 'openib-general at openib.org'
Subject: OpenSM Routing Scalability Proposal

Hi All,

Here are some of my thoughts/proposals regarding faster and low memory
profile OpenSM routing solution.
Any feedback is welcome. 
I am not comfortable with the complexity order numbers and will highly
appreciate your double check.
The "persistency" area is also in its initial stages.

 << File: OsmRoutingScalability.pdf >> 
Thanks

Eitan Zahavi
Design Technology Director
Mellanox Technologies LTD
Tel:+972-4-9097208
Fax:+972-4-9593245
P.O. Box 586 Yokneam 20692 ISRAEL


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openfabrics.org/pipermail/general/attachments/20050517/c1c2229d/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: OpenSM Routing.pdf
Type: application/octet-stream
Size: 64577 bytes
Desc: not available
URL: <http://lists.openfabrics.org/pipermail/general/attachments/20050517/c1c2229d/attachment.obj>