节点文献
一种基于多媒体应用的缓存替换算法研究
The Research of a New Cache Replacement Algorithm for Multimedia Application
【Author】 Jiguang Wan, Jibin Wang, Changsheng Xie Dept. of Computer Science, Huazhong University of Science and Technology, China
【机构】 华中科技大学计算机学院;
【摘要】 多媒体应用对存储性能要求很高,由于磁盘系统性能发展比较慢,完全不能够满足多媒体共享的需要。Cache技术是目前提高存储性能的常用技术,针对多媒体请求访问地址可预测的特点,设计了一种FOPT(ForecastOPT)缓存替换算法。根据多媒体访问的地址连续性,来预测将来访问的地址顺序,并采用平衡二叉树的先序线索组织cache的数据块,从而快速实现基于预测的FOPT算法。仿真不同的客户端的情况下,对FOPT和LRU算法命中率进行了测试,从结果看,当请求块大小达到64KB时,FOPT算法的命中率比LRU命中率高50-70%,充分说明了FOPT算法的有效性。
【Abstract】 The multimedia applications require high storage performance, but because of the mechanical localization property of the disk, which completely cannot satisfy the demand of the multimedia sharing. The Cache technology is commonly used methods to resolve the problem at present, Classified by the predictable characters of request address for multimedia streams, a replacement algorithm called FOPT(Forecast OPT) is proposed, it may forecast access request address according to address continuities of the multimedia. The paper uses preorder traversal index of the balanced binary tree to organize cache the block data, thus can realize FOPT algorithm fast based on the forecast. The test to the hit probability of FOPT and LRU algorithm in the simulation different client situations has shown that when the request block size achieves 64KB, the FOPT algorithm’s hit probability has 50%-70% improvement over the LRU algorithm, which fully manifests the validity of FOPT algorithm in the multimedia applications.
- 【会议录名称】 第六届和谐人机环境联合学术会议(HHME2010)、第19届全国多媒体学术会议(NCMT2010)、第6届全国人机交互学术会议(CHCI2010)、第5届全国普适计算学术会议(PCC2010)论文集
- 【会议名称】第六届和谐人机环境联合学术会议(HHME2010)、第19届全国多媒体学术会议(NCMT2010)、第6届全国人机交互学术会议(CHCI2010)、第5届全国普适计算学术会议(PCC2010)
- 【会议时间】2010-10-24
- 【会议地点】中国河南洛阳
- 【分类号】TP333
- 【主办单位】中国计算机学会多媒体技术专业委员会 、中国图象图形学学会多媒体专业委员会 、中国计算机学会普适计算专业委员会、ACM SIGCHI 中国分会、中国自动化学会