1- What is the optimal mutual exclusion strategy in OpenMP if a critical section looks like x += b;? Assume there are no other crucial portions in the program. a. lock b. critical section c. atomic 2-...

1- What is the optimal mutual exclusion strategy in OpenMP if a critical section looks like x += b;? Assume there are no other crucial portions in the program.

a. lock

b. critical section

c. atomic

2- What is the optimal mutual exclusion strategy in OpenMP if a critical part looks like x += c; y+=b;? Assume there are no other crucial portions in the program.

a. lock

b. critical section

c. atomic

3- In OpenMP, we can't always tell how many crucial sections are in a program just by glancing at the source code.

a. True

b. False

4- Let's say we want to start a kernel with the following command: kernelname 4,4>>> (argument list...);
Let's say the kernel has a global variable called x. How many x instances will there be?

a. 16

b. 4

c. 8

d. 1

e. 2