4 ms·
64 KB is a pretty significant budget for such a small operation. I've had a variant that uses 768 bytes with some extra logic, but will deprecate that kernel so
by ashvardanian 2y ago
64 KB is a pretty significant budget for such a small operation. I've had a variant that uses 768 bytes with some extra logic, but will deprecate that kernel soon.
https://github.com/ashvardanian/StringZilla/blob/0d47be212c5abd69bf2bbf2a97c93c718d4fd423/include/stringzilla/stringzilla.h#L3136 https://github.com/ashvardanian/StringZilla/blob/0d47be212c5...
- sroussey 2y agoThis seems like something that could be in hardware to allow native execution of the instruction. Is that not the case anywhere?
- RaisingSpear 2y agoIf you scale up the multipliers, you should be able to eliminate the variable shift, which would reduce the lookup table to 512 bytes.