Finding N Prime Numbers Using Distrusted Computing PVM (Parallel Virtual Machine)
Full Text | |
Author(s) | Ehab AbdulRazak Al-Asadi |
Pages | 578-588 |
Volume | 5 |
Issue | 11 |
Date | November, 2015 |
Keywords | Prime Numbers, Eratosthenes Sieve, Parallel Program, Mersenne Prime Number. |
Abstract
Analysis the feasibility of sequencing as a parallel algorithm for the search for the first N Prime numbers. Design and implement (in C / C ++) program, respectively. Programs in the sequence Algorithm and also a solution based on the transmission of messages between nodes using library system PVM. Both programs must be identical. Distribute the load between nodes so that the computing time.A minimum. Find out what is the dependence of acceleration of the implementation and calculation of the number of nodes and the extent of the problem in relation to sequencing program, (insert table and graphs). On the basis of Results estimate: latency communication, for what is the role of the dimension of the architecture (right) Scalable and what is the maximum size when the calculation is available on the architecture more bearable.Discuss in your group about what is the advantage respectively. The efficiency of parallel execution Individual algorithms. If this solution requires the use of input and output files with rows matrix. Corresponds to file line and column values are separated by spaces or tabs. Otherwise stated, work with real numbers.
< Back to October Issue