Write an MPI program, countprimes which will count the number of prime numbers in the numbers from 1 to n inclusive where n is a long integer. The value for n which should be set in the program using a constant should be 50,000. Each process will test its share of the cases. Each process should not print out any primes that it finds, but it should keep a running total. Before the process finishes, it should print out its ID number and its count of primes that it found. The master process should end with printing a total for the count of the number of primes and the total amount of time taken to find all the primes.
MPI Lab Directions
Write an MPI
Each process will test its share of the cases.
Each process should not print out any primes that it finds, but it should keep a running total. Before the process finishes, it should print out its ID number and its count of primes that it found.
The master process should end with printing a total for the count of the number of primes and the total amount of time taken to find all the primes.
Take a screenshot of the output for running this with 5 processes.
Before submission, make sure you clean up the directories so that no miscellaneous files are kept around in the submission. (Grade would be deducted if useless files are found in the homework directories.) Include the source code, screenshot, and the Makefile in the submission. Your Makefile can assume that the path to the MPI compiler is found in the path.
If the program does not compile using MPICC and do something useful when it runs it will not earn any credit.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
