Assume a shared-memory parallel program that requires synchronization to avoid potential data races. Explain under which conditions a critical section, an atomic operation, or a lock can be used to eliminate the data races. Next, compare and contrast the three approaches in terms of performance, portability, and ease-of-use for the programmer.