Msieve

Version 1.51: 2/17/13 - Performed another massive overhaul of the GPU polynomial selection code; stage 1 now runs dozens to *hundreds* of times faster on a GPU - Added a thread pool implementation, and made GPU polynomial selection multithread-capable. Eventually the CPU code should be overhauled to look more like the GPU code, it will probably be able to run several times faster - Split stage 2 of NFS polynomial selection into the size optimization and root optimization portions, which can be invoked inde- pendently from the demo binary - Added a caching layer for reading in the matrix, to reduce the amount of disk IO required by an MPI grid (thanks Greg Childers) - Changed the main API to allow free-text strings for configuring NFS, then allowed all the parameters for polynomial selection to be specified when calling the library - Finally overhauled the Makefile to avoid everyone having to edit it - Fixed a potential 32-bit overflow in the hashtable code, that could occur for extremely large problems (thanks Paul Zimmermann) - Fixed the computation of alpha value when polynomials are linear (thanks Paul Zimmermann / Shi Bai) - Fixed a line sieve initialization problem (thanks Ilya Popovyan)