Price your future right. 60% off with code BLACKSCHOLES at USD checkout. Offer ends in 8d 09h 54m 21s8 days 9 hours 54 minutes 21 seconds.
Price your future right. 60% off with code BLACKSCHOLES at USD checkout. Offer ends in 8d 09h 54m 21s8 days 9 hours 54 minutes 21 seconds.

Sign in to watch this lesson
Concurrent Data Structures · 4:19
A single-producer, single-consumer queue needs nothing more than a release store on tail, but a second producer races on the same dummy node, and a naive fix turns into a busy-wait that is really a lock. We build Michael and Scott's lock-free queue, force a lagging tail and watch another thread help, then race it against the two-lock queue and see how much memory reclamation costs.