flâneur

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

youtube.com · 8,939 words · saved by 1 readers

Matt Kulukundis details the development of a new hash table designed for Google's infrastructure. The talk explores optimizing performance by balancing memory usage, CPU efficiency, and cache behavior, ultimately moving away from traditional, less efficient designs to achieve high speed. Follow along using the transcript. Matt Kulukundis details the development of a new hash table designed for Google's infrastructure. The talk explores optimizing performance by balancing memory usage, CPU efficiency, and cache behavior, ultimately moving away from traditional, less efficient designs to achieve high speed. Follow along using the transcript.

http://CppCon.org — Presentation Slides, PDFs, Source Code and other presenter materials are available at: https://github.com/CppCon/CppCon2017 — Hash tables consume a large volume of both compute resources and memory across Google's production system. The design for hash tables in C++ traces its origins to the SGI STL implementation from 20 years ago. Over these years, computer architecture and performance has changed dramatically and we need to evolve this fundamental data structure to follow those changes. This talk describes the process of design and optimization that starts with…

saved by

related reading