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 2014/01/03 08:19:51 UTC
[jira] [Assigned] (HAMA-783) Efficient InMemory Storage for
Vertices
[ https://issues.apache.org/jira/browse/HAMA-783?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Edward J. Yoon reassigned HAMA-783:
-----------------------------------
Assignee: Edward J. Yoon
> 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)