[
https://issues.apache.org/jira/browse/HAMA-891?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Edward J. Yoon updated HAMA-891:
--------------------------------
Assignee: Bhathiya Supun
> Implement greedy heuristic partitioning algorithm
> -------------------------------------------------
>
> Key: HAMA-891
> URL: https://issues.apache.org/jira/browse/HAMA-891
> Project: Hama
> Issue Type: New Feature
> Components: graph
> Reporter: Edward J. Yoon
> Assignee: Bhathiya Supun
> Labels: gsoc2014
>
> See http://www.charlesneedham.com/pubs/166151/kdd325-stanton.pdf
> {quote}Conclusion:
> We have demonstrated that simple, one-pass streaming graph partitioning
> heuristics can dramatically improve the edge-cut in distributed graphs. Our
> best performing heuris- tic is the linear weighted variant of the greedy
> algorithm. This is a simple and effective preprocessing step for large graph
> computation systems, as the data must be loaded onto the cluster any way.
> ...{quote}
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
