An improved parallel algorithm for integer GCD
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
We present a simple parallel algorithm for computing the greatest common divisor (gcd) of twon-bit integers in the Common version of the CRCW model of computation. The run-time of the algorithm in terms of bit operations isO(n/logn), usingn 1+ɛ processors, where ɛ is any positive constant. This improves on the algorithm of Kannan, Miller, and Rudolph, the only sublinear algorithm known previously, both in run time and in number of processors; they requireO(n log logn/logn),n 2 log2 n, respectively, in the same CRCW model.
We give an alternative implementation of our algorithm in the CREW model. Its run-time isO(n log logn/logn), usingn 1+ɛ processors. Both implementations can be modified to yield the extended gcd, within the same complexity bounds.
- An improved parallel algorithm for integer GCD
Volume 5, Issue 1-4 , pp 1-10
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Greatest common divisor
- Parallel algorithms
- Industry Sectors