We are taking a look at the implementation of both lock-free and fine-grained lock-based set/map: hash tables, trees. We will find out what in STL may be implemented in lock-free manner and what may not. “Underwater rocks” of lock-free algorithms and how to neutralize them.
CoreHard Summer 2016. Maxim Khizhinski. Concurrent associative containers22/08/2016 core_hard0 Comment