Paper Info
Title
A Fully Distributed Prime Numbers Generation using the Wheel Sieve
Abstract
This article presents a new distributed approach for generating all prime numbers up to a given limit. From Er- atosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the advances of the parallel comput- ers (which have permitted to reach large limits or to ob- tain the previous results in a shorter time), prime numbers generation still represents an attractive domain of resear ch. Nowadays, prime numbers play a central role in cryptogra- phy and their interest has been increased by the very recent proof that primality testing is in P. In this work, we propose a new distributed algorithm which generates all prime num- bers in a given finite interval (2,...,n), based on the wheel sieve. As far as we know, this paper designs the first fully distributed wheel sieve algorithm.
Year
Venue
Keywords
2005
Parallel and Distributed Computing and Networks
prime numbers generation,broadcast and leader election.,wheel sieve,distributed algorithms,leader election,prime number,distributed algorithm,parallel computer
Field
DocType
Citations 
Leader election,Prime (order theory),Prime number,Primality test,Computer science,Cryptography,Theoretical computer science,Distributed algorithm,Sieve
Conference
0
PageRank 
References 
Authors
0.34
8
1
Name
Order
Citations
PageRank
Gabriel Antoine Louis Paillard134.14