![]() |
|
|
#540 |
|
May 2008
3×5×73 Posts |
|
|
|
|
|
|
#541 | |
|
Apr 2010
Over the rainbow
19×137 Posts |
the main problem is that i do not know *how* to compile msieve. i'm on Win XP.
Quote:
Last fiddled with by firejuggler on 2011-01-20 at 22:56 |
|
|
|
|
|
|
#542 | |
|
May 2008
3×5×73 Posts |
Quote:
Brian Gladman maintains the Visual Studio (2010) build files for msieve so it should be able to build in VS without too much trouble. |
|
|
|
|
|
|
#543 |
|
May 2008
Worcester, United Kingdom
22×7×19 Posts |
Provided you have built MPIR, Visual Studio 2010 will build the non-CUDA version of msieve 'out of the box'. The free Visual Studio C++ Express 2010 can build msieve for win32 and, if the free Windows 7.1 SDK is installed, for x64 as well.
The CUDA version of msieve can only be built with the full Visual Studio 2010 product and also requires Nvidia Parallel Nsight. Brian Last fiddled with by Brian Gladman on 2011-01-20 at 23:52 |
|
|
|
|
|
#544 |
|
Apr 2010
Over the rainbow
A2B16 Posts |
As I can't afford it, i'll guess i'll wait for someone to compile it for me. Or continue to use 1.44 gpu. Or try again tommorow.
|
|
|
|
|
|
#545 |
|
May 2008
100010001112 Posts |
Actually, aren't there already v1.48 Windows builds (with and without CUDA) on the SF files page?
Yes, see here: http://sourceforge.net/projects/msie.../Msieve v1.48/ The Windows CUDA build is in msieve148_gpu.zip and the non-CUDA build is in msieve148.zip. The CUDA build has both the regular and "fermi-tuned" GPU kernels available, so use what you need. |
|
|
|
|
|
#546 |
|
Apr 2010
Over the rainbow
19×137 Posts |
Ah. Thank you. I didn't notice that page (up till now i only seen 'normal' 1.48) . Many, many thanks
Last fiddled with by firejuggler on 2011-01-21 at 00:56 |
|
|
|
|
|
#547 |
|
Sep 2004
2×5×283 Posts |
Under your script Brian, what's the relation between polynomial search time with the composite size?
Thank you. Carlos |
|
|
|
|
|
#548 |
|
May 2008
Worcester, United Kingdom
22·7·19 Posts |
If I recall correctly, I didn't intentionally change the way this is done in the original Perl script so it should be the same as it used to be. I didn't look in any detail at the sematics of the original Perl so I can't answer your question without going back and analysing how this works.
|
|
|
|
|
|
#549 |
|
Tribal Bullet
Oct 2004
1101110101112 Posts |
Unless the scripts force a shutdown early, the internal time limit for poly selection is a linear interpolation between the entries of the following table.
Note that there is no consideration for parallel poly selection or for the number of sieving machines that are waiting for the poly selection to complete. Also, if you run with '-np X,Y' to search for a polynomial in a particular range, then there is no limit on the time spent (but a limit on the amount of time given to each of the leading coefficients between X and Y). Code:
static const poly_deadline_t time_limits[] = {
{MIN_NFS_BITS, 4 * 60},
{304, 8 * 60},
{320, 15 * 60},
{348, 30 * 60},
{365, 1 * 3600},
{383, 2 * 3600},
{399, 4 * 3600},
{416, 8 * 3600},
{433, 16 * 3600},
{449, 32 * 3600},
{466, 64 * 3600},
{482, 100 * 3600},
{498, 200 * 3600},
{514, 300 * 3600},
};
|
|
|
|
|
|
#550 |
|
Sep 2009
2×7×149 Posts |
What would you recommend for the ratio between time searching for polynomials and time sieving? I'm doing a c145 (with my trick to pipeline polynomial selection), stage 1 said "searching leading coefficients from 1 to 1614000" and it's got to 3132 in 1 day. Which will take much longer to reach 1614000 that the sieving will.
It also said "time limit set to 93.25 hours" but does it stop then when just running stage 1? I've also noticed that stage 1 has used 7 CPU hours in 1 day, stage 2 used 1 day per day. This is on a dual core AMD. Chris K |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Msieve & ggnfs on MacOS | xilman | Msieve | 8 | 2017-05-20 00:12 |
| Factorizing with MSIEVE, GGNFS & Factmsieve.py | Romuald | Msieve | 24 | 2015-11-09 20:16 |
| Infinite loop for ggnfs or msieve | Greebley | Aliquot Sequences | 4 | 2013-02-06 19:28 |
| Error running GGNFS+msieve+factmsieve.py | D. B. Staple | Factoring | 6 | 2011-06-12 22:23 |
| A new driver? (or type of driver?) | 10metreh | Aliquot Sequences | 3 | 2010-02-15 15:57 |