Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Page rank was breaking after one iteration. #3

Merged
merged 1 commit into from
Jul 8, 2015

Conversation

ogreen
Copy link
Contributor

@ogreen ogreen commented Jul 8, 2015

Page rank was breaking after a single iteration. Seems like that that "break" was added there for timing purposes.

jshun added a commit that referenced this pull request Jul 8, 2015
Page rank was breaking after one iteration.
@jshun jshun merged commit e15cfa6 into jshun:master Jul 8, 2015
gposluns pushed a commit to mcj-group/ligra that referenced this pull request Oct 23, 2024
Title: Fine-Grain SetCover_Serial Implementation

Brief comment: Implementing the Swarm version of serial SetCover algorithm, and improve the performance by breaking the main function into finer tasks: addSet, coverElement and removeSet

Test plan: I verified this commit does not cause application crashes when running:

scons -j1 --gcc runtime=swarm ligra
scons -j16 --gcc runtime=swarm ligra
~/sim/build/opt/sim/sim -config ~mcj/swarm-configs/1c.cfg -- ./build/release/ligra/apps/bucketing/plsSetCover_fg -rounds 0 ./inputs/pbbs/mis/cage10.pbbs
~/sim/build/opt/sim/sim -config ~mcj/swarm-configs/16c.cfg -- ./build/release/ligra/apps/bucketing/plsSetCover_fg -rounds 0 ./inputs/pbbs/mis/cage10.pbbs

Co-authored-by: Mark Jeffrey <mcj@ece.utoronto.ca>
gposluns pushed a commit to mcj-group/ligra that referenced this pull request Oct 23, 2024
1) Remove isSetCovered as it is equivalent to cardinality == 0
2) This makes hint selection far more obvious
3) Use enqueuer trees for the equally unordered tasks

Point jshun#3 could bite us for extremely high-degree vertices. But the
__enqueuer is a lot more efficient than the progressive enqueuer.

Unfortunately on the cage10 input, execution time is dominated by
coalescers and splitters. Is this something inherent (and Hive would
fix), or do we have a performance bug somewhere?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants