mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > NFS@Home

Reply
 
Thread Tools
Old 2012-07-04, 16:35   #419
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

494710 Posts
Default

Quote:
Originally Posted by xilman View Post

A batch of numbers in the C235-240 range are presently being crunched to 2t50 in the ECMNET server at 83.217.167.177:8194. Lionel will add them to the RSALS queue in due course. Unless more clients join in the new batch won't be tested for at least another couple of weeks.

Paul
Ok Paul but what about the numbers from here? How much ecm was done on them? RSALS could easily sieve them and I do the post-processing averaging 3 per day. In a month that table would be done.
pinhodecarlos is offline   Reply With Quote
Old 2012-07-04, 16:41   #420
chris2be8
 
chris2be8's Avatar
 
Sep 2009

1000001100002 Posts
Default

Quote:
Originally Posted by xilman View Post
Note that (2/9)*240 = 53. A t53 test will not be run unless a great deal more ECM resources can be found. Right now it's easier to acquire SNFS processing than ECM and so the (2/9) rule, which has only ever been a rough guide, has to be relaxed slightly.


Paul
I though the rule was to run ECM for 2/9 of the *time* it would take to factor the number with SNFS (or up to 1/3 if it's near the point where GNFS would be faster).

Chris
chris2be8 is offline   Reply With Quote
Old 2012-07-04, 17:09   #421
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

3×5×719 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
Ok Paul but what about the numbers from here? How much ecm was done on them? RSALS could easily sieve them and I do the post-processing averaging 3 per day. In a month that table would be done.
All have been done to the 2/9 level. It's because of that fact that they are present in that file and why some of them have been processed by RSALS already.

With just my own resources, assuming that relatively little is diverted to ECM pre-processing of subsequent candidates, I could also do them all in a month.

If you would like to do some, please let me know and I'll reserve them for you. Each takes about 3-4 days on a modern multicore machine.


Paul
xilman is offline   Reply With Quote
Old 2012-07-04, 17:11   #422
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

3·5·719 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
I though the rule was to run ECM for 2/9 of the *time* it would take to factor the number with SNFS (or up to 1/3 if it's near the point where GNFS would be faster).

Chris
That's essentially the same thing if the same resources are available for each process. In the present case, the ECM resources are different from the sieving resources are different from the post-processing resources. That changes the optimization problem.
xilman is offline   Reply With Quote
Old 2012-07-04, 17:13   #423
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

3·17·97 Posts
Default

Quote:
Originally Posted by xilman View Post
All have been done to the 2/9 level. It's because of that fact that they are present in that file and why some of them have been processed by RSALS already.

With just my own resources, assuming that relatively little is diverted to ECM pre-processing of subsequent candidates, I could also do them all in a month.

If you would like to do some, please let me know and I'll reserve them for you. Each takes about 3-4 days on a modern multicore machine.


Paul
Right now I can't use the machine to sieve only for post-processing. CPU is getting temps very high even when sieving on 4 cores, I suppose I need to change/clear the thermal paste with a new one. I didn't have time yet to do so.
pinhodecarlos is offline   Reply With Quote
Old 2012-07-20, 11:06   #424
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

10011010100112 Posts
Default

Looking at GW_4_387 it needs more relations for a 31-bit LP task or not? Are those unique relations or raw?

Last fiddled with by pinhodecarlos on 2012-07-20 at 11:08
pinhodecarlos is offline   Reply With Quote
Old 2012-07-20, 13:15   #425
debrouxl
 
debrouxl's Avatar
 
Sep 2009

977 Posts
Default

Those are raw relations, as usual

At the time of this writing, ~68.1% of the results for the q=30M-117M range have been returned, and the forecast (optimistic, as always, as it's a simple linear extrapolation) is ~210M raw relations. If I want to target 210M raw relations in the end, the range will indeed have to be expanded, but this one is a relatively easy 31-bit LPs task, so ~200M relations ought to do the job.
debrouxl is offline   Reply With Quote
Old 2012-07-27, 13:00   #426
RichD
 
RichD's Avatar
 
Sep 2008
Kansas

3,389 Posts
Default 66667_249

I can start 66667_249 if Dmitry or others don't want it.
RichD is offline   Reply With Quote
Old 2012-07-27, 13:49   #427
debrouxl
 
debrouxl's Avatar
 
Sep 2009

97710 Posts
Default

Go ahead
debrouxl is offline   Reply With Quote
Old 2012-07-27, 14:15   #428
RichD
 
RichD's Avatar
 
Sep 2008
Kansas

3,389 Posts
Default 66667_249

Downloading now.

Edit: I'll also need the .fb file posted.

Last fiddled with by RichD on 2012-07-27 at 14:18
RichD is offline   Reply With Quote
Old 2012-07-28, 03:35   #429
Mathew
 
Mathew's Avatar
 
Nov 2009

2×52×7 Posts
Default

I would like to reserve 11113_206
Mathew is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
BOINC NFS sieving - NFS@Home frmky NFS@Home 1828 2020-11-14 04:57
BOINC Unregistered Information & Answers 6 2010-09-21 03:31
BOINC.BE BATKrikke Teams 2 2010-03-05 18:57
Boinc Xentar Sierpinski/Riesel Base 5 4 2009-04-25 10:26
BOINC? masser Sierpinski/Riesel Base 5 1 2009-02-09 01:10

All times are UTC. The time now is 09:58.


Fri Aug 6 09:58:08 UTC 2021 up 14 days, 4:27, 1 user, load averages: 4.78, 4.49, 4.17

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.