I am looking at the earlier posts. I had thought about this one before. All the cases where this algorithm applies have low port counts. I can fix this by just not doing the determinant if the port count is larger than the highest order polynomial in the table since none of them will match.
-----Original Message----- From: Sasha Khapyorsky [mailto:[EMAIL PROTECTED] Sent: Sunday, November 30, 2008 10:40 AM To: Robert Pearson Cc: [email protected] Subject: Re: [PATCH][5] opensm: compute local geometry On 18:36 Sun 30 Nov , Sasha Khapyorsky wrote: > On 10:59 Tue 11 Nov , Robert Pearson wrote: > > Sasha, > > > > Here is the fifth patch implementing the mesh analysis algorithm. > > > > This patch implements > > - routine to compute characteristics polynomial of a matrix > > - routine to compute the local 'metric' around each switch > > I checked performance of determinant calculation - when switch has 8 > links it takes 11-12 seconds per switch, with 10 links - 2177 seconds. Oops, sorry. The results above are for 10 and 12 links. Sasha _______________________________________________ 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
