Abstract
We present a randomized parallel algorithm that computes the greatest common divisor of two integers of n bits in length with probability 1 − o ( 1 ) that takes O ( n log log n / log n ) time using O ( n 6 + ϵ ) processors for any ϵ > 0 on the EREW PRAM parallel model of computation. The algorithm either gives a correct answer or reports failure. We believe this to be the first randomized sublinear time algorithm on the EREW PRAM for this problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have