hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Hudson (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HAMA-783) Efficient InMemory Storage for Vertices
Date Fri, 03 Jan 2014 07:25:51 GMT

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

Hudson commented on HAMA-783:
-----------------------------

FAILURE: Integrated in Hama-trunk #221 (See [https://builds.apache.org/job/Hama-trunk/221/])
HAMA-783: Efficient InMemory Storage for Vertices (edwardyoon: rev 1555020)
* /hama/trunk/examples/src/main/java/org/apache/hama/examples/SSSP.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/DiskVerticesInfo.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/GraphJobRunner.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/IDSkippingIterator.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/ListVerticesInfo.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/OffHeapVerticesInfo.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/Vertex.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/VertexInterface.java
* /hama/trunk/graph/src/main/java/org/apache/hama/graph/VerticesInfo.java
* /hama/trunk/graph/src/test/java/org/apache/hama/graph/TestDiskVerticesInfo.java
* /hama/trunk/graph/src/test/java/org/apache/hama/graph/TestOffHeapVerticesInfo.java
* /hama/trunk/ml/src/main/java/org/apache/hama/ml/semiclustering/SemiClusteringVertex.java


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

Mime
View raw message