Compare performance of the sieve of Eratosthenes with varying amounts of threads/processes and different sizes of workloads. The multi-threaded sieve of Eratosthenes program OpenMP benchmarks Answer these questions 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? 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? You will be benchmarking the sieve made using OpenMP. Start with this table, consisting of 16 entries. You may expand the table to include different thread counts or maximum values. OpenMP Sieve Primes up to 1,000 (1e3) Primes up to 10,000 (1e4) Primes up to 100,000 (1e5) Primes up to 1,000,000 (1e6) 1 Thread 2 Threads 4 Threads 8 Threads A few notes: For OpenMP, the 1-thread case will effectively run as a single-threaded program. You are welcome to present your findings as a graph rather than a table. Try to run as many trials as possible (at least 5 trials, but more helps) for each combination of thread/process count and maximum number for primes and find the average execution time.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Compare performance of the sieve of Eratosthenes with varying amounts of threads/processes and different sizes of workloads.

The multi-threaded sieve of Eratosthenes program

OpenMP benchmarks

Answer these questions

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?

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?

You will be benchmarking the sieve made using OpenMP. Start with this table, consisting of 16 entries. You may expand the table to include different thread counts or maximum values.

OpenMP Sieve	Primes up to 1,000 (1e3)	Primes up to 10,000 (1e4)	Primes up to 100,000 (1e5)	Primes up to 1,000,000 (1e6)
1 Thread
2 Threads
4 Threads
8 Threads

A few notes:

For OpenMP, the 1-thread case will effectively run as a single-threaded program.
You are welcome to present your findings as a graph rather than a table.
Try to run as many trials as possible (at least 5 trials, but more helps) for each combination of thread/process count and maximum number for primes and find the average execution time.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions