Sidi M. Sedjelmaci
Abstract
We present a new parallel algorithm which computes the GCD of n integers of O(n) bits in O(n / log n) time with O(n2+ε) processors, for any ε > 0 on CRCW PRAM model.
- A. Borodin, J. von zur Gathen and J. Hopcroft, Fast parallel matrix and GCD computations, Information and Control, 52, 3, 1982, 241--256Google Scholar
Cross Ref
- B. Chor and O. Goldreich, An improved parallel algorithm for integer GCD, Algorithmica, 5, 1990, 1--10Google ScholarCross Ref
- G. Cooperman, S. Feisel, J. von zur Gathen and G. Havas, GCD of many integers, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1627 (1999), 310--317 Google ScholarDigital Library
- G. Havas, S. Majewski, Extended gcd calculation, Congressus Numerantium, 111, 1627 (1998), 104--114Google Scholar
- S.M. Sedjelmaci, On A Parallel Lehmer-Euclid GCD Algorithm, in Proc. of the International Symposium on Symbolic and Algebraic Computation (ISSAC'2001), 2001, 303--308 Google ScholarDigital Library
- S.M. Sedjelmaci, Fast Parallel GCD algorithm of many integers, lipn.univ-paris13.fr/~sedjelmaci, Rapport interne, LIPN, April, 2013Google Scholar
- J. Sorenson, Two Fast GCD Algorithms, J. of Algorithms, 16, 1994, 110--144 Google ScholarDigital Library
Index Terms
- Fast parallel GCD algorithm of many integers
Recommendations
Two Fast Parallel GCD Algorithms of Many Integers
ISSAC '17: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic ComputationWe present two new parallel algorithms which compute the GCD of n integers of O(n) bits in O(n/log n) time with O(n2+ε) processors in the worst case, for any ε > 0 in CRCW PRAM model. More generally, we prove that computing the GCD of $m$ integers of O(...
An improved parallel algorithm for integer GCD
AbstractWe 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), usingn1+ɛ ...
A parallel extended GCD algorithm
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O"@e(n/logn) time using at most n^1^+^@e processors on CRCW PRAM. Sorenson ...
Comments