Re: Any interest in multi-threaded code?

"Marco Bodrato" writes: > I merged the current head with that 10 years old repository, try again. Thanks for taking care of that! Regards, /Niels -- Niels Möller. PGP-encrypted email is preferred. Keyid 368C6677. Internet email is subject to wholesale government

Re: Any interest in multi-threaded code?

Ciao, Il Lun, 7 Maggio 2018 9:02 pm, Victor Shoup ha scritto: > I finally have time to study this. > Then I found out about .bootstrap...that doesn't work either > (no aclocal-1.8). Tried editing .bootstrap to remove "-1.8"...errors. I merged the current head with that 10 years old repository,

Re: Any interest in multi-threaded code?

Hi, I finally have time to study this. One problem is, I don't seem to be able to build it. No configure file in the repo, so I trued autoconflots of errors. Then I found out about .bootstrap...that doesn't work either (no aclocal-1.8). Tried editing .bootstrap to remove "-1.8"...errors.

Re: Any interest in multi-threaded code?

Presumably, that idea will work. But based on my experience with multi-threading, because of various overheads and latencies involved, you have to make sure that there is enough work to do per thread to make it worthwhile. Parallelizing the inner loops like this may or may not yield the expected

Re: Any interest in multi-threaded code?

Thanks! > On Apr 4, 2018, at 4:53 PM, Niels Möller wrote: > > Victor Shoup writes: > >> So I guess I'm just asking where the FFT code is at and if there would be >> any objections to my using it in that way. > > Here:

Re: Any interest in multi-threaded code?

Victor Shoup writes: > So I guess I'm just asking where the FFT code is at and if there would be any > objections to my using it in that way. Here: https://gmplib.org/repo/gcd-nisse/ The relation to gcd is that subquadratic gcd includes multiplication of 2x2 matrices, and I

Re: Any interest in multi-threaded code?

Presumably, that idea will work. But based on my experience with multi-threading, because of various overheads and latencies involved, you have to make sure that there is enough work to do per thread to make it worthwhile. Parallelizing the inner loops like this may or may not yield the expected

Re: Any interest in multi-threaded code?

Hi It is probably not useful to work much on the current FFT code. We have long planned--and worked quite a bit on--replacement FFT code with much better memory access pattern. The replacement code works with multiple small coefficient fields instead of a large ring. It also implements

Re: Any interest in multi-threaded code?

Hi all, Since this FFT code is sitting around, I wonder if there's a chance I could adapt it to NTL. I've actually implemented David Harvey's ideas a few years ago (and his work is actually based on older NTL logic which I never really publicized). NTL currently only uses special types like

Re: Any interest in multi-threaded code?

"Richard Foster" writes: > Even it looks OK in today's code, does Nisse's new FFT code change > anything? The small-prime FFT code uses fft-based multiplication of polynomials over Z_p for a couple of single-limb primes p. Usually in the range from 3 to 5 primes, depending on