Add a transaction benchmark using a naïve unscalable leftist heap #196
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-xt-leftist-heap-benchmark
branch
5 times, most recently
from
60a0454
to
e69a3ea
Compare
polytypic
force-pushed
the
add-xt-leftist-heap-benchmark
branch
from
e69a3ea
to
f58ca2d
Compare
polytypic
force-pushed
the
add-xt-leftist-heap-benchmark
branch
3 times, most recently
from
0425887
to
1218728
Compare
polytypic
force-pushed
the
add-xt-leftist-heap-benchmark
branch
from
1218728
to
fa732ba
Compare
polytypic
force-pushed
the
add-xt-leftist-heap-benchmark
branch
from
fa732ba
to
609c614
Compare
polytypic
force-pushed
the
add-xt-leftist-heap-benchmark
branch
from
609c614
to
cd3dd6c
Compare
polytypic
force-pushed
the
add-xt-leftist-heap-benchmark
branch
from
cd3dd6c
to
b59e19c
Compare
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 another benchmark that stresses the transaction mechanism. The benchmark is based on a naïve leftist heap data structure. The problem with that is that every operation modifies the root. That is a fundamental sequential bottleneck and it means that the data structure simply cannot scale to multiple cores such that thruput would improve by adding workers. Nevertheless this could be a useful benchmark of the transaction mechanism.