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

Zipf 分布对象下缓存驱逐算法的能效

Energy efficiency of cache eviction algorithms for Zipf distributed objects

Emese Sziklay, Tamás Jursonovics

AI总结:

本文针对CDN能效问题,提出结合准入策略和PLFU驱逐策略的新缓存算法,并以总CPU时间为新指标,证明其实现简单且兼具高缓存命中率和低CPU时间。

摘要:

本文对真实数据上的 Least Frequently Used (LFU) 和 Perfect Least Frequently Used (PLFU) 缓存驱逐算法进行了总结分析,应用于 Content Delivery Networks (CDNs) 以及 Zipf 分布样本。鉴于近年来能源成本上升导致对 CDNs 能效的日益重视,本文考虑并探讨了运行缓存算法所需的总 CPU 时间。总 CPU 时间代表了一种评估缓存性能的新指标,并与传统的 Cache Hit Ratio (CHR) 指标进行了对比。此外,提出了一种结合准入策略和 PLFU 驱逐策略的新算法。结果表明,该算法实现简单直接,并提供高 CHR 和低 CPU 时间。

英文摘要:

This paper presents a summary analysis of the Least Frequently Used (LFU) and Perfect Least Frequently Used (PLFU) cache eviction algorithms on real data, transferred on Content Delivery Nettworks (CDNs), as well as on Zipf distributed samples. In light of the growing emphasis on energy efficiency in CDNs in recent years due to rising energy costs, this paper considers and discusses the total CPU time required to run a cache algorithm. The total CPU time represents a novel metric for evaluating cache performance, and it is contrasted with the conventional Cache Hit Ratio (CHR) metric. Furthermore, a new algorithm with an admission policy and the eviction strategy that of PLFU is presented. The results demonstrate that it is a simple and straightforward algorithm to implement and offers high CHR and low CPU time.

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

↑