[quote]My wife recently acquired a nice box (quad-core Intel, 2G RAM) running Vista. Sadly, it's 32-bit Vista because that's what it was shipped with, for compatability reasons presumably.[/quote]
This [I]may[/I] help, depending on what kind of license you have.

[url]http://www.microsoft.com/windowsvista/1033/ordermedia/[/url]

[QUOTE=Xyzzy;120170]This [I]may[/I] help, depending on what kind of license you have.

[url]http://www.microsoft.com/windowsvista/1033/ordermedia/[/url][/QUOTE]Thanks for the link. As it turns out, I've a copy of Ultimate anyway which includes the 64-bit version (it helps to have contacts inside MS Research :smile:) but it's not at all clear to me that the other software my wife wants and/or needs will run on a 64-bit OS. Finding out by experiment would be lengthy and disruptive...

Paul

[QUOTE=xilman;120154]Unfortunately, it was finding one relation every ten seconds, whereas my AMD64-3500+ finds them at ten relations per second. [/QUOTE]

A stab in the dark here... What's your rational polynomial? In particular, for Y1 x + Y0, is |Y1| < |Y0|? Not sure why, but Franke's source as packaged in GGNFS has been modified to assume that.

Greg

[QUOTE=frmky;120192]A stab in the dark here... What's your rational polynomial? In particular, for Y1 x + Y0, is |Y1| < |Y0|? Not sure why, but Franke's source as packaged in GGNFS has been modified to assume that.

Greg[/QUOTE]It is. The complete polynomial data is:

[code]
# BEGIN POLY #skewness 110322.87 norm 7.95e+21 alpha -6.84 Murphy_E 2.26e-12
118712091342021588844551391224983466219472825777062442260235956048963333118873331031954358817043620119241862884145836257143600744584924535114573561887470661
X5 6763456800
X4 -395072857519820
X3 -283736888636875406448
X2 4843227440564246376944509
X1 905999524978115311017408127172
X0 -27454379309543633644049032931393445
Y1 17375840997103391
Y0 -111909060020623260787928087972
M 52992360536337362244606905134124738467589762040137638374213827713699645902092270935967090899191588243743867448048204950726335414144026835944804504933976770
[/code]

Paul

[QUOTE=xilman;120217]It is. The complete polynomial data is:

Paul[/QUOTE]

I'm not sure what sieve parameters you're using, but I assumed 28-bit large primes and FB limits of 20M on each side. With these gnfs-lasieve4I14e was taking 0.75 sec/rel on a 1.7 GHz Pentium M. The Intel quad-core should take half that time per relation per core. Below is the poly file I used.

[CODE]name: paul
type: gnfs
n: 118712091342021588844551391224983466219472825777062442260235956048963333118873331031954358817043620119241862884145836257143600744584924535114573561887470661
c5: 6763456800
c4: -395072857519820
c3: -283736888636875406448
c2: 4843227440564246376944509
c1: 905999524978115311017408127172
c0: -27454379309543633644049032931393445
Y1: 17375840997103391
Y0: -111909060020623260787928087972
skew: 110322.87
alim: 20000000
rlim: 20000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56[/CODE]

Or, if you don't want to use the perl script, you can just run it directly as
gnfs-lasieve4I14e -k -o spairs.out -v -n0 -a paul.job
with the following job file, with q0 and qintsize appropriately adjusted.
[CODE]n: 118712091342021588844551391224983466219472825777062442260235956048963333118873331031954358817043620119241862884145836257143600744584924535114573561887470661
m:
c5: 6763456800
c4: -395072857519820
c3: -283736888636875406448
c2: 4843227440564246376944509
c1: 905999524978115311017408127172
c0: -27454379309543633644049032931393445
Y1: 17375840997103391
Y0: -111909060020623260787928087972
skew: 110322.87
rlim: 20000000
alim: 20000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56
rlambda: 2.5
alambda: 2.5
q0: 21000000
qintsize: 5000
#q1:21005000
[/CODE]

Greg

[QUOTE=frmky;120241]I'm not sure what sieve parameters you're using, but I assumed 28-bit large primes and FB limits of 20M on each side. With these gnfs-lasieve4I14e was taking 0.75 sec/rel on a 1.7 GHz Pentium M. The Intel quad-core should take half that time per relation per core. Below is the poly file I used.[/QUOTE]Thanks Greg. I was actually using 30-bit large primes , rational base to 45M and algebraic base starting at 20M and raising as sieving progresses. Whether these values are appropriate or not is a separate question, because I was using exactly the same values with Franke's original code on the AMD64 system. The ratio was, as stated earlier, 10 per second or 1 every ten seconds. My job file looked very similar to yours -- the major difference bbeing my lambda was 2.1.

I'll see what happens

Paul

[QUOTE=xilman;120269]Thanks Greg. I was actually using 30-bit large primes , rational base to 45M and algebraic base starting at 20M and raising as sieving progresses. Whether these values are appropriate or not is a separate question, because I was using exactly the same values with Franke's original code on the AMD64 system. The ratio was, as stated earlier, 10 per second or 1 every ten seconds. My job file looked very similar to yours -- the major difference bbeing my lambda was 2.1.[/QUOTE]

The 32-bit sieve in GGNFS shouldn't be much slower than Franke's original code. With 30-bit large primes, raise mfbr/a to 60 or 61.

Greg

[QUOTE=frmky;120286]The 32-bit sieve in GGNFS shouldn't be much slower than Franke's original code. With 30-bit large primes, raise mfbr/a to 60 or 61.[/QUOTE]Not had chance to re-run the tests on my wife's machine (she's been using it) but I'll not that both mfbr and mfba are 60.

Paul

I've done a few small tests with the windows P4 executables from sourceforge on my dual core 2,1 GHz laptop.

[QUOTE=frmky;120241][CODE]name: paul
type: gnfs
n: 118712091342021588844551391224983466219472825777062442260235956048963333118873331031954358817043620119241862884145836257143600744584924535114573561887470661
c5: 6763456800
c4: -395072857519820
c3: -283736888636875406448
c2: 4843227440564246376944509
c1: 905999524978115311017408127172
c0: -27454379309543633644049032931393445
Y1: 17375840997103391
Y0: -111909060020623260787928087972
skew: 110322.87
alim: 20000000
rlim: 20000000
lpbr: 28
lpba: 28
mfbr: 56
mfba: 56[/CODE][/QUOTE]
-> Selected lattice siever: ../../bin/gnfs-lasieve4I14e.exe
-> Creating param file to detect parameter changes...
=> Could not recover q0: field from job file paul.job!
-> minimum number of FF's: 2797560
-> Q0=10000000, QSTEP=60000.
-> makeJobFile(): q0=10000000, q1=10060000.
-> makeJobFile(): Adjusted to q0=10000000, q1=10060000.
-> Lattice sieving algebraic q-values from q=10000000 to 10060000.
=> "../../bin/gnfs-lasieve4I14e.exe" -k -o spairs.out -v -n0 -a paul.job
FBsize 666719+0 (deg 5), 1270606+0 (deg 1)
total yield: 263, q=10000457 (0.39765 sec/rel)


[QUOTE][CODE]name: paul
type: gnfs
n: 118712091342021588844551391224983466219472825777062442260235956048963333118873331031954358817043620119241862884145836257143600744584924535114573561887470661
c5: 6763456800
c4: -395072857519820
c3: -283736888636875406448
c2: 4843227440564246376944509
c1: 905999524978115311017408127172
c0: -27454379309543633644049032931393445
Y1: 17375840997103391
Y0: -111909060020623260787928087972
skew: 110322.87
alim: 45000000
rlim: 45000000
lpbr: 30
lpba: 30
mfbr: 60
mfba: 60
rlambda: 2.1
alambda: 2.1[/CODE][/QUOTE]-> Q0=22500000, QSTEP=60000.
-> makeJobFile(): q0=22500000, q1=22560000.
-> makeJobFile(): Adjusted to q0=22500000, q1=22560000.
-> Lattice sieving algebraic q-values from q=22500000 to 22560000.
=> "../../bin/gnfs-lasieve4I14e.exe" -k -o spairs.out -v -n0 -a paul.job
FBsize 1421069+0 (deg 5), 2718159+0 (deg 1)
total yield: 303, q=22500323 (0.45410 sec/rel)

With kambda 2.4 i get much better results:

-> Q0=22500000, QSTEP=60000.
-> makeJobFile(): q0=22500000, q1=22560000.
-> makeJobFile(): Adjusted to q0=22500000, q1=22560000.
-> Lattice sieving algebraic q-values from q=22500000 to 22560000.
=> "../../bin/gnfs-lasieve4I14e.exe" -k -o spairs.out -v -n0 -a paul.job
FBsize 1421069+0 (deg 5), 2718159+0 (deg 1)
total yield: 528, q=22500211 (0.14956 sec/rel)

I can do some sieving for you if needed.

[QUOTE=smh;120419]I've done a few small tests with the windows P4 executables from sourceforge on my dual core 2,1 GHz laptop.
...

total yield: 528, q=22500211 (0.14956 sec/rel)

I can do some sieving for you if needed.[/QUOTE]Thanks Sander.

Sieveing per se is not the problem --- I can find up to 20 Athlon boxes to help out --- but discovering why the Vista box steadfastly refuses to give me more that one relation per 10 seconds is of great interest. I'm probably doing something stupid somewhere but will persevere for a while longer before admitting defeat.

Paul

[QUOTE=xilman;120424]Thanks Sander.

Sieveing per se is not the problem --- I can find up to 20 Athlon boxes to help out --- but discovering why the Vista box steadfastly refuses to give me more that one relation per 10 seconds is of great interest. I'm probably doing something stupid somewhere but will persevere for a while longer before admitting defeat.

Paul[/QUOTE]


Have you checked memory usage/paging while it is running?

It sounds WEIRD.