Add a "lazy" queue #145
Draft
Add a "lazy" queue #145
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
polytypic
force-pushed
the
add-lazy-queue
branch
9 times, most recently
from
b83355a
to
5fe2462
Compare
This essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1). The lazy queue is then wrapped as a single atomic. This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.
polytypic
force-pushed
the
add-lazy-queue
branch
from
5fe2462
to
30fafa9
Compare
2 tasks
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 essentially uses a "lazy" semi-immutable queue implemented using a mutable spine that is updated incrementally such that every operation on the queue is O(1).
The lazy queue is then wrapped as a single atomic.
This results in a relatively space efficient concurrent queue. Performance also seems relatively good with the obvious caveat that as only a single atomic is used, that atomic is a contention point, which somewhat limits scalability compared to queues that have separate mutable head and tail atomics.