Skip to content
hackertubeai

CppCon

CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”

About this video

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.

Keep your curiosity going.

A few more ideas from the same corner of the archive.

Vectors | Chapter 1, Essence of linear algebra

3Blue1Brown

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

But what is the Fourier Transform? A visual introduction.

3Blue1Brown

But what is a neural network? | Deep learning chapter 1

3Blue1Brown