Strong Sequential Equivalence: example
Everything is shared except I and TMP. These can be private since they are not initialized and they are unused outside the loop.
The summation into RES occurs in the sequential order so the result from the program is bitwise compatible with the sequential program.
Problem: Can be inefficient if threads finish in an order that’s greatly different from the sequential order.
C$OMP PARALLEL PRIVATE(I, TMP)