论文信息 - Parallel Implementation of the Accelerated Integer GCD Algorithm

Parallel Implementation of the Accelerated Integer GCD Algorithm

Abstract The accelerated integer greatest common divisor (GCD) algorithm has been shown to be one of the most efficient in practice. This paper describes a parallel implementation of the accelerated algorithm for the Sequent Balance, a shared-memory multiprocessor. For input of roughly 10 000 digits, it displays speed-ups of 1.6, 2.5, 3.4 and 4.0 using 2, 4, 8 and 16 processors, respectively.

KENNETH WEBER

[1] Alan H. Karp,et al. Measuring parallel processor performance , 1990, CACM.

[2] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3] Edith Schonberg,et al. Factoring: a method for scheduling parallel loops , 1992 .

[4] Tudor Jebelean. Systolic Algorithms for Long Integer GCD Computation , 1994, CONPAR.

[5] Kenneth Weber. An experiment in high-precision arithmetic on shared memory multiprocessors , 1990, SIGS.

[6] Bruce W. Char,et al. GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation , 1984, EUROSAM.

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

[8] Tudor Jebelean,et al. A generalization of the binary GCD algorithm , 1993, ISSAC '93.

[9] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

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