As mentioned before, there is no LGPL Moller patch for xgcd. We have to write one.
Bill. 2009/1/19 mabshoff <michael.absh...@mathematik.uni-dortmund.de>: > > Hello folks, > > I *just* merged svn1555 into Sage :) > > I build and tested for regressions in Sage 3.2.3 on > > * FC 9 x86 > * FC 9, OpenSUSE 10.3 x86-64 > * RHEL 5.2, SLES 10 Itanium > * Solaris 10 Sparc and x86 > * OSX 10.4 ppc > * OSX 10.5 32 bit *and* 64 bit builds > > And eMPIRe also works on > > * YDL 6.1 PS3 (a G5 variant) > > Sage doesn't build on the PS3 yet due to M4RI build problems, but we > will fix that next week :) > > From William's referee report: > > I did some multiplication timings (by multiplying m, n as above and > bigger) and empire is always about 3-5% FASTER. > > But there is a speed regression over the Nils Moeller patch: > > BEFORE (with GMP+Moeller): > sage: n = ZZ.random_element(0,2^(2^20)); m = ZZ.random_element(0,2^ > (2^20)) > sage: time k = m.xgcd(n) > CPU times: user 0.73 s, sys: 0.00 s, total: 0.73 s > Wall time: 0.74 s > > AFTER (with eMPIRe): > sage: n = ZZ.random_element(0,2^(2^20)); m = ZZ.random_element(0,2^ > (2^20)) > sage: time k = m.xgcd(n) > CPU times: user 2.39 s, sys: 0.00 s, total: 2.39 s > Wall time: 2.39 s > > William is doing some more testing, so stay tuned for more feedback. > > I guess we should open a ticket for the xgcd speed regression. > > Cheers, > > Michael > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
