Question 1 of 36

When computing the begin and end values for each thread in block partitioning, it is paramount to perform the multiplication before the division.

A. True

B. False

Question 2 of 36

In cyclic partitioning, the loop counter is incremented by the number of threads in each iteration.

A. True

B. False

Question 3 of 36

Block-cyclic partitioning requires a minimum calculation if the block size is not an integer multiple of the total number of iterations.

A. True

B. False

Question 4 of 36

Loop-carried data dependencies prevent direct parallelization of the loop.

A. True

B. False

Question 5 of 36

All loop-carried data dependencies can be eliminated by replacing them by a closed-form direct computation.

A. True

B. False

Question 6 of 36

When eliminating a loop-carried dependency that adds a constant, the closed-form direct solution will likely contain a multiplication.

A. True

B. False

Question 7 of 36

Static global variables are visible in other compilation units (files).

A. True

B. False

Question 8 of 36

A static local variable behaves like a global variable except it is only visible in the function within which it is declared.

A. True

B. False

Question 9 of 36

A static function can only be called from within the same compilation unit (file).

A. True

B. False

Reset Selection Mark for Review What's This?

Question 10 of 36

3.0 Points

To ensure that two functions can safely operate on the same shared data structure in parallel, you must verify that all possible interleavings yield a valid result.

A. True

B. False

Reset Selection Mark for Review What's This?

Question 11 of 36

3.0 Points

In these interleavings, you only have to consider write accesses to shared memory locations.

A. True

B. False

Reset Selection Mark for Review What's This?

Question 12 of 36

3.0 Points

In the linked-list implementation we studied, running contains and contains in parallel is always safe.

A. True

B. False

Reset Selection Mark for Review What's This?

Question 13 of 36

3.0 Points

In the linked list implementation we studied, running contains and insert in parallel is always safe.

A. True

B. False

Question 14 of 36

In the linked list implementation we studied, running contains and delete in parallel is always safe.

A. True

B. False

Question 15 of 36

In the linked list implementation we studied, running insert and insert in parallel is always safe.

A. True

B. False

Question 16 of 36

In the linked list implementation we studied, running delete and delete in parallel is always safe.

A. True

B. False

Question 17 of 36

In the parallel linked list, running insert and insert in parallel without synchronization may result in duplicate entries in the list.

A. True

B. False

Question 18 of 36

In the parallel linked list, running insert and insert in parallel without synchronization may result in the list not being sorted.

A. True

B. False