High performance SIMD modular arithmetic for polynomial evaluation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2021

High performance SIMD modular arithmetic for polynomial evaluation

Résumé

Two essential problems in Computer Algebra, namely polynomial factorization and polynomial greatest common divisor computation, can be efficiently solved thanks to multiple polynomial evaluations in two variables using modular arithmetic. In this article, we focus on the efficient computation of such polynomial evaluations on one single CPU core. We first show how to leverage SIMD computing for modular arithmetic on AVX2 and AVX-512 units, using both intrinsics and OpenMP compiler directives. Then we manage to increase the operational intensity and to exploit instruction-level parallelism in order to increase the compute efficiency of these polynomial evaluations. All this results in the end to performance gains up to about 5x on AVX2 and 10x on AVX-512.
Fichier principal
Vignette du fichier
article-HAL-sc.pdf (445.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02552673 , version 1 (23-04-2020)

Identifiants

Citer

Pierre Fortin, Ambroise Fleury, François Lemaire, Michael Monagan. High performance SIMD modular arithmetic for polynomial evaluation. Concurrency and Computation: Practice and Experience, 2021, 33 (16), pp.e6270. ⟨10.1002/cpe.6270⟩. ⟨hal-02552673⟩
378 Consultations
1313 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More