arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.03174cs.DS
收藏

计算相似缓存的命中率

Computing the Hit Rate of Similarity Caching

Younes Ben Mazziane, Sara Alouf, Giovanni Neglia, Daniel Sadoc Menasche

摘要:

相似性高速缓存允许由相似项\(i'\)服务对项\(i\)的请求。应用包括推荐系统、多媒体检索和机器学习。最近,已经提出了许多相似性缓存策略,但我们仍然不知道如何计算命中率,即使是最简单的策略,如SIM-LRU和RND-LRU,是经典缓存算法的直接修改。本文提出了第一个算法来计算的相似性缓存策略的命中率下的独立参考模型的请求过程。特别是,我们的工作展示了如何扩展流行的TTL近似从经典的缓存相似性缓存。该算法的合成和现实世界的痕迹进行评估。

英文摘要:

Similarity caching allows requests for an item \(i\) to be served by a similar item \(i'\). Applications include recommendation systems, multimedia retrieval, and machine learning. Recently, many similarity caching policies have been proposed, but still we do not know how to compute the hit rate even for the simplest policies, like SIM-LRU and RND-LRU that are straightforward modifications of classical caching algorithms. This paper proposes the first algorithm to compute the hit rate of similarity caching policies under the independent reference model for the request process. In particular, our work shows how to extend the popular TTL approximation from classic caching to similarity caching. The algorithm is evaluated on both synthetic and real world traces.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑