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] [Created] (HAMA-891) Implement greedy heuristic partitioning algorithm
Date Tue, 18 Mar 2014 10:32:44 GMT
Edward J. Yoon created HAMA-891:
-----------------------------------

             Summary: 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


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.2#6252)

Mime
View raw message