Modular SIMD arithmetic in Mathemagix

Abstract : 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.
Type de document :
Pré-publication, Document de travail
2014


https://hal.archives-ouvertes.fr/hal-01022383
Contributeur : Grégoire Lecerf <>
Soumis le : jeudi 10 juillet 2014 - 12:32:57
Dernière modification le : jeudi 9 février 2017 - 15:09:05
Document(s) archivé(s) le : vendredi 10 octobre 2014 - 11:38:01

Fichier

simd-2014-06-29.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01022383, version 1

Collections

Citation

Joris Van Der Hoeven, Grégoire Lecerf, Guillaume Quintin. Modular SIMD arithmetic in Mathemagix. 2014. <hal-01022383>

Partager

Métriques

Consultations de
la notice

272

Téléchargements du document

159