Reading notes
CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
Matt Kulukundis explains how Google designed SwissTable, a fast, cache-friendly hash table, step by step from std::unordered_map. The talk covers open addressing, SIMD probing and the tradeoffs of changing a fundamental data structure.
Ideas to listen for
- 1swisstable
- 2hash tables
- 3c++
Discussion context
Hour-long look at modern open addressing hash tables
“(warning, it's an hour. Takes a while to build up, too. Still worth it.)”Open the source comment