mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Twin Prime Search

Reply
 
Thread Tools
Old 2006-12-31, 00:55   #56
biwema
 
biwema's Avatar
 
Mar 2004

5758 Posts
Default

Quote:
Originally Posted by jasong View Post
Question: If you set it to log factors, will it log factors as soon as it gets them, or go by the update interval? The reason I ask is that I set the update interval to 10,000 minutes, thinking that only applied to the main file. I'm hoping the factors will update more frequently, and if there's a power outage I can simply update the starting point with vi.

Is this the correct way to do things?
Yes. The factors are written immediately.
If you set the update interval to a high level, you risk to lose the whole sieving time after the last factor was found. In this sieving project the factor density is so high that it will be no problem, at all.
Besides that you save the intermediate file saving time (around 90 sec every time)
biwema is offline   Reply With Quote
Old 2007-01-16, 06:55   #57
Skligmund
 
Skligmund's Avatar
 
Dec 2006
Anchorage, Alaska

10011102 Posts
Default

I'm averaging about 3.5-4.0 k/sec (times 2) sieving 333,333 on my X2 3800+, how is everybody else doing? I just want to benchmark myself is all.
Skligmund is offline   Reply With Quote
Old 2007-01-16, 12:52   #58
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

11×37 Posts
Default

Celeron 1200Mhz: 14.5-15.5 k/sec
Athlon 2500+ 1800Mhz: 4-6 k/sec
Athlon64 3000+ 1800Mhz: 4-5.5 k/sec
gribozavr is offline   Reply With Quote
Old 2007-01-16, 14:26   #59
jmblazek
 
jmblazek's Avatar
 
Nov 2006
Earth

26 Posts
Default

I must be doing something wrong. My AMD Athlon(tm) 64 3400+ is only doing 1 k per 2.5-3.0 seconds. Any ideas???

I'm currently working on 500T-550T.
jmblazek is offline   Reply With Quote
Old 2007-01-16, 15:38   #60
Skligmund
 
Skligmund's Avatar
 
Dec 2006
Anchorage, Alaska

2·3·13 Posts
Default

I mis-typed..

3.5-4 sec/k
Skligmund is offline   Reply With Quote
Old 2007-01-16, 15:49   #61
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

3×547 Posts
Default

Quote:
Originally Posted by jmblazek View Post
I must be doing something wrong. My AMD Athlon(tm) 64 3400+ is only doing 1 k per 2.5-3.0 seconds. Any ideas???

I'm currently working on 500T-550T.
Sieving k/sec rate depends on the sieving depth, you can sieve about 2 times slower at 500T than if you would sieve at 250T.
R. Gerbicz is offline   Reply With Quote
Old 2007-01-16, 16:27   #62
jmblazek
 
jmblazek's Avatar
 
Nov 2006
Earth

1008 Posts
Default

Quote:
Originally Posted by Skligmund View Post
I mis-typed..

3.5-4 sec/k
Whew...that makes sense now...since you're working about 300T deeper.
jmblazek is offline   Reply With Quote
Old 2007-01-18, 13:30   #63
Cybertronic
 
Cybertronic's Avatar
 
Jan 2007
Germany

3×239 Posts
Default

Quote:
Originally Posted by MooooMoo View Post
The problems with both ideas is the huge size of the new output file and the factor list.
Is not the problem, I think. We can write a program that give us all reduce numbers ( The number is not in the new file after sieving ) The MASTER ADMIN taks the small file and reduce from file 32ye9b also with a special program. I work with 2 PCs and this is for my project very helpfull when I sieve serveral ranges.

best

Last fiddled with by Cybertronic on 2007-01-18 at 13:34
Cybertronic is offline   Reply With Quote
Old 2007-01-19, 05:44   #64
MooMoo2
 
MooMoo2's Avatar
 
"Michael Kwok"
Mar 2006

1,181 Posts
Default If anyone's curious...

For n=195000, we actually sieved far more than the previous record holders did. They sieved only to 281T, while we got over 1000T (see http://www.hpc-europa.org/index.php?...i_high/csajbok)

The number of Intel Itanium 2 processors they used "varied between 1 and 96" while they were working on getting their previous record twin.

They had a total of 5 million candidates after sieving (out of an original 8.5 billion). This means they were probably choosing a range that had an ~80% certainty of containing a twin. It would be equivalent to sieving n=195000 from 1-22G.

Last fiddled with by MooMoo2 on 2007-01-19 at 05:52 Reason: adding more info
MooMoo2 is offline   Reply With Quote
Old 2007-01-19, 23:59   #65
Skligmund
 
Skligmund's Avatar
 
Dec 2006
Anchorage, Alaska

1168 Posts
Default

Quote:
Originally Posted by MooooMoo View Post
- somewhere to upload the new output file, so that NewPGen's feature for " merging files across several machines" can be used.
I can't figure out how to use that on my own computers. The instructions are confusing at best. I know this is the wrong thread for this, but it only made sense here. If anybody knows how this works, let me know. Maybe make a simple tutorial for it?
Skligmund is offline   Reply With Quote
Old 2007-01-20, 00:22   #66
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

11×37 Posts
Default

If you want to report results, you don't need to upload the datafile; only newpgen.del file is needed. Of cource, unless you forgot to set newpgen to log factors.
gribozavr is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
S9 and general sieving discussion Lennart Conjectures 'R Us 31 2014-09-14 15:14
Sieving discussion thread philmoore Five or Bust - The Dual Sierpinski Problem 66 2010-02-10 14:34
Combined sieving discussion ltd Prime Sierpinski Project 76 2008-07-25 11:44
Sieving Discussion ltd Prime Sierpinski Project 26 2005-11-01 07:45
Sieving Discussion R.D. Silverman Factoring 7 2005-09-30 12:57

All times are UTC. The time now is 13:38.


Fri Jul 7 13:38:49 UTC 2023 up 323 days, 11:07, 0 users, load averages: 0.97, 1.10, 1.15

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.

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