1. Questions Parallel Programming Shared memory performance issues
ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson, QuizQuestions8d.ppt Sept 8, 2014

2. Both locks and binary semaphores can be used to control access to critical sections. Name one additional feature provided with binary semaphores?

3. Use Bernstein’s conditions to determine how much parallelism can be extracted from the following sequence: a = b + c; y = 3; c = a; x = y + z: How many threads can be used?

4. Bernstein’s conditions are sufficient but not necessary conditions to establish whether statements can be executed in parallel (in the mathematical sense). Devise a sequence of two statements that fails Bernstein’s conditions but still can be executed in parallel or in any order?

5. Why does false sharing reduce performance of shared memory programs
Why does false sharing reduce performance of shared memory programs? (This question is not asking what is false sharing.) .
It doesn’t.
None of the other answers.