Recently I found a microbenchmark on performance of different implementations of concurrent hash maps at https://le.qun.ch/en/blog/sharding/, where the test results are repeatable on my machine. I was wondering why simple std::unordered_map with std::shared_map outperforms tbb::conrurrent_hash_map? Is there any pitfall in that KVIntelTBB implementation?
