Added parallel wordcount example. #475
Merged
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
|
This is a great example. Love it. |
StefanKarpinski
added a commit
that referenced
this pull request
Feb 27, 2012
Added parallel wordcount example.
KristofferC
added a commit
that referenced
this pull request
Aug 4, 2018
KristofferC
added a commit
that referenced
this pull request
Aug 4, 2018
KristofferC
added a commit
that referenced
this pull request
Aug 4, 2018
KristofferC
added a commit
that referenced
this pull request
Aug 4, 2018
KristofferC
added a commit
that referenced
this pull request
Feb 11, 2019
Keno
pushed a commit
that referenced
this pull request
Oct 9, 2023
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.
Now that the map-reduce wordcount is working, I thought it might make a good example to include as a simple illustration of spawn-fetch parallelization. I've tried to add enough comments to make it a good educational tool, explaining what each part does.
Currently the major limitation of this implementation is that the "reduce" is single-threaded. I haven't been able to find a way to perform a key-sort-and-separate step on the HashTables returned by the map step, to allow parallelizing reduce, that isn't just as slow as doing the reduce on a single node anyway.