3 ms·
Lock-free data structures generally use check-and-retry (compare and swap) rather than a lock. Now, in the face of contention, they don't scale as well as a lo
by bsder 11y ago
Lock-free data structures generally use check-and-retry (compare and swap) rather than a lock.
Now, in the face of contention, they don't scale as well as a lock. However, this falls under "optimize when you have data".