Speaking of hash tables, I'm interested in optimizing hash tables that are usually really small. [..]
-
-
why? a binary search tree would be super branchy, whereas SIMD can search the entire table in one go
-
Because you’re executing log(8) == 3 cmp+branch fused insns vs. 4 slower AVX instructions.
- 4 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.