Generic design of Chinese remaindering schemes - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Generic design of Chinese remaindering schemes

Résumé

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a radix ladder, for the intermediate storage and computations. Our design is structured into three main modules: a black box residue computation in charge of computing each residue; a Chinese remaindering controller in charge of launching the computation and of the termination decision; an integer builder in charge of the reconstruction computation. We then show that this design enables many different forms of Chinese remaindering (e.g. deterministic, early terminated, distributed, etc.), easy comparisons between these forms and e.g. user-transparent parallelism at different parallel grains.
Fichier principal
Vignette du fichier
crtDGR.pdf (275.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00449864 , version 1 (23-01-2010)
hal-00449864 , version 2 (04-05-2010)

Identifiants

Citer

Jean-Guillaume Dumas, Thierry Gautier, Jean-Louis Roch. Generic design of Chinese remaindering schemes. PASCO '10 - 4th International Symposium on Parallel Symbolic Computation, Jul 2010, Grenoble, France. pp.26-34, ⟨10.1145/1837210.1837218⟩. ⟨hal-00449864v2⟩
248 Consultations
245 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More