Describe the implementation of a lock-free, thread-safe First-In-First-Out (FIFO) queue suitable for a multi-core producer-consumer system. Your explanation should cover the use of atomic operations (Compare-and-Swap), memory fences, and the ABA problem. Provide pseudo-code or C++ snippets demonstrating the enqueue and dequeue operations. Analyze the potential performance bottlenecks caused by cache coherence traffic in a NUMA architecture and suggest optimizations to minimize false sharing.