Multipartite Modular Multiplication - Archive ouverte HAL Access content directly
Reports Year : 2011

Multipartite Modular Multiplication

(1) , (1) , (1)
1
Pascal Giorgi
Laurent Imbert
Thomas Izard
  • Function : Author
  • PersonId : 938633

Abstract

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.
Fichier principal
Vignette du fichier
kpartite-report.pdf (541.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00618437 , version 1 (01-09-2011)

Identifiers

  • HAL Id : lirmm-00618437 , version 1

Cite

Pascal Giorgi, Laurent Imbert, Thomas Izard. Multipartite Modular Multiplication. RR-11024, 2011, pp.25. ⟨lirmm-00618437⟩
336 View
383 Download

Share

Gmail Facebook Twitter LinkedIn More