![]() |
![]() |
#1 |
Jun 2007
Moscow,Russia
7×19 Posts |
![]()
I am going to use cluster for factorization problems. It is under SuSe Linux Enterprise Server 10, with mvapich2-0.9.8 ,
gcc 4.1.0, Intel FORTRAN compiler 9.1, Intel C/C++ compiler 9.1, and some extra software : Blas2, NAG Parallel Library installed. What steps should I do to implement GGNFS on this cluster (and to make the most productivity)? Last fiddled with by VolMike on 2008-01-19 at 23:06 |
![]() |
![]() |
![]() |
#2 |
Jun 2007
Moscow,Russia
7×19 Posts |
![]()
Well,did somebody use GGNFS on linux cluster?
|
![]() |
![]() |
![]() |
#3 |
Tribal Bullet
Oct 2004
5×709 Posts |
![]()
I'm sure several people do, but I think nobody has responded because we're not sure where to start with answering your question. Why does it matter that you have all of these nice things installed on your cluster if GGNFS does not use them, and is only known to work with gcc? Msieve may be able to work with the Intel tools, but nobody has tried that I know of. That you're asking a question this basic means that you haven't done any homework before asking for advice.
Grab the latest SVN revision of GGNFS from sourceforge, build with gcc, try running a few small jobs yourself. Factoring RSA100 is a good start. The perl script can run multiple sieve jobs in parallel, try using that after you know that everything works correctly on a single machine Last fiddled with by jasonp on 2008-01-22 at 13:58 |
![]() |
![]() |
![]() |
#4 | |
Jun 2007
Moscow,Russia
7·19 Posts |
![]() Quote:
But I really don't know how (if it's needed) to improve the sources to be worked under cluster. That's why I'am interesting if sources should be changed to get more productivity on cluster, or I can just simply compile original sources and result program automaticly starts work with all 32 processors. |
|
![]() |
![]() |
![]() |
#5 | |
Tribal Bullet
Oct 2004
5·709 Posts |
![]() Quote:
Sieving and polynomial selection are both essentially completely parallel, so you don't need a cluster with fast interconnect to get high efficiency out of many machines. A cluster can be useful for the linear algebra phase of the postprocessing, but the code changes needed to implement cluster-aware linear algebra would be quite complex. Even if they were made, it only makes sense to use your cluster on very large factorizations, which would probably tie up the cluster for longer than you are allowed. |
|
![]() |
![]() |
![]() |
#6 | |
Jun 2003
The Texas Hill Country
32·112 Posts |
![]() Quote:
On the other hand, the linear algebra is highly coupled. The ability of the many processors to synchronize and exchange information becomes the limiting factor. |
|
![]() |
![]() |
![]() |
#7 |
Dec 2007
2×17 Posts |
![]()
There has been a factMsieve.pl Perl script posted which allows the (highly) automated usage of MSieve alongside the Lattice sievers. It replaces the factLat.pl script.
You may want to check the posts on the GGNFS Yahoo group regarding this. http://tech.groups.yahoo.com/group/ggnfs/message/2195 Essentially it brings together the best of GGNFS and MSieve, resulting in a nice marriage. Note that it is still a bit rough around the edges, but it does work. So far I've used it to crack two composites. |
![]() |
![]() |
![]() |
#8 | |
"Ben"
Feb 2007
7×11×47 Posts |
![]() Quote:
- ben. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Cluster software | fivemack | Software | 5 | 2016-09-27 22:13 |
rc.local in SuSE linux? | patrik | Linux | 3 | 2006-09-25 14:00 |
Linux/SUSE noob trouble - Resize partition | OmbooHankvald | Linux | 19 | 2005-11-18 10:39 |
Simple question Suse 9.0 | Faraday | Linux | 13 | 2005-06-01 02:22 |
Prime95 on a Cluster??? | georgekh | Software | 22 | 2004-11-09 14:39 |