LockFreeLinkedSet: add initial implementation #335
Merged
Conversation
This file contains hidden or 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
jdantonio
added
enhancement
|
@ianks If you don't mind, I'd like to wait until the full release of 0.9 to merge this. |
|
|
||
| module Concurrent | ||
| module Edge | ||
| class LockFreeLinkedSet |
There was a problem hiding this comment.
Could you include short description of the class and if possible a link to your source of the algorithm?
|
And thank you for your great contributions! |
ianks
force-pushed
the
lock-free-linked-set
branch
from
c61b284 to
10ddb2a
Compare
|
I have addressed the comments on the PR. Let me know if anything else is needed! 😄 |
jdantonio
added a commit
that referenced
this pull request
Jul 8, 2015
LockFreeLinkedSet: add initial implementation
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 PR adds a lock-free set, implemented as a link list. This data-structure is neccesary as a building block for a lock-free concurrent hash table/cache. The only difference is that in a concurrent hash-table, I was use split-ordering on the nodes in the linked list instead ordering the items based on their hash value.
As always, fire away on comments and potential refactorings! Always looking to improve my code.