mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Msieve

Reply
 
Thread Tools
Old 2009-10-24, 14:21   #1
Jeff Gilchrist
 
Jeff Gilchrist's Avatar
 
Jun 2003
Ottawa, Canada

49516 Posts
Default Msieve 1.43 feedback

Hi Jason,

Can you please be careful with updating util.h since the latest 1.43 build no longer compiles in Visual Studio.

Brian has updated SVN with putting the fix back into util.h but somehow it keeps disappearing.

Jeff.
Jeff Gilchrist is offline   Reply With Quote
Old 2009-10-24, 15:26   #2
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

2·29·61 Posts
Default

I removed the reference to the function rint() a few releases ago because AFAICT it was only used in stage 2 of NFS poly selection, and that code was modified not to need it a long time ago. What's the compile error in question?
jasonp is offline   Reply With Quote
Old 2009-10-24, 15:33   #3
Brian Gladman
 
Brian Gladman's Avatar
 
May 2008
Worcester, United Kingdom

2·263 Posts
Default

Quote:
Originally Posted by jasonp View Post
I removed the reference to the function rint() a few releases ago because AFAICT it was only used in stage 2 of NFS poly selection, and that code was modified not to need it a long time ago. What's the compile error in question?
Line 1369 in lanczos.c:

dump_interval = 10000 * (int)rint(5.0e7 / ncols);

needs it.

Brian
Brian Gladman is offline   Reply With Quote
Old 2009-10-24, 16:24   #4
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

353810 Posts
Default

Ah, I didn't see that. Serge, please check with Brian if you're going to use non-C89 math functions; MSVC probably doesn't have them and we'll need a windows substitute.

Last fiddled with by jasonp on 2009-10-24 at 16:26
jasonp is offline   Reply With Quote
Old 2009-10-24, 19:01   #5
Jeff Gilchrist
 
Jeff Gilchrist's Avatar
 
Jun 2003
Ottawa, Canada

3×17×23 Posts
Default

For anyone waiting for the 64bit or 32bit Windows VS binaries, they are finally available, compiled with the latest MPIR (1.3.0) and GMP-ECM (SVN 1422):
http://gilchrist.ca/jeff/factoring/
Jeff Gilchrist is offline   Reply With Quote
Old 2009-10-24, 19:23   #6
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

24DB16 Posts
Default

Quote:
Originally Posted by jasonp View Post
Ah, I didn't see that. Serge, please check with Brian if you're going to use non-C89 math functions; MSVC probably doesn't have them and we'll need a windows substitute.
Sorry, it stuck in my mind that we have it in redu2.c anyway, ...but thinking about it, it is the lat.siever source, not part of msieve. I'll replace it with floor(x+0.5).
Batalov is offline   Reply With Quote
Old 2009-11-03, 17:30   #7
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

2×17×73 Posts
Default Feature request: 75-digit GNFS

Quote:
Originally Posted by Jeff Gilchrist View Post
I have built new Windows 32bit and 64bit ggnfs binaries based on the SVN 374 version of the ggnfs code. You can download them here: http://gilchrist.ca/jeff/factoring/

Hopefully this fixes the crashes a few people have been experiencing, it also removes the garbage output in the 64bit sievers, and adds an 11e siever for doing smaller jobs. Andi47 did some benchmarks and found that C85's are about 20% faster with the 11e and about 4% faster at C93 vs the 12e siever.
@Jasonp: As the result of my benchmark with the 11e siever suggests that the crossover between QS and GNFS shifts down by several digits, maybe as low as 75(?) digits. So can you please add a support for such small GNFS-factorizations (Poly search and postprocessing)?

BTW: Maybe cubic polynomials might become interesting for 50-digit GNFS-factorizations?

Last fiddled with by Andi47 on 2009-11-03 at 17:30
Andi47 is offline   Reply With Quote
Old 2009-11-04, 03:43   #8
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

2·29·61 Posts
Default

The postprocessing should work at that small size now; polynomial selection just needs to be allowed. It's an easy change.
jasonp is offline   Reply With Quote
Old 2009-11-13, 14:35   #9
Jeff Gilchrist
 
Jeff Gilchrist's Avatar
 
Jun 2003
Ottawa, Canada

3·17·23 Posts
Default

How does checkpointing work for the linear algebra in msieve?

Does it write a check point after at certain time intervals, or % complete intervals, or what does it use?

If have a job running on a 64bit Windows (VS2008 built) binary but when I hit CTRL-C and stopped it, there was no .chk file generated so I couldn't use -ncr to resume, I had to start -nc2 over again.

It has been been running again now for almost an hour:

linear algebra completed 82974 of 5491375 dimensions (1.5%, ETA 51h42m)

and still no check point file yet. Is that normal?

Jeff.

Last fiddled with by Jeff Gilchrist on 2009-11-13 at 14:36
Jeff Gilchrist is offline   Reply With Quote
Old 2009-11-14, 02:51   #10
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

2·29·61 Posts
Default

Quote:
Originally Posted by Jeff Gilchrist View Post
How does checkpointing work for the linear algebra in msieve?

Does it write a check point after at certain time intervals, or % complete intervals, or what does it use?

If have a job running on a 64bit Windows (VS2008 built) binary but when I hit CTRL-C and stopped it, there was no .chk file generated so I couldn't use -ncr to resume, I had to start -nc2 over again.

It has been been running again now for almost an hour:

linear algebra completed 82974 of 5491375 dimensions (1.5%, ETA 51h42m)

and still no check point file yet. Is that normal?

Jeff.
Originally the checkpointing code would write a checkpoint after a fixed number of dimensions were completed, with the specified number of dimensions going down as the problem size increased (since each iteration is slower). I was shooting for a checkpoint every three hours or so. Serge later made the code more sensitive to the matrix dimension, and calibrated it to write a checkpoint about once per hour (presumably using timings from one of his machines).

Did the checkpoint ever arrive for you?
jasonp is offline   Reply With Quote
Old 2009-11-14, 03:49   #11
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

3·5·17·37 Posts
Default

The speed seems roughly reciprocal to the size (in the large size range; yeah, there must be a log somewhere, but it's not important), so I left it hitting the same product 5*1011(for 2M2 matrix, every 250K iterations; for 5M2, every 100K, for 12.5M2, every 40K iterations); for most computers the checkpoint should be written every 1-3 hours.

There will be no chk, if the matrix is less than 1M2.
Batalov is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Msieve 1.53 feedback xilman Msieve 149 2018-11-12 06:37
Msieve 1.50 feedback firejuggler Msieve 99 2013-02-17 11:53
Msieve v1.48 feedback Jeff Gilchrist Msieve 48 2011-06-10 18:18
Msieve 1.42 feedback Andi47 Msieve 167 2009-10-18 19:37
Msieve 1.41 Feedback Batalov Msieve 130 2009-06-09 16:01

All times are UTC. The time now is 17:17.

Sun May 16 17:17:14 UTC 2021 up 38 days, 11:58, 1 user, load averages: 3.35, 3.66, 3.85

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