Abstract
We study the practical performance of three algorithms for integer multiplication, “school-book,” Karatsuba, and 3-primes FFT. We compare portable solutions written in C versus non-portable solutions with assembly subroutines, and we examine the influence of CISC versus RISC processor architecture, in particular the NS 32332 versus Sun’s SPARC. We also determine the gains from a parallelization on a shared memory Encore Multimax under Mach. Our software environment is PARSAC-2, a multi-threaded, parallel extension of SAC-2.
Cite
CITATION STYLE
Kuechlin, W., Lutz, D., & Nevin, N. (1991). Integer multiplication in PARSAC-2 on stock microprocessors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 539 LNCS, pp. 206–217). Springer Verlag. https://doi.org/10.1007/3-540-54522-0_109
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
