|
From: William H. <ha...@ya...> - 2007-04-25 01:52:55
|
OK, I timed them. I generated 40,000 polynomial pairs of length around 1000 with about 1000 bits per coefficient. I converted them from the mpz to mpn format and did no additions. The time taken was 41.6s. Then I did just the mpn additions. The time was 43.7s. Then I did just the mpz additions. The time was 46.2s. Just as a check I did it with both additions and the time was 47.9s. That looks like the mpn time is about 2s, whilst the mpz time is about 4.5s, roughly. Pretty nice it seems. Bill. --- David Harvey <dmh...@ma...> wrote: > > On Apr 24, 2007, at 9:04 PM, William Hart wrote: > > > Boy these functions are slow. Then again, the time > > taken at present for the test includes generating > the > > random polys, adding them twice, once with mpn and > > once with mpz functions, doing lots of conversions > and > > a comparison. Even still I can't help but feel > they > > are awfully slow. > > It would be interesting to compare the speed to > adding a pair of > vectors of mpz's of a similar size. > > david > > > ------------------------------------------------------------------------- > This SF.net email is sponsored by DB2 Express > Download DB2 Express C - the FREE version of DB2 > express and take > control of your XML. No limits. Just data. Click to > get it now. > http://sourceforge.net/powerbar/db2/ > _______________________________________________ > Fastlibnt-devel mailing list > Fas...@li... > https://lists.sourceforge.net/lists/listinfo/fastlibnt-devel > __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com |