Optimizing static search trees: Achieving 40x speedup over binary search through low-level performance tuning
Table of Contents 1 Introduction 1.1 Problem statement 1.2 Motivation 1.3 Recommended reading 1.4 Binary search and Eytzinger layout 1.5 Hugepages 1.6 A note on benchmarking 1.7 Cache lines 1.8…
Read the full articleYou might also wanna read
Building Faster Parsers Through Data-Oriented Design: Flat Arrays Over Pointer Trees
How designing the data structure first (flat arrays of indices instead of a pointer tree) makes a parser fast and collapses memory layout, a
B-Trees, LSM Trees, and the Indexing Tradeoff Spectrum
> **Cross-posted.** This article's canonical home is [Iceberg Lakehouse](
One More Thing About List Binary Search
I wanted to point people to this link at DotNetPearls: They do an excellent, quick demonstration of List .BinarySearch and show a graph that
Understanding CPU Branch Prediction and Branchless Programming in C++
Stop letting CPU mispredictions slow down your code. This guide covers C++ branch prediction internals, branchless programming patterns, and
towardsdev.com·25d ago
Modular: Understanding SIMD: Infinite Complexity of Trivial Problems
Understanding SIMD: Infinite Complexity of Trivial Problems
Learn Data Structures and Algorithms in a Single Post: A Complete DSA Tutorial From Big-O to Trees, Graphs, and Dynamic Programming
A complete Data Structures and Algorithms tutorial in one blog post. Covers the whole subject in 5 stages: Big-O + basics (complexity analys
Comments
Sign in to join the conversation.
No comments yet. Be the first.