mersenneforum.org  

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

Reply
 
Thread Tools
Old 2002-11-30, 10:59   #1
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

29·41 Posts
Default Intermediate FFT runlenghts

On http://www.hogranch.com/mayer/gimps_timings.html i read about MLucas 2.7b

Quote:
Supports the same non-power-of-2 runlengths as Prime95, i.e. (1,3,5,7)*2n, plus a full set of 4 additional intermediate radices (9,11,13,15)*2n. This allows every interval between adjacent power-of-2 runlengths to be broken into eight roughly equal pieces, and runtimes to increase very gradually as exponents get larger.
Are these planned for a future version of prime95? From the timings it looks like a 10M digit test can be about 10% faster with a 1680K FFT
smh is offline   Reply With Quote
Old 2006-03-22, 22:21   #2
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

2·5,869 Posts
Default

Can't speak for George's plans (if any) in this area - the extra FFT radices may not be a good option on x86-style CPUs due to limited number of registers.

Note that the above timings page no longer exists - the current & future Mlucas main page is

http://hogranch.com/mayer/README.html
ewmayer is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Intermediate P-1 results kruoli Software 6 2018-06-24 13:44
just an intermediate arithmetic sum MattcAnderson MattcAnderson 0 2017-05-08 02:32
.bu file intermediate results zabig Information & Answers 3 2013-01-16 00:42
Error writing intermediate file Unregistered Information & Answers 6 2009-07-27 23:58
Intermediate Files ndpowell Software 3 2005-06-20 22:57

All times are UTC. The time now is 02:35.


Fri Aug 12 02:35:21 UTC 2022 up 35 days, 21:22, 2 users, load averages: 1.16, 1.29, 1.25

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

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