Abstract: For the purpose of improving the cache hit rate for encrypted files, a new cache replacement algorithm based on the access tree of files encrypted by CP-ABE - minimum similarity of attribute ...

An implementation of the B ε tree described by Bender, et al.. Written on top of a custom file-backed LRU cache to allow for simulation of various cache sizes and accurate block access counts.

As a result, there is redundant KV cache IO between GPU global memory and shared memory, along with low GPU utilization. To address these challenges, we propose DeFT(Decoding with Flash Tree-Attention ...

In Web proxy caching, Least-Frequently-Used-Dynamic-Aging (LFU-DA) is one of the common proxy cache replacement methods ... and a decision tree (C4.5). SVM, NB and C4.5 are trained from Web proxy logs ...