论文信息 - Parallel Implementation of Schönhage's Integer GCD Algorithm - 字舞流文

Parallel Implementation of Schönhage's Integer GCD Algorithm

We present a parallel implementation of Schonhage's integer GCD algorithm on distributed memory architectures. Results are generalized for the extended GCD algorithm.

Giovanni Cesari

[1] Gary L. Miller,et al. Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers , 1984, FOCS.

[2] Kenneth Weber,et al. The accelerated integer GCD algorithm , 1995, TOMS.

[3] Giovanni Cesari,et al. CALYPSO: a computer algebra library for parallel symbolic computation , 1997, PASCO '97.

[4] Richard E. Crandall,et al. Projects in Scientific Computation , 1994 .

[5] Giovanni Cesari,et al. Parallel 3-Primes FFT Algorithm , 1996, DISCO.

[6] Giovanni Cesari,et al. Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distributed Memory Architectures , 1996, J. Symb. Comput..

[7] Giovanni Cesari. Parallel algorithms for multiple-precision arithmetic , 1997 .

[8] Jonathan P. Sorenson. Two Fast GCD Algorithms , 1994, J. Algorithms.

[9] Alfred V. Aho,et al. The design and analysis of algorithms , 1974 .

[10] Chee-Keng Yap,et al. Fundamental problems of algorithmic algebra , 1999 .

[11] KENNETH WEBER. Parallel Implementation of the Accelerated Integer GCD Algorithm , 1996, J. Symb. Comput..