[
https://issues.apache.org/jira/browse/GIRAPH-461?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13570706#comment-13570706
]
Alessandro Presta commented on GIRAPH-461:
------------------------------------------
True, OOC with multithreading has to be fixed anyway (thanks for doing that!),
but the LRU cache is an orthogonal improvement, so it would be good to see some
examples where it proves beneficial (like you said, it depends on the algorithm
and graph structure) and also make sure that performance doesn't degrade in
other cases. We can disregard multithreading in this sort of comparison.
> Convert static assignment of in-memory partitions with LRU cache
> ----------------------------------------------------------------
>
> Key: GIRAPH-461
> URL: https://issues.apache.org/jira/browse/GIRAPH-461
> Project: Giraph
> Issue Type: Sub-task
> Components: graph
> Reporter: Claudio Martella
> Attachments: GIRAPH-461.patch, GIRAPH-461.patch, GIRAPH-461.patch
>
>
> Currently, the out-of-core partitions are assigned to memory or to disk
> statically. Using an LRU cache should help keeping in-memory only the
> partitions that are actively accessed, given a job that does not access all
> the graph at each superstep (traversals) and a good data partitioning (non
> random).
--
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
