![]() |
![]() |
#1 |
Dec 2005
2·33 Posts |
![]()
Another one has reached 100%. This one was much faster than the last one.
![]() What's next on the menu? ![]() |
![]() |
![]() |
#2 |
Jun 2003
The Texas Hill Country
32×112 Posts |
![]()
Really finishing 2,1146L ...
Somebody entered incorrect data for the sieving effort parameters. We are really only about half done. We are considering doing 2,797+.c150 which is what is left thanks to Bruce finding a 55 digit factor by ECM. This is now in the range where GNFS is more efficient that using the original SNFS polynomials. However, there is one potential problem for our participants. The typical SNFS project has something like 40M "lines" where each line is perhaps 90M long. This allows us to make assignments where the atomic assignment takes only a fraction of a minute and each client processes hundreds of them in a single task. But with the GNFS polynomials, the sieving area is not so square. Here we need perhaps only 250K lines, but each line is 18.9G long. The difficulty is that the atomic assignment will now require perhaps 10 minutes, and we have no reasonable way to provide a finer granularity. For many of the sievers, this is no problem. They sit there and sieve 24/7 at the lowest priority. So, they don't even notice that the OS may have suspended them while something of higher priority was run. However, we also have another class of participants who frequently start and stop the siever in order to reboot or otherwise use the machine resources. Those users are often willing to wait a few seconds for the siever to stop gracefully. But asking them to wait a number of minutes would not be appropriate. The best suggestion that I have at the moment is to sieve two projects simultaneously. Those who can process the longer assignments could work on 2,797+ while the others begin another SNFS project. Comments? Richard Last fiddled with by Wacky on 2006-02-28 at 15:07 |
![]() |
![]() |
#3 |
"Nancy"
Aug 2002
Alexandria
46438 Posts |
![]()
It should be possible to use reciprocal polynomials of opposite skewness, so a line would be only 250k long. This may hurt performance due to very frequent line changes, though.
Alex |
![]() |
![]() |
#4 | |
Dec 2005
2×33 Posts |
![]() Quote:
![]() Last fiddled with by NeoGen on 2006-02-28 at 16:34 |
|
![]() |
![]() |
#5 | |
Sep 2005
UGent
6010 Posts |
![]() Quote:
I have to admit I don't know the internals of the code, but I'm sure this is not hard to implement. |
|
![]() |
![]() |
#6 | |
Jun 2003
The Texas Hill Country
32·112 Posts |
![]() Quote:
If it is too low, not only do you waste the time polling, but you may also invalidate the caches, adding even more overhead. On the other hand, if the polling is done too far out, it may not be frequent enough to give satisfactory response. Considering that the length of a "line" may vary by a couple orders of magnitude, finding the right balance is not trivial. |
|
![]() |
![]() |
#7 | |
Sep 2005
UGent
22×3×5 Posts |
![]() Quote:
I know that Linux even has a mechanism using signals to notify when a new file is created in a directory, so then you don't even need to poll for stop.txt (this is probably Linux-specific). |
|
![]() |
![]() |
#8 | |
Tribal Bullet
Oct 2004
5·709 Posts |
![]() Quote:
jasonp |
|
![]() |
![]() |
#9 | |
Nov 2003
22·5·373 Posts |
![]() Quote:
about an optimal (or even near-optimal) skewness. Just reduce the line length and accept some loss in efficiency. |
|
![]() |
![]() |
#10 | |
Jun 2003
The Texas Hill Country
32×112 Posts |
![]() Quote:
I'll set up a separate server pool and invite those who do not feel that they would be adversely affected by the longer line calculation times to switch. Meanwhile, the rest of the participants can continue sieving as usual. |
|
![]() |