"Marco Bodrato" <bodr...@mail.dm.unipi.it> writes:
> After the patch.
> real 3m47.247s
The time to compute and check 2^33 square roots, but it can be reduced.
Computing just 2^32 square roots would be another great speedup...
> Almost 2x speedup, awesome!
Yes, Adrien spotted a real problem. The sqrtrem2 function was "hidden"
under a heavy wrapper. Needed for large operands, but too heavy for
smaller ones.
Now, I believe he will be able to gain another 2x improving sqrtrem2, I
did not touch that core functions, only the wrappers !-)
Nice!
And then another 2x might be gained by using the division-free iteration
(for A^{-0.5}) with mulhi/mullo/mulmid.
--
Torbjörn
Please encrypt, key id 0xC8601622
_______________________________________________
gmp-devel mailing list
gmp-devel@gmplib.org
https://gmplib.org/mailman/listinfo/gmp-devel
