Download to read offline
Uploaded byScyllaDB
11 views
40x Faster Binary Search by Ragnar Groot Koerkamp
This talk will first expose the lie that binary search takes O(lg n) time -- it very much does not! Instead, we will see that binary search has only constant overhead compared to an oracle. Then, we will exploit everything that modern CPUs have to offer (SIMD, ILP, prefetching, efficient caching) in order to gain 40x increased throughput over the Rust standard library implementation.
