A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm
A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm
复制标题
schönhage-strassen 大整数乘法算法的基于 gmp 的实现
DOI：
10.1145/1277548.1277572
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
P. Zimmermann
中科院分区：
文献类型：
--
作者：
P. Gaudry;A. Kruppa;P. Zimmermann
Schönhage-Strassen的算法是有效实现大型整数的最著名算法之一。图书馆。使用或尝试了以下想法和技术：更快的算术模型2N + 1，改进的高速缓存位置，Mersenne Transforms，中国剩余的重建，√2Trick，Harley's和Granlund的技巧，改进了调音。
Schönhage-Strassen's algorithm is one of the best known algorithms for multiplying large integers. Implementing it ef?ciently is of utmost importance, since many other algorithms rely on it as a subroutine. We present here an improved implementation, based on the one distributed within the GMP library. The following ideas and techniques were used or tried: faster arithmetic modulo 2n + 1, improved cache locality, Mersenne transforms, Chinese Remainder Reconstruction, the √2 trick, Harley's and Granlund's tricks, improved tuning.