Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ashvardanian
8 months ago
|
parent
|
context
|
favorite
| on:
Dividing unsigned 8-bit numbers
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/0d47be212c5...
RaisingSpear
8 months ago
|
next
[–]
If you scale up the multipliers, you should be able to eliminate the variable shift, which would reduce the lookup table to 512 bytes.
sroussey
8 months ago
|
prev
[–]
This seems like something that could be in hardware to allow native execution of the instruction. Is that not the case anywhere?
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
https://github.com/ashvardanian/StringZilla/blob/0d47be212c5...