FastECPP over MPI - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

FastECPP over MPI

Andreas Enge

Résumé

The FastECPP algorithm is currently the fastest approach to prove the primality of general numbers, and has the additional benefit of creating certificates that can be checked independently and with a lower complexity. This article shows how by parallelising over a linear number of cores, its quartic time complexity becomes a cubic wallclock time complexity; and it presents the algorithmic choices of the FastECPP implementation in the author's \cm\ software \\ \centerline {\url {https://www.multiprecision.org/cm/}} which has been written with massive parallelisation over MPI in mind and used to establish a new primality record, for the ``repunit'' $(10^{86453} - 1) / 9$.
Fichier principal
Vignette du fichier
ecppmpi.pdf (167.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY SA - Paternité - Partage selon les Conditions Initiales

Dates et versions

hal-04522492 , version 1 (08-04-2024)

Licence

Paternité - Partage selon les Conditions Initiales

Identifiants

  • HAL Id : hal-04522492 , version 1

Citer

Andreas Enge. FastECPP over MPI. 2024. ⟨hal-04522492⟩
0 Consultations
1 Téléchargements

Partager

Gmail Facebook X LinkedIn More