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

Sign in to watch this lesson
Concurrent Data Structures · 3:59
Splitting one big lock into many, and measuring whether it pays. A sloppy counter keeps a count per thread and only occasionally takes the global lock, a hash map gets one lock per bucket, and a linked list is locked hand over hand; each is timed against a single lock on an Apple M3, ThreadSanitizer catches an exact read that skips the locks, and the hand-over-hand list turns out several times slower than one lock.