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

Posted to dev@hama.apache.org by "Edward J. Yoon (JIRA)" <ji...@apache.org> on 2013/08/07 10:33:52 UTC

[jira] [Commented] (HAMA-783) Efficient InMemory Storage for Vertices

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

Edward J. Yoon commented on HAMA-783:
-------------------------------------

Updated description. We need to benchmarks and also consider the FT.
                
> Efficient InMemory Storage for Vertices
> ---------------------------------------
>
>                 Key: HAMA-783
>                 URL: https://issues.apache.org/jira/browse/HAMA-783
>             Project: Hama
>          Issue Type: Improvement
>          Components: graph
>            Reporter: Edward J. Yoon
>             Fix For: 0.7.0
>
>
> Currently there are ListVerticesInfo, DiskVerticesInfo and DirectMemory, but I personally think we have to do a big re-design of the vertices storage and graph job runner. 
> Actually, the size of split is not so great. Maybe, 60 ~ 200MB. Hence, I don't think DiskVerticesInfo will be really helpful. Instead, we can use the Serialization like Spark.
> Update:
> 1) We also need to consider the checkpointing for Fault Tolerance, periodically.
> 2) If DiskVerticesInfo shows good performance, we can use just the DiskVerticesInfo.

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