hopscotch hashing #16
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
We need to review and merge this pull request before the end of GSoC 2018 because Daivik needs it: https://groups.google.com/d/msg/linux-xia/bROqF5u1oX4/x1XCAVymCgAJ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This version adopts the hopscotch hashing instead of the simple hashing function to manage the XID types. The hopscotch hashing implementation is based on the original paper:
Herlihy, Maurice, Nir Shavit, and Moran Tzafrir. "Hopscotch hashing." Distributed Computing. Springer Berlin Heidelberg, 2008. 350-364.
You can find the paper here:
http://people.csail.mit.edu/shanir/publications/disc2008_submission_98.pdf
The experiments on the performance of different hashing algorithms are maintained here:
https://github.com/mengxiang0811/GSoC15-perfect-hashing