 |
|
|
|
| HAL : lirmm-00618437, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
|
|
| Multipartite Modular Multiplication |
|
|
| Pascal Giorgi 1Laurent Imbert 1 |
|
|
| (08/2011) |
|
|
|
| Current processors typically embeds many cores running at high speed. We may then ask ourselves whether software parallelism is practical for low level arithmetic operations. In this paper we generalize the bipartite modular multiplication method of Kaihara and Takagi. We present a multipartite multiplication. We carefully analyze its asymptotic complexity and measure its practical efficiency and scalability for nowadays multi-core architectures. We present several experimental results which illustrate the efficiency of our method and which bring a positive answer to the above question for a wide range of operand's sizes. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) |
|
|
|
CNRS : UMR5506 – Université Montpellier II - Sciences et Techniques du Languedoc |
|
|
|
|
|
|
|
|
|
| [INFO/ARITH : ARITHmétique Informatique] |
|
|
|
|
| Domaine | : | Informatique/Calcul parallèle, distribué et partagé Informatique/Cryptographie et sécurité Informatique/Arithmétique des ordinateurs |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| lirmm-00618437, version 1 | |
| http://hal-lirmm.ccsd.cnrs.fr/lirmm-00618437 | |
| oai:hal-lirmm.ccsd.cnrs.fr:lirmm-00618437 | |
| Contributeur : Giorgi Pascal | |
| Soumis le : Jeudi 1 Septembre 2011, 16:57:53 | |
| Dernière modification le : Jeudi 1 Septembre 2011, 17:28:59 | |
