mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > No Prime Left Behind

Reply
 
Thread Tools
Old 2008-01-21, 01:34   #1
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

5·2,017 Posts
Default Sieving reservations and coordination

Please use this thread for posting miscellaneous k-value and sieving reservations and statuses for No Prime Left Behind.

For k-value reservations, please use this thread only for miscellaneous searches such as for k > 1001 or individual-k searches for 300 < k < 400 or other k’s deemed in need of searching as defined in subproject #1. Please reserve n-ranges in the major team drives in the associated threads.

For sieving reservations, please use this thread for all k-values for coordination with others or posting of sieved files that you do not wish to search.

Last fiddled with by gd_barnes on 2008-01-21 at 05:27
gd_barnes is online now   Reply With Quote
Old 2008-02-04, 19:04   #2
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

5·2,017 Posts
Default Status for sieveing 300<k<400 for n=260K-1M

As you may know, about a week ago I started sieving 300<k<400 for n=260K-1M. I said I may ask for some sieving help in the near future. I have some good, better, and best news:

Good news:
With 9 cores now on it, I will reach P=6T by ~2/26 (my original target being end of Feb.) so I won't need any help unless someone REALLY wants to sieve! Let me know if you enjoy sieving and we can coordinate.

I reached P=660G last Friday and have now split P=~600G ranges over the 9 cores (660G-1.2T, 1.2T-1.8T, 1.8T-2.4T, etc.). At that point, I'll break off n=260K-600K for everyone and continue sieving n=600K-1M.

Better news:
Everyone can keep their speedy machines running LLR tests on our current files. The Feb. month end target also gives us plenty of time to start finding primes for 300<k<400 starting at n=333333 before they start dropping off (probably about 3-4 months from now). This will put as much historical data as possible for this k-range in Prof. Caldwell's database.

Best news:
There will be something for everyone for 300<k<400. A few individual-k reservations, some testing starting at n=600K for those who like big primes (after sieving to n=1M is complete), and of course the usual team drive set up.

I think this works out well. My machines consistent mostly of 1.66-Ghz Dell CD's and 3-Ghz P4's, none of which are overclocked, mixed in with a couple of Athlon's. Many of you have much faster machines. I think that puting these somewhat slower machines on sieving is a better use of them because LLRing is about 95% of total time. (Of course I have to have a few doing some LLRing!)

Any thoughts or opinions are always welcome.


Gary
gd_barnes is online now   Reply With Quote
Old 2008-02-16, 03:28   #3
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3·2,083 Posts
Default Help needed for sieving 300<k<1001, 100K<n<260K!

Hi all,

I've posted a reservation thread for sieving the range 300<k<1001, 100K<n<260K for doublechecking. I posted it in a separate thread for visibility purposes; after the effort has been completed, it will be moved here.

Anon
mdettweiler is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Coordination thread for redoing P-1 factoring ixfd64 Lone Mersenne Hunters 35 2020-03-16 23:28
Line sieving vs. lattice sieving JHansen NFSNET Discussion 9 2010-06-09 19:25
Sieving - information and reservations philmoore Five or Bust - The Dual Sierpinski Problem 1 2009-09-22 07:58
5^421-1 sieving (reservations closed) fivemack Factoring 124 2008-11-18 22:24
Sieved files/sieving coordination gd_barnes Conjectures 'R Us 32 2008-01-22 03:09

All times are UTC. The time now is 10:19.

Tue Mar 31 10:19:50 UTC 2020 up 6 days, 7:52, 0 users, load averages: 0.88, 0.97, 1.06

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.