accumulo-notifications mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Dave Marion (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (ACCUMULO-4626) improve cache hit rate via weak reference map
Date Thu, 04 May 2017 18:36:04 GMT

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

Dave Marion commented on ACCUMULO-4626:
---------------------------------------

Agreed. I was merely stating that Ignite has a distributed cache, but you can run it in local
mode (non-distributed). It appears that you can access it via the JCache API and it's own
native API, much like JBoss Infinispan. Was not aware of ohc, thanks for the link.

In either case, I'm wondering if we should be looking at off-heap caching in general.

> improve cache hit rate via weak reference map
> ---------------------------------------------
>
>                 Key: ACCUMULO-4626
>                 URL: https://issues.apache.org/jira/browse/ACCUMULO-4626
>             Project: Accumulo
>          Issue Type: Improvement
>          Components: tserver
>            Reporter: Adam Fuchs
>              Labels: performance, stability
>          Time Spent: 1h
>  Remaining Estimate: 0h
>
> When a single iterator tree references the same RFile blocks in different branches we
sometimes get cache misses for one iterator even though the requested block is held in memory
by another iterator. This is particularly important when using something like the IntersectingIterator
to intersect many deep copies. Instead of evicting completely, keeping evicted blocks into
a WeakReference value map can avoid re-reading blocks that are currently referenced by another
deep copied source iterator.
> We've seen this in the field for some of Sqrrl's queries against very large tablets.
The total memory usage for these queries can be equal to the size of all the iterator block
reads times the number of readahead threads times the number of files times the number of
IntersectingIterator children when cache miss rates are high. This might work out to something
like:
> {code}
> 16 readahead threads * 200 deep copied children * 99% cache miss rate * 20 files * 252KB
per reader = ~16GB of memory
> {code}
> In most cases, evicting to a weak reference value map changes the cache miss rate from
very high to very low and has a dramatic effect on total memory usage.



--
This message was sent by Atlassian JIRA
(v6.3.15#6346)

Mime
View raw message