search

sylab / cacheus

The design and algorithms used in Cacheus are described in this USENIX FAST'21 paper and talk video: https://www.usenix.org/conference/fast21/presentation/rodriguez
59 stars 17 forks source link

Questions about cacheus algorithm ? #5

Closed xiaoyaozhuzi closed 3 years ago

xiaoyaozhuzi commented 3 years ago

Why choose lru algorithm from q queue? image

The data that may match is in s queue.

lia54 commented 3 years ago

Hi, the idea is to protect items with high reuse in R (s queue in the code) by allowing Cacheus to evict only from the scan resistant portion of the cache SR (q queue in the code). Items from R will eventually get pushed or demoted to SR for eviction.

lia54 commented 3 years ago

The decision of using the LRU algorithm to manage SR (q queue) is to give the opportunity of capturing any recency that might be in new items entering the cache.

sylab commented 3 years ago

Closing due to inactivity.