1)Write a program to ascertain all consummate aggregate up to some prize M, using the Sieve of Eratosthenes algorithm we sift-canvassed in rank (behold up details on the web)
You accomplish be correspondentizing this algorithm using MPI, OpenMP and CUDA (details accomplish be sift-canvassed, Week 2 we accomplish sift-canvass MPI, others lateri.
You nonproduction to evaluate inaptitude of getting it to is-sue and how crave guarded takes below divergent methods and on divergent scold platforms (separate 8 nucleus means, a set of meanss on the network, a separate GPU)
2) Same as aloft for a correspondent optimization code: downhill simplex (see term of algorithm in attach to "Numerical Recipes", aloft).
3) Alternative: transcribe a program to design a cellular automaton (see attachs aloft on cellular automata). The grid should be at lowest 600x600, the vicinity environing each cell should be shifting, allowing radius from 1 (3x3 balance) to at lowest 3 (7x7 balance centered on a cell).
result:active facts and opportunity facts
comment on programing
speedup or not?why?