Load Balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers

2007 ◽  
Author(s):  
Soonwook Hwang ◽  
Kyusik Chung ◽  
Dongseung Kim
Keyword(s):  
Prime Number ◽  
Number Generator ◽  
Cluster Computers ◽  
Load Balanced

scholarly journals Phase transition in a stochastic prime-number generator

2007 ◽  
Vol 76 (1) ◽  
Author(s):  
Bartolo Luque ◽  
Lucas Lacasa ◽  
Octavio Miramontes
Keyword(s):  
Phase Transition ◽  
Prime Number ◽  
Number Generator

Algorithm 311: Prime number generator 2

1967 ◽  
Vol 10 (9) ◽  
pp. 570 ◽  
Author(s):  
B. A. Charters
Keyword(s):  
Prime Number ◽  
Number Generator

Algorithm 357: an efficient prime number generator [A1]

1969 ◽  
Vol 12 (10) ◽  
pp. 563-564 ◽  
Author(s):  
Richard C. Singleton
Keyword(s):  
Prime Number ◽  
Number Generator

Certification of algorithm 310 [A1]: prime number generator

1970 ◽  
Vol 13 (3) ◽  
pp. 192
Author(s):  
Donald G. Rapp ◽  
Larry D. Scott
Keyword(s):  
Prime Number ◽  
Number Generator

scholarly journals The Comparison of Methods for Generating Prime Numbers between The Sieve of Eratosthenes, Atkins, and Sundaram

SinkrOn ◽  
2019 ◽  
Vol 3 (2) ◽  
pp. 293
Author(s):  
Nurul Khairina
Keyword(s):  
Prime Number ◽  
Large Scale ◽  
Good Accuracy ◽  
Linear Equations ◽  
Prime Numbers ◽  
Number Generator ◽  
Quadratic Equations ◽  
Large Numbers ◽  
Primality Test ◽  
Test Algorithm

Prime numbers are unique numbers. Prime numbers are numbers that only have a dividing factor consisting of numbers 1 and the number itself. The prime numbers from 1 to n that are relatively small can be generated manually, but a prime number generator algorithm is needed to generate prime numbers on a large scale. This study compares three prime number generator algorithms, namely: The Sieve of Eratosthenes, The Sieve of Atkins, and The Sieve of Sundaram. These three sieve algorithms have their own differences in generating prime numbers. The Sieve of Eratosthenes uses a simpler method by crossing multiples of prime numbers and marking them as non-prime numbers. The Sieve of Atkins uses several requirements for quadratic equations and modulus in determining prime numbers. The Sieve of Sundaram has an algorithm similar to The Sieve of Atkins, but there are requirements for linear equations to determine prime numbers. This study aims to see a comparison of these three algorithms in terms of accuracy and speed in generating prime numbers on a large scale. The results of this study indicate The Sieve of Eratosthenes, Atkins and Sundaram algorithms can generate large numbers of prime numbers with good accuracy, this was tested by the Fermat Primality Test Algorithm. The conclusion that can be drawn from this study, The Sieve of Eratosthenes have a faster time to generate prime numbers on a large scale than the other two algorithms.

Sign in / Sign up

Export Citation Format

Share Document