[
https://issues.apache.org/jira/browse/HAMA-423?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13088081#comment-13088081
]
Thomas Jungblut commented on HAMA-423:
--------------------------------------
11/08/20 01:58:47 INFO graph.ShortestPaths: Starting data partitioning...
11/08/20 01:59:37 INFO graph.ShortestPaths: Finished!
for 2.000.000 vertices. Sounds nice ;D
> Improve and Refactor Partitioning in the Examples
> -------------------------------------------------
>
> Key: HAMA-423
> URL: https://issues.apache.org/jira/browse/HAMA-423
> Project: Hama
> Issue Type: Improvement
> Components: examples
> Affects Versions: 0.3.0
> Reporter: Thomas Jungblut
> Assignee: Thomas Jungblut
> Fix For: 0.4.0, 0.5.0
>
> Attachments: HAMA-423-v1.patch
>
>
> Currently partitioning will write a key/value pair for each vertex/adjacent
> mapping.
> This results in heavy IO writes which actually bloats the file and let the
> partitioning take unnecessarily long.
> We should partition directly into the vertex classes and implement a vertex
> list/array writable which just writes a single key/value pair for a
> vertex/all-adjacents mapping.
> In fact we should make it generic, passing a vertex class which should
> implement the Writable interface.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
