Re: How to efficiently count Proth primes with GP parfor?

[Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>]

On Wed, Mar 20, 2024 at 11:20:50PM +0100, hermann@stamm-wilbrandt.de wrote:
> > 
> While using Karim's isProth2() I improved Bill's parallel work distribution
> scheme.
> 
> Instead of blocks of size B=n\nbt now block are of size B=n\nbt\if(l,l,1).
> Since distribution of primes as well as distribution of Proth primes is not
> the same for lower half ad higher half, making each of the 32 hardware
> threaas work l smaller but more evenly distributed work areas.

Something else you can try is to increase nbt, to have smaller blocks.

Cheers,
Bill.