Use SIEVE as underlying LRU?

[Swatinem]

I recently read about SIEVE (https://cachemon.github.io/SIEVE-website/, https://www.usenix.org/system/files/nsdi24-zhang-yazhuo.pdf) which is advertised as a simpler and better alternative for LRU.

It is also mentioned that it can serve as an underlying primitive for more advanced eviction algorithms.

---

So I wanted to give it a shot to actually implement it within moka but got sidetracked (#445 😅).

I’m still trying to fully piece together all the moving parts in my head, and I stumbled across the access-order and write-order dques, and now I’m wondering if any other piece of functionality has a hard requirement on having the elements sorted in access order, vs write order? SIEVE does not reorder elements at all, so it maintains write-order naturally.

Does it make sense to continue with this effort? Is there a possibility this could be worthwhile?