I looked up the NVIDIA Cuda docs here: http://developer.download.nvidia.com/compute/cuda/2_0/docs/NVIDIA_CUDA_Programming_Guide_2.0.pdf
It looks like section C2.3 describes an atomic Xor function. That should be just what is needed for GF2X. I can see some definite potential is doing exact arithmetic too. One would implement a floating point FFT. It doesn't matter that if one wanted a proved result one would have to work with a hopelessly slow bound. With that many cores it would be irrelevant. You'd still be a factor of 30-100 times faster than a single core machine! Bill. 2008/11/23 mabshoff <[EMAIL PROTECTED]>: > > > > On Nov 23, 12:38 pm, "Bill Hart" <[EMAIL PROTECTED]> wrote: >> Perhaps if you, me, John C, mabshoff and the people he is working with >> all signed off on it. > > The people I am working with here is basically Clement Pernet. There > are also other people form the LinBox universe working on GPU code, > i.e. Pascal Giorgi. > > Another interesting angle here could be m4ri since the XORing engine > on the GPU should be insanely fast, but last time I talked to malb he > wasn't very enthusiastic about it. > >> I could also mention the "seed funding" EPSRC have given me through my >> grant, for hardware and my salary, specifically for developing "fast >> core arithmetic for parallel processors and platforms". > > Cool. > >> We could actually make the application look quite impressive I think. > > One would hope so. > >> Bill. > > Cheers, > > Michael > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
