Use a parallel taskloop for the CountPredicates operation #342
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
joka921
force-pushed
the
f.parallelPatternTrick
branch
from
067ac30
to
77ac78d
Compare
joka921
force-pushed
the
f.parallelPatternTrick
branch
from
7856482
to
183f996
Compare
joka921
force-pushed
the
f.parallelPatternTrick
branch
from
63fb1a6
to
1394554
Compare
joka921
force-pushed
the
f.parallelPatternTrick
branch
from
863dc51
to
bc64ae0
Compare
-The degree of parallelism is configurable at compiletime Since it is task-based it also performs well under heavy load. -Updated Dockerfile to use Ubuntu 20.04. This is required for sufficient OpenMP support.
joka921
force-pushed
the
f.parallelPatternTrick
branch
from
7fca1c2
to
8a4ac9f
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.
The CountPredicates operation ("Pattern Trick") can be easily parallelized by
counting the predicates for subsets of the input and later adding/merging them.
This PR delivers a first implementation of this parallelization using OpenMP
TODO:
which does the final step in the reduction linearly (at least in the current GCC implementation), because this is
typically a simple operation (addition) but in our case it is a merging of hash maps which can take some time.