Parallel modular multiplication on multi-core processors

Pascal Giorgi 1 Laurent Imbert 1 Thomas Izard 1
1 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Current processors typically embed many cores running at high speed. The main goal of this paper is to assess the efficiency of software parallelism for low level arithmetic operations by providing a thorough comparison of several parallel modular multiplications. Famous methods such as Barrett, Montgomery as well as more recent algorithms are compared together with a novel k-ary multipartite multiplication which allows to split the computations into independent processes. Our experiments show that this new algorithm is well suited to software parallelism.
Type de document :
Communication dans un congrès
IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. 21st IEEE Symposium on Computer Arithmetic, pp.135-142, 2013, 〈10.1109/ARITH.2013.20〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00805242
Contributeur : Pascal Giorgi <>
Soumis le : mercredi 3 avril 2013 - 10:34:31
Dernière modification le : jeudi 8 novembre 2018 - 21:48:25
Document(s) archivé(s) le : dimanche 2 avril 2017 - 21:17:39

Fichier

multipartite.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Pascal Giorgi, Laurent Imbert, Thomas Izard. Parallel modular multiplication on multi-core processors. IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. 21st IEEE Symposium on Computer Arithmetic, pp.135-142, 2013, 〈10.1109/ARITH.2013.20〉. 〈hal-00805242〉

Partager

Métriques

Consultations de la notice

288

Téléchargements de fichiers

279