Document Type
Article
Publication Date
2010
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 logn/ logn) time using O(n6+ ) 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.
Recommended Citation
Sorenson, Jonathan P., "A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM" (2010). Scholarship and Professional Work - LAS. Paper 81.
http://digitalcommons.butler.edu/facsch_papers/81