If you stop it, you can safely restart it with

nice -19 ./msieve -s L1378.dat -l L1378.log -i L1378.ini -nf L1378.fb -ncr -nc3 -t 4 -v

Or you can wait 90 hours. :smile:

[QUOTE=Xyzzy;309139]
We ran:

[FONT="Courier New"]nice -19 ./msieve -s L1378.dat -l L1378.log -i L1378.ini -nf L1378.fb -nc -t 9 -v[/FONT][/QUOTE]

Just adding the r to -nc will work fine.

[FONT="Courier New"]nice -19 ./msieve -s L1378.dat -l L1378.log -i L1378.ini -nf L1378.fb -ncr -t 4 -v[/FONT]

-nc1 will do just filtering (building the matrix from the rels)
-nc2 will do the matrix
-nc3 will do the part after the matrix
-nc will do all of them
-ncr will resume a matrix

[QUOTE=frmky;309146]If you stop it, you can safely restart it with

nice -19 ./msieve -s L1378.dat -l L1378.log -i L1378.ini -nf L1378.fb -ncr -nc3 -t 4 -v

Or you can wait 90 hours. :smile:[/QUOTE]

-ncr will do the sqrt as well.

Four threads instead of eight:

[FONT=Courier New]linear algebra completed 427267 of 8241790 dimensions (5.2%, ETA 55h23m)[/FONT]

:smile:

[QUOTE=Xyzzy;309149]Four threads instead of eight:

[FONT=Courier New]linear algebra completed 427267 of 8241790 dimensions (5.2%, ETA 55h23m)[/FONT][/QUOTE]

Those virtual cores are getting in the way of progress it seems.

Jeff.

Coping with senility
 

[QUOTE=pinhodecarlos;309137]Most of the times I don't understand your jokes (the dialogues) and I get furious...
Tomorrow I'll see you answers, just passed my bed time (my girlfriend is pointing me a gun!).[/QUOTE]
It's [URL="http://www.imdb.com/title/tt0763029/quotes"]Simpsons[/URL] (Season 4, Episode 16). I even had that as the avatar signature. Aw wait, and then I didn't. Anyway, try the angagramatic aligner:
[CODE]Coping with senility
Incites pitying howl
No Syphilitic Twinge
oily twitching penis
[/CODE]

[QUOTE=Xyzzy;309149]Four threads instead of eight:

[FONT=Courier New]linear algebra completed 427267 of 8241790 dimensions (5.2%, ETA 55h23m)[/FONT]

:smile:[/QUOTE]
Thar' she blows!

[QUOTE=Dubslow;309147]-ncr will do the sqrt as well.[/QUOTE]
Really? If so, that differs from the MPI version.

[QUOTE=pinhodecarlos;309133]Can we prove mathematically what is the optimal number of unique relations to build a matrix for a certain number in function of G/SNFS difficulty without spending too much of effort on sieving?[/QUOTE]
I can envision the Feynman defense here.
[B]Theorem[/B]: There exists a distance from which a female looks most [URL="http://en.wikipedia.org/wiki/Physical_attractiveness"]attractive[/URL].
[B]Proof[/B]: At d=0, we cannot see anything so the attractiveness = 0.
At d=∞, it's too far to see anything so the attractiveness = 0.
At 0<d<∞, the attractiveness is a positive smooth function.
????
[STRIKE]PROFIT.[/STRIKE] QED

P.S. I should quote Wikipedia more often.
No sooner than I quoted the article (but no later than a minute after), it has been vandalized:

[QUOTE]Lionel is The Boss.[/QUOTE]We're going to assume it is okay. If it isn't then we are just out a little CPU time. Sleep eludes us and we need something constructive to do.

1886503_37_minus1
F1761

Apologies in advance if we are stepping on anyone's toes. We can stop the jobs at any time, no problem.

:smile:

All RSALS numbers are now reserved for post-processing :smile: