[
https://issues.apache.org/jira/browse/HAMA-423?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13088164#comment-13088164
]
Thomas Jungblut edited comment on HAMA-423 at 8/20/11 10:47 AM:
----------------------------------------------------------------
Once comitted we have to rewrite http://wiki.apache.org/hama/SSSP, it is now a
textfile(can be found here:
http://hama-shortest-paths.googlecode.com/svn/trunk/hama-gsoc/files/cities-adjacencylist/sssp-adjacencylist.txt),
for the people who want to submit their own graph and for them who download a
large sequencefile.
Later on we can extend AbstractGraphPartitioner to work with some kind of
inputformat,recordreader or compression codec. So it is once step to HAMA-258.
We can use this in the Pregel API, too since this is class based via
configuration:
{noformat}
(Class<T>) conf.getClass("hama.partitioning.vertex.class",
Vertex.class);
{noformat}
Would someone please review this with a sample file?
was (Author: thomas.jungblut):
Once comitted we have to rewrite http://wiki.apache.org/hama/SSSP, it is
now a textfile, for the people who want to submit their own graph and for them
who download a large sequencefile.
Later on we can extend AbstractGraphPartitioner to work with some kind of
inputformat,recordreader or compression codec. So it is once step to HAMA-258.
We can use this in the Pregel API, too since this is class based via
configuration:
{noformat}
(Class<T>) conf.getClass("hama.partitioning.vertex.class",
Vertex.class);
{noformat}
Would someone please review this with a sample file?
> 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, sickimprovement.PNG
>
>
> 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
