![]() |
|
|
#1 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
250516 Posts |
Ok, since the Schlendrian/shenenigan brach was removed, so was my promise to add the resume option - but I did add it now and will crosspost about it here. You are welcome to get the tarball, build and try the -R option. I tested it, of course, but YMMV. Keep your existing binaries before you like the new ones.
|
|
|
|
|
|
#2 | |
|
Oct 2004
Austria
248210 Posts |
Quote:
edit: the option for rational side sieving is -r, so I assume that -r (minuscle r) is still for r-side sieving and -R (majuscle R) is for resuming? Last fiddled with by Andi47 on 2008-12-19 at 09:02 Reason: -r, -R |
|
|
|
|
|
|
#3 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
of course. (-r and -R are separate).
Binaries: I will post an Opteron x64_64 binary tomorrow, but Windows I simply do not use. Cannot help it! Last fiddled with by Batalov on 2008-12-19 at 09:37 |
|
|
|
|
|
#4 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
72×131 Posts |
I notice that the 64-bit Opteron assembly code hasn't got into the SVN repository:
Code:
crick% svn co https://ggnfs.svn.sourceforge.net/svnroot/ggnfs ggnfs ...output... crick% cd ggnfs/trunk; make nocona ...output... crick% bin/gnfs-lasieve4I15e -r ~/math/2+925/2+925.60.poly -f 60000000 -c 1000 total yield: 1278, q=60001021 (0.92806 sec/rel) crick% ~/math/64bit_new/gnfs-lasieve4I15e -r ~/math/2+925/2+925.60.poly -f 60000000 -c 1000 total yield: 1278, q=60001021 (0.49510 sec/rel) |
|
|
|
|
|
#5 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
Correct. The Opteron speed will not be comparable. But if you have the assembly part, you may want to combine these two sources.
The holders (not sure about the original authors) of the 64-bit Opteron assembly code have the SVN access. If the original author would be so inclined, this code would have been merged long ago. But it wasn't. There must be a reason behind it. From this, I take that I cannot commit it either. But we can share the Opteron binaries (I take it from Greg's posting of the binary in Feb and March.) |
|
|
|
|
|
#6 | |
|
Jul 2003
So Cal
83A16 Posts |
Quote:
|
|
|
|
|
|
|
#7 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
250516 Posts |
Yes, this an understandable hassle. Well, the author did much more work than I can add, so that chore is fair in my book.
OK, I'll give it a try next week. Indeed, some formatting and minimal cleaning will be needed. I can do that. (So that it would merge as just the necessary, say, 20 lines here and there, not like a "-500/+520 lines" patch.) I will test-build on Linux x86_64 and MinGW (I never commit a non-compiling code), but some other platforms may get broken - I don't have too much variety in my comps. It would be nice if a name of the real developer of the assembly part could be added to those additional files. Was it Joppe Bos, and/or you, and/or someone else? |
|
|
|
|
|
#8 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
P.S. The search function of the forum is "like a box of chocolates - you never know what you're gonna get." I thought that I've previously found all the obscure posts about the siever's code... but I was wrong (this time the search item was "Joppe Bos") - now found this (of course the name of the thread with three "?" marks usually flags for me as cranky)... So that was the first sighting of the asm code. Earlier it was mentioned in this thread about a GNFS-156. So, is it the same code these threads are talking about? Thx.
|
|
|
|
|
|
#9 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
191316 Posts |
When using the 2+925.poly file with rlim set to 68000000 and the command line
../../64bit_new/gnfs-lasieve4I15e -r 2+925.68.poly -f 68000000 -c 500000 (IE frmky's executable), I'm getting bad-schedule messages on many primes. Same with -f 68500000 No problems at all with 2+925.69.poly (ie rlim=69000000) and -f 69000000 or 69500000; no problems with 67. ../../64bit_new/gnfs-lasieve4I15e -r 2+925.68.poly -f 68121120 -c 2 is a test-case which produces a bad schedule. The badsched messages come, as far as I can see, from a test in do_schedule which refers to things produced in lasched.c which is the absolute heartwood of the program. |
|
|
|
|
|
#10 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
(I realize the above bug report is for anyone, not for me) For this beast, I am at best a veterinarian, not a heart surgeon. You see, it is very hard to debug what happens after the code returns from the assembly-optimized part.
I can only remark to that debug case that there was a 1 relation discrepancy between the GGNFS and the Greg's binary when many people first tried it in that thread... (2206 vs. 2207/15e and 1096 vs. 1097/14e) May or may not be related. I find it minor, compared to the infinite loop in reduce2() which may get your process stuck (if unsupervised) for a week or a month. Another open bug/feature to mention: It is also well known to those who does small numbers that there are many of "mpqs failed" messages trickling. Quite specifically in small numbers, let's say, snfs-110... On bigger numbers, these messages don't happen. Also minor. |
|
|
|
|
|
#11 | |
|
Oct 2004
Austria
9B216 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Compiling 64 bit lattice siever on gcc 4.8.5 | chris2be8 | Factoring | 6 | 2018-02-06 17:22 |
| Large FFT tweaking | Zerowalker | Information & Answers | 8 | 2013-04-19 15:01 |
| Tweaking RAM & CPU | lorgix | Hardware | 45 | 2012-04-11 02:01 |
| Tweaking polynomial search for C197 | fivemack | Msieve | 38 | 2011-07-08 08:12 |
| RSA200 factored by Kleinjung et al. | sean | NFSNET Discussion | 1 | 2005-05-11 14:25 |