摘要
根据VOD的特点开发了两种基于访问频率的替换算法:LFRU(least frequency and recently used)和PLFU(period least frequency used)算法,它们都试图将访问频率大的视频数据保留在Cache中。LFRU算法结合了数据的访问频率和访问时间信息,对访问模式的变化具有一定的适应性。PLFU算法用周期法和预测法解决了LFU算法中的Cache“污染”问题。
In this paper, two new Cache replacement algorithms based on access frequency: LFRU (least frequency and recently used) and PLFU (period least frequency used) are developed. LFRU is a trade-off between LRU and LFU, which has advantages of the both algorithms. PLFU is an improved LFU algorithm, which solves the Cache pollution problem of LFU algorithm.
出处
《计算机工程》
CAS
CSCD
北大核心
2004年第7期139-140,180,共3页
Computer Engineering
基金
国家"863"计划基金资助项目(2001AA112072)