You are viewing a plain text version of this content. The canonical link for it is here.

Posted to dev@hama.apache.org by "Thomas Jungblut (JIRA)" <ji...@apache.org> on 2012/09/11 08:33:09 UTC

[jira] [Commented] (HAMA-596) Optimize memory usage of graph job

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

Thomas Jungblut commented on HAMA-596:
--------------------------------------

from HAMA-598:

bq.In regards to memory usage, do you think it is neeeded to store the destination peer address on every vertex?
bq.Especially when it comes to fault tolerance where these values can change easily.
bq.Actually it would be better to calculate them on the fly based on the given partitioner.

I think this is the most memory costly variable. I will profile later on with the wikipedia dataset again.
                
> Optimize memory usage of graph job
> ----------------------------------
>
>                 Key: HAMA-596
>                 URL: https://issues.apache.org/jira/browse/HAMA-596
>             Project: Hama
>          Issue Type: Improvement
>          Components: graph
>    Affects Versions: 0.5.0
>            Reporter: Edward J. Yoon
>            Assignee: Thomas Jungblut
>             Fix For: 0.6.0
>
>
> This somewhat problematic.

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