Possible performance improvement by replacing % (modulo) with multiply + shift
Open
Nobody has claimed this yet.
performance
- Dominant language
- C++
- Stars
- 368
- Forks
- 89
- PR merge metrics
- No merged PRs in 30d
Description
This is described in http://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/
(I'm looking for a fast Bloom filter implementation, and found your implementation uses modulo which is a bit slow.)
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the Bloom filter implementation that currently uses modulo and read the linked Lemire article. Benchmark the existing reduction against the proposed approach while checking that filter behavior remains unchanged; done means a measured performance improvement with no regression in correctness.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100