talkВидео с мероприятий {speach!
CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
CppCon · 9 recommenders · 10 months
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.
Why Hacker News readers recommend it: HN repeatedly cites it as the definitive explanation of SwissTable, the design behind Abseil, Rust's hash map and Go's maps.
Algorithms & data structuresSoftware performance & optimizationC, C++, Rust, Go & systems languages#swisstable#hash tables#c++#simd#abseil#cache efficiency
“Excellent talk which explains the concepts really clearly and concisely.”
View the original HN discussion
