![]() |
![]() |
#1 |
May 2007
Kansas; USA
132×61 Posts |
![]()
We are taking suggestions on the future direction of NPLB. Here is what I would propose at this time. I think it should be used as a starting point for discussion and not set in stone:
1. How the drives will proceed or be divided up for the range of n=600K-1M. I would like to propose that we leave the k=300-400 range as is for a period of time but leave open the possibility of doing n-range searches like we've done for drives 1, 2, and 3 for k's that are unreserved once we have all k=300-1001 up to n=600K. For k=400-1001, I'd like to propose that we divide that up into smaller k-ranges as separate drives, as follows: (1) k=400-600 (2) k=600-800 (3) k=800-1001. My thinking is that this will make the project more interesting because each of the drives would likely be at different search limits. Once we hit an fftlen change at the higher k-values, that will make the lower k-values a little more appealing and they would be searched deeper. That would give more of a choice as to what n-value people choose to search at. 2. k<300 for unreserved k's only searched to n=600K. There are currently about 15 unreserved k's < 300 that are at n=600K and are not being worked on yet we are already nearing or at n=1M on several k=300-400. My thinking is that we should make this a separate drive and sieving effort before we start k>400 for n=600K-1M. Then we could open all k-ranges at once and have 5 drives running concurrently, all that will likely be at different n-ranges after a period of time. My thinking is that it doesn't make sense to search higher k's to n=1M while leaving lower k's at only n=600K. 3. k=1003-2000. This range is an extreme state of mess as a result of the fragmented Benson searches. Karsten and some folks at RPS have gotten the gaps filled in up to n=50K on all of them (nice work!) but there are plenty of gaps still to fill. I think there are many people that don't like the higher n-ranges that we are currently processing because it takes too long to find primes without large resources, hence a drop-off in popularity of NPLB in the last couple of months. I think that doing a team sieve and search would bring in a number of people to find smaller primes. Many people aren't concerned about top-5000 primes and those people could help us clean up this mess. 4. Allow for individual-k reservations for ANY k-value for n>600K. In the same vain as the what the Riesel/Sierp base 5 project does, people could reserve individual k's but they would not be removed from the main drives. It would be up to the people reserving them to stay ahead of the drives on their searching. In effect, the drives would 'double check' the individual-k's that are reserved. With nearly 350 k's available at that time, there should be little fear that the drives would be doing more than 2-5% double checking of individual-k reservations. All thoughts and opinions are welcome. Gary |
![]() |
![]() |
![]() |
#2 | ||||
A Sunny Moo
Aug 2007
USA (GMT-5)
3×2,083 Posts |
![]() Quote:
![]() Quote:
Quote:
Quote:
Anon ![]() |
||||
![]() |
![]() |
![]() |
#3 | |||
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10AB16 Posts |
![]()
I agree with point 1 and point 2 and have nothing else to add there.
Quote:
Quote:
Quote:
|
|||
![]() |
![]() |
![]() |
#4 | |
May 2007
Kansas; USA
101000010001012 Posts |
![]() Quote:
Of course if we don't have enough interest in individual-k reservations for k=300-400, we may need to do an n-range drive search for remaining unreserved k's like we have done for other drives. Gary |
|
![]() |
![]() |
![]() |
#5 | |
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
#6 | |
May 2007
Kansas; USA
132×61 Posts |
![]() Quote:
We could leave it open as a possibility if people really start reserving many individual k's for k=300-400 such that we're about to run out of them but that would be a long way off. G Last fiddled with by gd_barnes on 2008-08-26 at 08:33 |
|
![]() |
![]() |
![]() |
#7 | |
A Sunny Moo
Aug 2007
USA (GMT-5)
3×2,083 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
#8 |
May 2007
Kansas; USA
101000010001012 Posts |
![]()
I have created this new thread to discuss the future direction of NPLB as was done previously in the News thread. I have moved all posts from that thread to here.
Gary Last fiddled with by gd_barnes on 2008-09-07 at 08:20 |
![]() |
![]() |
![]() |
#9 |
May 2007
Kansas; USA
132×61 Posts |
![]()
I am seeking opinions about how to process k=1003-2000 in the future.
k=1003-1400 is a mess because it had fragmented searches done by Benson and there have been several misc. efforts to fill in some k's, some of which were coordinated and some that weren't. All k's have been searched up to n=50K by Karsten, Henry and me. Many k's contain holes for n=50K to n=?? that need to be filled. My initial thinking is this: Do some sort of team sieve/drive to get all of the k's searched from n=50K-200K. Possible different options: Higher or lower n-range. Split up k's into smaller pieces. Split up k=1003-1400 from k=1400-2000. My main objective for 2009 is that I'd like to make the project more interesting than it has been with essentially only 3 different n-ranges that could be searched, 1 of which is ~50% double-check at its current n-level. I think that having the upcoming k<300 effort plus this smaller-prime effort in addition to the regular drives will do just that. I know that several of you like filling in gaps and holes and otherwise searching for smaller primes. So regardless of whether you have been a regular contributor here, if the idea of sieving and searching for smaller primes and cleaning up ranges appeals to you, please offer your two cents here. Gary |
![]() |
![]() |
![]() |
#10 |
I ♥ BOINC!
Oct 2002
Glendale, AZ. (USA)
3×7×53 Posts |
![]()
With my limited knowledge...
Put any range that is made up of many smaller ranges on a server so everyone can just put a core or three on it until it has been exhausted. |
![]() |
![]() |
![]() |
#11 |
I quite division it
"Chris"
Feb 2005
England
31×67 Posts |
![]()
I'm wondering if k=1003-1400 would get neglected if it was seperated from k=1400-2000? (Because primes are more likely to have already been found.)
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Move 19 game direction | MooMoo2 | Other Chess Games | 8 | 2016-02-01 17:50 |
NPLB future direction | gd_barnes | No Prime Left Behind | 16 | 2009-05-13 16:45 |
Thoughts on future NPLB searches | em99010pepe | No Prime Left Behind | 38 | 2008-12-23 10:02 |
Future project direction and server needs synopsis | gd_barnes | No Prime Left Behind | 6 | 2008-02-29 01:09 |
Poll on direction of conjectures effort | gd_barnes | Conjectures 'R Us | 2 | 2007-12-19 18:15 |