[
https://issues.apache.org/jira/browse/HAMA-599?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13443873#comment-13443873
]
Thomas Jungblut commented on HAMA-599:
--------------------------------------
Yeah, basically repairing can be paired with partitioning. So it automatically
completes the graph.
The underlying problem is that our messaging is not scalable, I actually hoped
to address this with the diskqueue.
> Improvement of network-based runtime partitioner
> ------------------------------------------------
>
> Key: HAMA-599
> URL: https://issues.apache.org/jira/browse/HAMA-599
> Project: Hama
> Issue Type: Improvement
> Components: bsp core, graph
> Affects Versions: 0.5.0
> Reporter: Edward J. Yoon
> Assignee: Edward J. Yoon
> Fix For: 0.6.0
>
> Attachments: multi-stepPartitioning.patch
>
>
> Current runtime partitioning in graph is really inefficient and melodramatic.
> This issue improves code or figures out another way. See also HAMA-531
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
