摘要
树型加速器中缓存间的共享对于减少Web流量、减轻网络拥塞和改善用户访问时间是一项关键技术,已成为研究热点.基于文件缓存生存期的思想,提出并实现了树型加速器中的EA文件分布算法,改进了[5]中存在的缺陷,定量分析了EA模式和传统模式.在树型加速器中基于两种模式进行了试验和结果分析,实验证明,EA模式在累积命中率、累积字节命中率和平均延迟方面要好于现有的传统模式.
As a key technology to reduce the Web traffic, allivate network traffic and inprove user's access time,the share among caches in the tree-base accelerator becomes a heated research issue. Based on the theory of cache expiration age of file, this paper proposes and realizes EA document placement algorithms in the tree-base accelerator,improves the shortcomings in^[5] and analyzes EA model and tranditional model quantitively, the experiments and analysis in the tree-base accelerator based on two models show that EA model is superior to the tranditional model in cumulate hit rate ,cumulate hit rate of byte and average delay.
出处
《小型微型计算机系统》
CSCD
北大核心
2007年第10期1784-1792,共9页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(60475040)资助
粤港关键领域重点突破项目(2005A10307007)资助.
关键词
协同缓存
EA
文件分布
树型加速器
cooperative cache
EA
document placement
tree-base accelerator.