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

["Edward J. Yoon (JIRA)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/HAMA-783?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Edward J. Yoon resolved HAMA-783.
---------------------------------

    Resolution: Fixed

This issue has been fixed. 

To choose the default one, I'll attach the experiment results on wiki later. Thanks.

> 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
>            Assignee: Edward J. Yoon
>             Fix For: 0.7.0
>
>         Attachments: patch.txt
>
>
> 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 was sent by Atlassian JIRA
(v6.1.5#6160)