1)Write a program to find all prime numbers up to some value M, using the Sieve of Eratosthenes algorithm we discussed in class (look up details on the web)
You will be parallelizing this algorithm using MPI, OpenMP and CUDA (details will be discussed, Week 2 we will discuss MPI, others lateri.
You want to evaluate difficulty of getting it to work and how long calculating takes under different methods and on different compute platforms (single 8 core machine, a set of machines on the network, a single GPU)
2) Same as above for a parallel optimization code: downhill simplex (see description of algorithm in link to “Numerical Recipes”, above).
3) Alternative: write a program to model a cellular automaton (see links above on cellular automata). The grid should be at least 600×600, the neighborhood around each cell should be variable, allowing radius from 1 (3×3 square) to at least 3 (7×7 square centered on a cell).
Requirement:
result:active data and time data
write up:algorithms
software(cuda,open mp,mpi)
hardware
comment on programing
debug
running
speedup or not?why?
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.
Read moreEach paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.
Read moreThanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.
Read moreYour email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.
Read moreBy sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.
Read more