Sciweavers

Share
AICCSA
2001
IEEE

On a Parallel Extended Euclidean Algorithm

9 years 1 months ago
On a Parallel Extended Euclidean Algorithm
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/log n) time using only n1+ processors on a Priority CRCW PRAM. Keywords : Parallel complexity, parallel algorithms, Greatest Common Divisor (GCD), Euclid algorithm.
Sidi Mohamed Sedjelmaci
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2001
Where AICCSA
Authors Sidi Mohamed Sedjelmaci
Comments (0)
books