Lock-Free Queue Implementations Compared: Correctness, Performance, and the Bugs You'll Ship
A `std::mutex`-protected `std::deque` is 12% faster than moodycamel::ConcurrentQueue when contention is low.
2 articles
A `std::mutex`-protected `std::deque` is 12% faster than moodycamel::ConcurrentQueue when contention is low.
False sharing is a measurable, fixable performance bug that hides in struct layouts. Two atomic counters in the same cache line can cost you 6x throughput — and perf c2c finds it in seconds.