mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > PrimeNet

Reply
 
Thread Tools
Old 2011-10-26, 07:35   #111
Dubslow
Basketry That Evening!
 
Dubslow's Avatar
 
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

3×29×83 Posts
Default

I dunno about tables, but I can give a quick overview of each assignment. (For the record, any assignment will put full, 100% load on the cpu, but I'm assuming that's not what you meant.)

Trial factoring varies heavily depending on what bit levels you're doing it at. Low-limit assignments are very, very short, i.e. a few minutes, maybe 15 on an average processor. "Normal" trial factoring again depends on the factoring depth (each bit takes twice as long as the previous one) but typical assignments take from a quarter of a day to one or two days, depending on the assignment and cpu speed.

P-1 factoring is another way to find factors, and again, varies with circumstances. A typical assignment will take one or two days, or for a large assignment maybe three. The second stage will also use 500MB - 1GB of memory (RAM) or more if you let it.

LL testing is very, very long. Current LL assignments take me a month, and I have Intel's fastest processor. On average they can be anywhere from a month to three or four or more, depending heavily on cpu speed.

All these time estimates assume you run P95 24 hours per day.

As for why it's not queuing 5 days of work, my guess (only a guess) would be that because each assignment is 15 minutes long, that even 1 day of work is ~100 assignments, and it's not getting more than some preset maximum. Guys, any other ideas?
Dubslow is offline   Reply With Quote
Old 2011-10-26, 07:44   #112
Wizzard
 
Feb 2011
Bratislava

33 Posts
Default

Ok, I see, that TF to low limits is the fastest work. Also it seems that different CPUs get different TF limits in normal TF assignments according to that CPU speed.

LL testing, double checking and P-1 testing is very slow.

What about ECM of small Mersenne numbers and Fermat numbers?

About that queuing 5 DOW, it seems that the number of assignments per CPU is limited to 15.
Wizzard is offline   Reply With Quote
Old 2011-10-26, 08:36   #113
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

5×7×139 Posts
Default

Quote:
Originally Posted by Wizzard View Post
Ok, I see, that TF to low limits is the fastest work. Also it seems that different CPUs get different TF limits in normal TF assignments according to that CPU speed.

LL testing, double checking and P-1 testing is very slow.

What about ECM of small Mersenne numbers and Fermat numbers?

About that queuing 5 DOW, it seems that the number of assignments per CPU is limited to 15.
ECM on small exponents may be somewhat between TF-low and TF.
ECM on Fermat numbers is between LL-D and LL.

Luigi
ET_ is offline   Reply With Quote
Old 2011-10-26, 08:51   #114
Mr. P-1
 
Mr. P-1's Avatar
 
Jun 2003

22218 Posts
Default

Quote:
Originally Posted by Wizzard View Post
About that queuing 5 DOW, it seems that the number of assignments per CPU is limited to 15.
You can change this limit by putting

Code:
MaxExponents=100
or whatever number you choose, into prime.txt. See undoc.txt for details.
Mr. P-1 is offline   Reply With Quote
Old 2011-10-26, 08:53   #115
Wizzard
 
Feb 2011
Bratislava

1B16 Posts
Default

^^ Thank you very much, gyus
Wizzard is offline   Reply With Quote
Old 2011-10-26, 08:56   #116
Mr. P-1
 
Mr. P-1's Avatar
 
Jun 2003

7·167 Posts
Default

Quote:
Originally Posted by Dubslow View Post
P-1 factoring is another way to find factors, and again, varies with circumstances. A typical assignment will take one or two days, or for a large assignment maybe three. The second stage will also use 500MB - 1GB of memory (RAM) or more if you let it.
P-1 factoring is the worktype the project most needs currently. The minimum memory requirement to be given this type of work is 300MB and you can do a perfectly respectable job with that minimum. More is better, and the client will happily gobble up as much ram as you can throw at it. The returns from allowing more memory diminish rapidly and are really quite marginal after 1GB or so.

Trial factorisation is the least needed worktype, as far as CPUs are concern. GPUs leave CPUs in the dust, and have basically made them obsolete at this task.

Last fiddled with by Mr. P-1 on 2011-10-26 at 08:59
Mr. P-1 is offline   Reply With Quote
Old 2011-10-26, 09:04   #117
Wizzard
 
Feb 2011
Bratislava

33 Posts
Default

Okay, I will consider running P-1 factoring.

You said, that GPUs can run Prime95 too or what? It means, I may run Prime95 at my graphics card? :)
Wizzard is offline   Reply With Quote
Old 2011-10-26, 09:41   #118
Mr. P-1
 
Mr. P-1's Avatar
 
Jun 2003

7·167 Posts
Default

Quote:
Originally Posted by Wizzard View Post
Okay, I will consider running P-1 factoring.

You said, that GPUs can run Prime95 too or what? It means, I may run Prime95 at my graphics card? :)
GPUS cannot run Prime95. There are, however, other programs which use some GPUs to do blisteringly fast TF and somewhat fast LL testing. These programs are not as mature as Prime95, and need more user intervention to keep things running.

Check out the GPU computing forum for more information.
Mr. P-1 is offline   Reply With Quote
Old 2011-10-26, 12:28   #119
Wizzard
 
Feb 2011
Bratislava

110112 Posts
Default

I set the memory usage to 300 MB and work type to P-1 factoring. First CPU core assigned P-1 testing, second core ECM testing. I tried to increase memory to 600 MB, but the same result, and all the memory was used to first core P-1 and that work was restarted.

Is it possible to run P-1 on both CPU cores?
Wizzard is offline   Reply With Quote
Old 2011-10-26, 13:27   #120
kladner
 
kladner's Avatar
 
"Kieren"
Jul 2011
In My Own Galaxy!

2×3×1,693 Posts
Default

Quote:
Originally Posted by Wizzard View Post
I set the memory usage to 300 MB and work type to P-1 factoring. First CPU core assigned P-1 testing, second core ECM testing. I tried to increase memory to 600 MB, but the same result, and all the memory was used to first core P-1 and that work was restarted.

Is it possible to run P-1 on both CPU cores?
You can set the assignments individually by core. Go to the Test menu>Worker Windows. If you look at individual worker numbers in the first drop-down, you can then set work type and core affinity for each one.
kladner is offline   Reply With Quote
Old 2011-10-26, 13:32   #121
Wizzard
 
Feb 2011
Bratislava

33 Posts
Default

Quote:
Originally Posted by kladner View Post
You can set the assignments individually by core. Go to the Test menu>Worker Windows. If you look at individual worker numbers in the first drop-down, you can then set work type and core affinity for each one.
Yes, but the problem is, that I have set the options for All workers to P-1 factoring and Run on any CPU.
Wizzard is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
A quick question Pegos Information & Answers 6 2016-08-11 14:39
Quick TF Question Dubslow GPU Computing 2 2011-10-27 04:49
Quick msieve question alkirah Msieve 2 2009-12-30 14:00
Quick question about P90 CPU metric stars10250 PrimeNet 9 2008-08-31 23:58
Quick p-1 question Unregistered Software 8 2006-10-13 23:35

All times are UTC. The time now is 15:16.


Fri Jul 7 15:16:13 UTC 2023 up 323 days, 12:44, 0 users, load averages: 0.82, 1.13, 1.13

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

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔