A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM
Data Structures and Algorithms
2010-01-15 v2
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 loglog n / log n) expected time using n^{6+\epsilon} processors on the EREW PRAM parallel model of computation. We believe this to be the first randomized sublinear time algorithm on the EREW PRAM for this problem.
Cite
@article{arxiv.0907.0718,
title = {A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM},
author = {Jonathan P. Sorenson},
journal= {arXiv preprint arXiv:0907.0718},
year = {2010}
}