hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Edward J. Yoon (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HAMA-891) Implement greedy heuristic partitioning algorithm
Date Mon, 01 Sep 2014 01:13:21 GMT

    [ https://issues.apache.org/jira/browse/HAMA-891?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14116960#comment-14116960

Edward J. Yoon commented on HAMA-891:

Sure, if you have any helps/questions, Please feel free to comment here!

> 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
> ...{quote}

This message was sent by Atlassian JIRA

View raw message