mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Msieve

Reply
 
Thread Tools
Old 2013-06-27, 01:15   #78
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

10011100010002 Posts
Default

I think we both would benefit from playing with settings and finding polys for a couple of smaller numbers. Perhaps some of the heavy hitters in this forum would like to supply you and I a couple of C155-180s to poly search? We can discuss settings, try to learn what stage1 bound produces the largest rate of useful nps hits per hour of gpu time, etc.

I have a c147 in my own queue; I had just done -np for 5 days for a poly when this thread began. I tried to apply what we learned last week, and restarted the search. 24 hours of -np1 with stage1 set to 2e21 (default is 2.38e22) produced roughly 700MB of hits with a 460M, which will take almost a core-week to size optimize. This makes me wonder how -np manages to do all 3 steps with just one CPU thread without massively stalling the GPU.

So, my first tentative guideline is to set stage 1 norm 10x tighter than default when running -np1 on its own, and even then the cpu has no chance to keep up. Or does the -nps step work with the -t threads command?

If I understand previous advice, I should not bother to npr more than, say, 500 best nps hits?
-Curtis
VBCurtis is offline   Reply With Quote
Old 2013-06-27, 02:21   #79
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3×1,181 Posts
Default

500 is a good upper limit. If you use -np, stage 2 is still given one extra thread so that the main thread can concentrate on keeping the GPU busy.
jasonp is offline   Reply With Quote
Old 2013-06-27, 02:26   #80
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

3·17·43 Posts
Default

So the best is Gimeral's degree 5? I'll queue it up tomorrow morning.
frmky is offline   Reply With Quote
Old 2013-06-27, 02:30   #81
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

100101011000112 Posts
Default

It is hard to tell - the deg6 are almost as good and have a good skew.
I haven't trial-sieved...
Batalov is offline   Reply With Quote
Old 2013-06-27, 18:29   #82
wombatman
I moo ablest echo power!
 
wombatman's Avatar
 
May 2013

23·223 Posts
Default

Curtis, I've taken to doing -np1 -nps, which still screams on the GPU. I let it run for an arbitrary amount of time, stop it, do the sort/top X step, and start an -npr step on a 2nd window. Then I restart the -np1 -nps with a new min_coeff. It is also possible to run -np1 -nps and have -npr running in a separate process at the same time. But then you have what is essentially wasted time since you're not looking at just the top results.

I'm still refining the searching, but this process lets me see if I'm getting any better results, and I can search in chunks of time as I see fit.
wombatman is offline   Reply With Quote
Old 2013-07-02, 22:27   #83
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

23×54 Posts
Default

Lorgix-
I'll tackle at least one of these once I'm done with the C163 from the other thread.

More observations:
On the C163, 9 hours of GPU -np1 at default stage1 norm produced 1GB of hits. I chose a stage2norm tight enough to root-optimize every hit, and proceeded to -np1 -nps on the gpu, while -nps on the first 1GB.

40 hours (about 1/3rd of the file) of processing on the 1GB has produced fewer hits than 7 hours of simultaneous -np1 -nps. Based on this outcome, I see no reason to do those first two steps separately.

If I were to process the entire file, 9 hours of GPU time + 100 hr CPU-nps time would produce more than twice as many hits as 9 hours of -np1 -nps. So, it seems the nps thread cannot keep up with the stage 1 hits. How hard would it be to spawn two size-optimizing threads (or n threads?) to handle the GPU output live?
VBCurtis is offline   Reply With Quote
Old 2013-07-03, 01:39   #84
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

1101110101112 Posts
Default

It would take a fair amount of re-engineering to duplicate all the ancillary structures for running multiple independent stage 2 jobs in separate threads. For larger jobs you can count on stage 1 hits to happen infrequently enough that -nps can keep up with a GPU, but at the C155-C163 size you get tons of output from stage 1 almost irrespective of what you do, and more threads will not get stage 2 to keep up.

jrk added a preliminary pass to -nps that reportedly makes degree 5 a lot faster, but that code is in an experimental branch with lots of other polynomial selection changes, that I don't have the time to work on now.
jasonp is offline   Reply With Quote
Old 2013-07-03, 02:00   #85
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

138816 Posts
Default

Thanks for the reply. The whole process is so fast that complaining the nps stage can't keep up with unbelievably fast GPU code is hardly fair. Good to know this experience is not universal to all composite sizes, too.
VBCurtis is offline   Reply With Quote
Old 2013-07-09, 11:58   #86
lorgix
 
lorgix's Avatar
 
Sep 2010
Scandinavia

3·5·41 Posts
Default

I tried to use GPU poly select on a small test case (RSA-number).

What's wrong here?
Attached Thumbnails
Click image for larger version

Name:	error.gif
Views:	107
Size:	5.9 KB
ID:	9999  
lorgix is offline   Reply With Quote
Old 2013-07-09, 12:08   #87
debrouxl
 
debrouxl's Avatar
 
Sep 2009

2·3·163 Posts
Default

I often see this error. You need to have a copy / symlink of one of the files suitable for the GPU in the current working directory. But I don't currently have access to the computer with a GPU, so that I can check and post the file name...
debrouxl is offline   Reply With Quote
Old 2013-07-09, 12:36   #88
lorgix
 
lorgix's Avatar
 
Sep 2010
Scandinavia

3×5×41 Posts
Default

Quote:
Originally Posted by debrouxl View Post
I often see this error. You need to have a copy / symlink of one of the files suitable for the GPU in the current working directory. But I don't currently have access to the computer with a GPU, so that I can check and post the file name...
Thanks for responding.
I took a guess and placed a copy of the PTX-file (I don't actually know what that is) in the working directory. This got the poly selection to run. Mostly looking like in this screenshot. But msieve.dat.m remained empty.
Attached Thumbnails
Click image for larger version

Name:	polysel.gif
Views:	116
Size:	7.8 KB
ID:	10000  
lorgix is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Polynomial Discriminant is n^k for an n-1 degree polynomial carpetpool Miscellaneous Math 14 2017-02-18 19:46
Help choosing motherboard please. Flatlander GPU Computing 4 2011-01-26 08:15
Choosing the best CPU for sieving siew Factoring 14 2010-02-27 10:07
MPQS: choosing a good polynomial ThiloHarich Factoring 4 2006-09-05 07:51
Choosing amount of memory azhad Software 2 2004-10-16 16:41

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


Sat Oct 23 19:47:22 UTC 2021 up 92 days, 14:16, 0 users, load averages: 0.84, 1.16, 1.29

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.