mersenneforum.org  

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

Reply
 
Thread Tools
Old 2008-09-30, 09:23   #1
dtripp
 

336410 Posts
Default Parallel version of Prime for HPC?

Does anyone know of a parallel implementation of prime search for distributed memory clusters. I tinkered around with building one a while back, but time isn't on my side. I know it would be a large undertaking to create an MPI version and post it to GIMPS, but I know of many HPC centers where large scale machines site idle part of the time. I could dedicate a couple million CPU hours to the project if there was a parallel version. I have found some MPI versions of FFT, but I'm not a mathematician, I'm a HPC system admin with a background in hardware, a BS in CS, but as my teachers would tell you, I'm not that great at mathematics! I like to reply back "a computer can add, and all the rest if just decompositions of that".

Thanks for the help,

- Donald Tripp
University of Hawaii, Hilo
  Reply With Quote
Old 2008-09-30, 09:56   #2
BotXXX
 
BotXXX's Avatar
 
Aug 2003
Europe

3028 Posts
Default

Best bet would probably one of the following:
- Mlucas program by Ernst Mayer of Cupertino California USA.
- Glucas program by Guillermo Ballester Valor of Granada, Spain.
Both programs are used in the verification of primes discovered by GIMPS and run on HPC.
BotXXX is offline   Reply With Quote
Old 2008-09-30, 11:12   #3
ldesnogu
 
ldesnogu's Avatar
 
Jan 2008
France

22·149 Posts
Default

Quote:
Originally Posted by dtripp View Post
Does anyone know of a parallel implementation of prime search for distributed memory clusters.
If you are talking about networked clusters, I don't think a parallel implementation will be efficient since bandwidth is a real concern.

IIRC Ernst wrote somewhere on this forum that he would release a newer parallel version of his Mlucas program, the one that was used to double-check the 2 latest primes found. But my memory has been proven wrong enough that you should not trust me blindly :)

Last fiddled with by ldesnogu on 2008-09-30 at 11:15
ldesnogu is offline   Reply With Quote
Old 2008-09-30, 19:52   #4
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

5×2,351 Posts
Default

Quote:
Originally Posted by ldesnogu View Post
IIRC Ernst wrote somewhere on this forum that he would release a newer parallel version of his Mlucas program, the one that was used to double-check the 2 latest primes found. But my memory has been proven wrong enough that you should not trust me blindly :)
Your recall is correct - in the time leading up to the official release [no form date yet, let's just say "hopefully before end of the year"], anyone who wants a zip archive of the current code snapshot can simply e-mail me at ewmayer@aol.com . Please note that would-be builders should be experienced enough to work through the more-obvious kinds of platform-related build issues [e.g. tweaking the compiler options as needed] themselves, as my support bandwidth is extremely limited.
ewmayer is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime Gap Search latest version of the c code pinhodecarlos Prime Gap Searches 170 2019-12-10 19:33
What's the best way to use PFGW in parallel? CRGreathouse Information & Answers 4 2016-03-06 00:21
Which bits of gmp-ecm are now parallel? fivemack GMP-ECM 5 2010-09-05 06:49
Parallel memory bandwidth fivemack Factoring 14 2008-06-11 20:43
Parallel Prime Search DonaldTripp Software 2 2007-02-17 19:35

All times are UTC. The time now is 18:50.


Wed Feb 1 18:50:28 UTC 2023 up 167 days, 16:19, 0 users, load averages: 0.78, 0.87, 1.06

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.

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