摘要
缓存是提高Web应用程序性能的一个重要手段。.NET平台下提供了数据缓存与页面缓存技术,在已经实现的缓存对象的基础上,设计了一种缓存对象的自适应替换算法。算法使用了基于缓存对象的价值与被访问频率的综合优先级策略,提出了相应的缓存对象被替换规则。算法充分考虑了缓存对象之间的依赖关系对优先级的影响。从对象命中率与系统的整体响应时间两个方面测试了算法的性能,测试表明所提出算法相对于最小价值算法、最少使用频率算法有较大的改进。
Caching is an important means for improving the performance of Web application. It provides data caching and page caching on. NET platform,and designs a self-adaptive caching object replacement algorithm which is based on realized object caching method. The algo- rithm adopts the caching object-based value and a comprehensive priority policy for the frequency accessed, and presents the rules of relevant replaced caching objects. There are depending relations among the caching objects. The influence on priority exerted by this characteristic is sufficiently considered. Based on object hit ratio and global response time, an experiment which tests the algorithm performance is completed. The experimental results show that the algorithm can obviously improve the performance in classical least value and least recently used caching object replacement algorithm.
出处
《计算机应用与软件》
CSCD
2009年第1期131-133,152,共4页
Computer Applications and Software
关键词
对象缓存
替换算法
自适应
优先级
Object caching Replacement algorithm Self-adaptive Priority
