This assignment will consist of the following parts:

The multi$-$threaded sieve of the Eratosthenes program

MPI benchmarks

Answer these questions $($you can be as short or as detailed as you like$)$:

a$.$ Where do you think the "sweet spot" is for thread count? Alternatively, at what point

does the addition of more threads result in diminishing returns?

b$.$ Where do you think the "sweet spot" is for workload size? Alternatively, at what

maximum value $($max value to search for prime numbers$)$ does it become beneficial to

run the sieve in parallel?

Answer this additional question with a few sentences: Between this and the OpenMP$-$based

sieve from the midterm, what can you say are the advantages and disadvantages of both

OpenMP and MPI? You may consider the following:

a$.$ Which was easiest to program?

b$.$ Which one requires $($or benefits from$)$ specific hardware?

You will be benchmarking the sieve made using MPI. Start with the following table, consisting of

$12$ entries. You may expand the table to include different thread counts or maximum values.