Claudio Martella commented on GIRAPH-91:

The List-based adjacency list looks quite good to me. A couple of weeks ago I 
did a microbenchmark on iteration-performance of arrayList/array, TreeMap, 
HashMap and SkipList and I was quite impressed about the performance hit. I 
believe we don't only save memory here (would be curious to calculate precisely 
the overhead) but also in speedup with algorithms, such as PR, where the 
compute has an iterator-based sendMsg pattern. Good!
> Large-memory improvements (Memory reduced vertex implementation, fast 
> failure, added settings) 
> -----------------------------------------------------------------------------------------------
>                 Key: GIRAPH-91
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-91
>             Project: Giraph
>          Issue Type: Improvement
>            Reporter: Avery Ching
>            Assignee: Avery Ching
>         Attachments: GIRAPH-91.diff
> Current vertex implementation uses a HashMap for storing the edges, which is 
> quite memory heavy for large graphs.  The default settings in Giraph need to 
> be improved for large graphs and heaps of >20G.

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: 
For more information on JIRA, see: http://www.atlassian.com/software/jira


Reply via email to