3 ms·
The more recent results (by the same author) is this paper: https://arxiv.org/pdf/1509.05053.pdf https://arxiv.org/pdf/1509.05053.pdf The conclusion is still t
by pubby 6y ago
The more recent results (by the same author) is this paper: https://arxiv.org/pdf/1509.05053.pdf https://arxiv.org/pdf/1509.05053.pdf
The conclusion is still that CMOV is best, but once the data stops fitting in the cache there's alternatives worth considering.
- eloff 6y agoI just stumbled over this one independently while researching this topic some more, it's an interesting read, thanks for sharing. > For readers only interested in an executive summary, our results are the following: For arrays small enough to be kept in L2 cache, the branch-free binary search code is the fastest algorithm. For larger arrays, the Eytzinger layout, combined with the branch-free prefetching search algorithm is the fastest general-purpose layout/search algorithm combination.