arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.3383cs.MS
收藏

Mathemagix中的模块化SIMD算法

Modular SIMD arithmetic in Mathemagix

Joris van der Hoeven, Grégoire Lecerf, Guillaume Quintin

摘要:

模整数运算出现在计算机代数、密码学和纠错码的许多算法中。虽然最近的微处理器通常提供了广泛的高度优化的算术函数,模整数运算仍然需要专门的实现。在这篇文章中,我们调查现有的算法,模整数运算,并提出详细的向量化的同行。我们还提出了几个应用,如快速模傅立叶变换和整数多项式和矩阵的乘法。矢量化算法已经在免费的计算机代数和分析系统Mathemagix中用C++实现。我们的实现的性能说明了各种基准。

英文摘要:

Modular integer arithmetic occurs in many algorithms for computer algebra, cryptography, and error correcting codes. Although recent microprocessors typically offer a wide range of highly optimized arithmetic functions, modular integer operations still require dedicated implementations. In this article, we survey existing algorithms for modular integer arithmetic, and present detailed vectorized counterparts. We also present several applications, such as fast modular Fourier transforms and multiplication of integer polynomials and matrices. The vectorized algorithms have been implemented in C++ inside the free computer algebra and analysis system Mathemagix. The performance of our implementation is illustrated by various benchmarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑