On Wednesday 27 October 2004 09:12, Fran�ois-Xavier Coudert wrote: > Hello all, > > Running mprime 23.9.2 on my i686 Linux 2.44.22 (Fedora Core 1), I get a > segfault after "stage 1 GCD"�: > [... snip ...] > > -- There seems to be a bug in the code; I don't think it is a problem > with my computer, since it is heavily used for number crunching (one year > of scientific computation almost full-time) and I never got any > suspicious segfault. Can I do something to help you fix it?
Have you run P-1 on an exponent around this size before? Just a thought - you may be running out of memory when stage 2 starts. Alternatively I think with Fedora you are probably running a 2.6 series kernel - still experimental so far as most people are concerned; there may still be bugs in this, in any case there are a _lot_ of kernel tweaks going on in 2.6 & it may be worthwhile upgrading to the latest kernel. Fedora may well have a more recent kernel package if you can't be bothered to compile your own. > > -- I'd like to reproduce it, but the program wants to do the P-1 > factoring again. Is it normal? Shouldn't it be checkpointed somewhere? There should be a checkpoint file MY201171... > Since I'll have to wait 11 hours to eventually see the segfault again, I > wonder if it's worth doing... Perhaps the checkpoint file disappears when the segfault occurs (in which case my suggestion of memory problem is probably wrong). You could try manually copying the checkpoint file next time it gets near the end of stage 1. Regards Brian Beesley _______________________________________________ Prime mailing list [EMAIL PROTECTED] http://hogranch.com/mailman/listinfo/prime
