检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学计算机科学系,长沙410073
出 处:《计算机研究与发展》2000年第2期207-212,共6页Journal of Computer Research and Development
基 金:国家预研基金
摘 要:大规模视频点播(LSVOD)中cache机制是提高系统效率的有效手段,是支持VOD实用化的关键技术之一.由于连续媒体的数据量大,使用周期长等特点,传统的cache替换算法不能直接应用于LSVOD.文中根据VOD的特点开发了两种基于访问频率的替换算法:LFRU(leastfrequency and recently used)和PLFU(period leastfre-quency used)算法,它们都试图将访问频率大的视频数据保留在cache中.LFRU 算法结合了数据的访问频率和访问时间信息,对访问模式的变化具有一定的适应性.PLFU 算法用周期法和预测法解决了LFU 算法中的cache“污染”问题.实验数据显示,新的替换算法比传统的替换算法效率高,更适合大规模的VOD系统.Cache schema is very important for LSVOD (large scale video on demand) system and it is one of the most important techniques to enable VOD to enter market. The disk cache is different from memory cache in several ways for the large volume and high bandwidth requirement of continuous media data. 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 both algorithms. PLFU is an improved LFU algorithm, which solves the cache pollution problem of LFU algorithm. It is shown by means of simulation and experiments that the new algorithms are more effective and more suitable than others for LSVOD system.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.29.99