Re:Nibble Sort
by davidtgoldblatt on Tuesday July 21, 2015 @12:12PM
(#9923295)
Just to emphasize the truly remarkable thing here: the winning (SIMD) solution takes about 1ns per word sorted -- just over 3 machine cycles to sort 16 nibbles. Note that even extracting a nibble from a word in the naive manner would take about the same amount of time. The speedup from using SIMD registers is tremendous, and should be a lesson to anyone who spends their time micro-optimizing hot functions.
[ Parent
| on HN ]
There are no comments on this comment yet.