1. Sieve of Eratosthenes Quiz questions ITCS4145/5145, Parallel Programming Oct 24, 2013.

2. a) b) c) d) e)None of the other answers When can we stop the algorithm? When the next prime is:

3. a) b) c) d) e)None of the other answers What is the complexity of the sequential algorithm?

4. a) Scatter/Gather b) Pipeline c) Workpool d) Stencil e)None of the other answers Which pattern does the Sieve of Eratosthenes fit?

5. a) scatter it b) reduce and broadcast it c) send it via pipeline d) apply a stencil to it e)None of the other answers When we parallelized the Sieve of Eratosthenes as a Scatter/Gather pattern, what did we have to do with the “marked” array?