You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
/// Performs size-aware admission explained in the paper:/// [Lightweight Robust Size Aware Cache Management][size-aware-cache-paper]/// by Gil Einziger, Ohad Eytan, Roy Friedman, Ben Manes.////// [size-aware-cache-paper]: https://arxiv.org/abs/2105.08770////// There are some modifications in this implementation:/// - To admit to the main space, candidate's frequency must be higher than/// the aggregated frequencies of the potential victims. (In the paper,/// `>=` operator is used rather than `>`) The `>` operator will do a better/// job to prevent the main space from polluting./// - When a candidate is rejected, the potential victims will stay at the LRU/// position of the probation access-order queue. (In the paper, they will be/// promoted (to the MRU position?) to force the eviction policy to select a/// different set of victims for the next candidate). We may implement the/// paper's behavior later?
(I am going to try to test this out, and If I can identify the answer, I will make a pull request.
That would be great. Thanks!
FYI, currently, the doc only mentions the followings:
This issue is not really a problem with Moka, but more an ask for clarification in the documentation.
Does the size aware eviction evict items on a first-in-first-out basis, or does it evict the largest items in the cache first?
(I am going to try to test this out, and If I can identify the answer, I will make a pull request.
The text was updated successfully, but these errors were encountered: