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

Make GoFFish Hama's sendToNeighbors more efficient #15

Open
simmhan opened this issue May 21, 2017 · 0 comments
Open

Make GoFFish Hama's sendToNeighbors more efficient #15

simmhan opened this issue May 21, 2017 · 0 comments
Milestone

Comments

@simmhan
Copy link
Contributor

simmhan commented May 21, 2017

Current implementation scans thru all remote vertices to find neighboring subgraphs. Need to maintain an internal adjacency list of subgraph ID or add Iterator <S> getRemoteSubgraphs() to ISubgraph API to make this efficient.

@simmhan simmhan changed the title Make GoFFish Hama's " Make GoFFish Hama's sendToNeighbors more efficient May 21, 2017
@simmhan simmhan added this to the v3.0 milestone May 21, 2017
@simmhan simmhan modified the milestones: v3.1, v3.0 May 29, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant