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. 

• Type: Conference
• Year: 2001
• Where: AICCSA
• Authors: Sidi Mohamed Sedjelmaci
• Keywords: AICCSA 2001, Common Divisor Algorithm, Greatest Common Divisor, Hardware, Integer Gcd