mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Riesel Prime Search (https://www.mersenneforum.org/forumdisplay.php?f=59)
-   -   LLR - new version (https://www.mersenneforum.org/showthread.php?t=5730)

Cruelty 2006-04-12 13:15

LLR - new version
 
There was no announcement, however version 3.7.0 is out and it seems that [URL="http://www.mersenneforum.org/showthread.php?p=77560#post77560"]there are some speed improvements [/URL]over 3.6.2, at least for P4...

Flatlander 2006-04-12 13:54

[quote=Cruelty]There was no announcement, however version 3.7.0 is out and it seems that [URL="http://www.mersenneforum.org/showthread.php?p=77560#post77560"]there are some speed improvements [/URL]over 3.6.2, at least for P4...[/quote]
... but, as expected, not on my Athlon XP. LLR3.5 is still fastest.

Cruelty 2006-04-12 13:55

[QUOTE=Flatlander]... but, as expected, not on my Athlon XP. LLR3.5 is still fastest.[/QUOTE]
And is still BETA :whistle:

Flatlander 2006-04-12 14:02

Have there been any problems reported with 3.5?

paulunderwood 2006-04-12 14:44

From the Readme.txt that come with LLR 3.7.0:

[QUOTE]The new Gwnums allow non zero padded Irrational Base FFTs with k's up to
20 bits, and zero padded ones with k's up to 48 bits, so this version is
a major enhancement of the previous IBDWT version of LLR, which uses the
Colin Percival's method, and is really fast only for k's up to 9 bits
(However, I will continue to support it some time).
[/QUOTE]

So for larger "k" there should be a huge speed up :flex:

Flatlander 2006-04-12 21:47

The same comment is also in the 3.5 readme.txt.

VBCurtis 2006-04-13 19:03

I was disappointed to not find any speed boost with k=399239 or k=3803443215 on a P4 CPU running LLR 3.7. 399239 is under 20 bits, so I had hope. In fact, the bigger k (just under 32 bits) is the same speed as the 19-bit k.

-Curtis

Cruelty 2006-05-16 13:53

There is new 3.7.1 version, however it is not mentioned in readme what the change from 3.7.0 actually is...
I haven't tested it yet either - perhaps someone else already did it?

edorajh 2006-05-16 15:00

Jean Penné did describe changes made in 3.7.1. version in the PrimeNumbers yahoo group....

[QUOTE]This update only concern the Gaussian Mersenne prime tests.
I implemented the random shift of the units bit position for the
Gaussian Mersenne norm primality testing, as George Woltman did for
the LL test of Mersenne numbers. It works perfectly well, and it is
important for the double check works. On the other hand, none of the
features have been changed, so I did not changed the version number of
the program...
[/QUOTE]

Link...

[URL="http://groups.yahoo.com/group/primenumbers/message/17999"]http://groups.yahoo.com/group/primenumbers/message/17999[/URL]


All times are UTC. The time now is 16:24.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.