Scalable and Low Latency Lock-free Data Structures in C++

Explore advanced lock-free and cache-conscious data structures for high-performance C++ programming in this CppCon 2022 talk by Alexander Krizhanovsky. Dive into the challenges of scaling data structures like std::map and std::unordered_map for multi-threaded environments with millions of operations per second. Learn about lock-free approaches, cache-conscious designs, and their impact on modern hardware performance. Examine various hash table implementations and tree structures, focusing on both average and worst-case scenarios to address tail latency issues in large-scale systems. Follow a step-by-step implementation of Hash Trie, a hybrid lock-free cache-conscious data structure, and compare its performance through microbenchmarks. Gain insights into x86-64 memory ordering, cache hierarchies, and operating system preemption to create highly efficient data structures for advanced C++ applications.

UPDATED: Scalable and Low Latency Lock-free Data Structures in C++ - Alexander Krizhanovsky - CppCon