Parallel implementation of the accelerated integer GCD algorithm

Journal of Symbolic Computation

Volumn 21, Issue 4-6, 1996, Pages 457-466

  Weber, Kenneth ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030118597     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0025     Document Type: Article

References (15)

1. Char, B.W., Geddes, K.O., Gonnet, G.H. (1989). GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation. J. Symbolic Computation, 7:31-48.
2. Granlund, T. (1991). GNU MP: The GNU Multiple Precision Arithmetic Library. Free Software Foundation, 1.1 edition.
3. Hummel, S.F., Schönberg, E., Flynn, L.E. (1992). Factoring: A method for scheduling parallel loops. Communications of the ACM, 35(8).
4. Jebelean, T. (1993). A generalization of the binary GCD algorithm. In ISSAC '93: International Symposium on Symbolic and Algebraic Computation, pp. 111-116, Kiev, Ukraine.
5. Jebelean, T. (1994). Systolic algorithms for long integer GCD computation. In Buchberger, B., Volkert, J., (eds), CONPAR 94 - VAPP VI (LNCS 854), pp. 241-252, Springer Verlag: Linz, Austria.
6. Karp, A.H., Flatt, H.P. (1990). Measuring parallel processor performance. Communications of the ACM, 33(5):539-543.
7. Karp, R., Ramachandran, V. (1990). Parallel algorithms for shared-memory machines. In van Leeuwen, J., (ed), Algorithms and Complexity. Elsevier and MIT Press. Handbook of Theoretical Computer Science, volume A.
8. Knuth, D.E. (1981). The Art of Computer Programming, Volume 2, Seminumerical Algorithms of Addison-Wesley Series in Computer Science and Information Processing. Reading, MA: Addison-Wesley, 2nd edition.
9. Osterhaug, A., (ed) (1989). Guide to Parallel Programming On Sequent Computer Systems. Englewood Cliffs, NJ: Prentice Hall, second edition.
10. Schönhage, A. (1971). Schnelle berechnung von kettenbruchentwicklungen. Acta Informatica, 1:139-144.
11. Schönhage, A., Strassen, V. (1971). Schnelle multiplication großer zahlen. Computing, 7.
12. Sorenson, J. (1994). Two fast GCD algorithms. J. Algorithms, 16(1):110-144.
13. Stallman, R.M. (1991). Using and Porting GCC. Free Software Foundation.
14. Weber, K. (1990). An experiment in high-precision arithmetic on shared memory multiprocessors. SIGSAM Bulletin, 24(2):22-40.
15. Weber, K. (1995). The accelerated integer gcd algorithm. ACM Transactions on Mathematical Software, 21:111-122.