Messages in this thread | | | From | James Cloos <> | Subject | Re: [PATCH 1/8] add lib/gcd.c | Date | Sat, 13 Jun 2009 11:50:15 -0400 |
| |
>>>>> "Alan" == Alan Cox <alan@lxorguk.ukuu.org.uk> writes:
>> Would the binary gcd algorithm not be a better fit for the kernel?
Alan> Could well be the shift based one is better for some processors only.
Very likely, I suspect.
And the version of the euclid algo in that patch is better than most references that I've seen. (q=a/b;r=a%b; is common, probably because the texts use the same algo for computing the continued fraction.)
In any case, I do not have the hardware to do any statistically significant testing; the closest I could do would be a speed test on hera, which I expect would be discouraged.
-JimC -- James Cloos <cloos@jhcloos.com> OpenPGP: 1024D/ED7DAEA6
| |