This repository has been archived by the owner on Dec 22, 2022. It is now read-only.
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.
Implemented Parallel PR-Nibble.
This should be substantially simpler than the original gunrock version or @neoblizz's work in progress #69
Note: This matches the reference implementation from SDH, which is parameterized slightly different than the HIVE version. I need to dig up the HIVE reference code to make sure this is right, but it's definitely close. Maybe need to change the formulation slightly.
Observations:
batch
operator, but I think maybe we're doing lots of small kernel launches. Theessentials
version actually isn't any faster than a single threaded (!) CPU implementation onjhu.mtx
, with the parameters that are hardcoded now. I think this is because the algorithm doesn't actually do a whole lot of work (in Pagerank terms, it doesn't spread mass to enough nodes). If you reducealpha
to0.05
or0.01
runtime goes up (less strongly local / more global diffusion) and theessentials
version beats the CPU version.Reference: Fig 5 + 6 in this paper -- https://arxiv.org/pdf/1604.07515.pdf