一种对LRFU置换策略的自适应改进  

Improved LRFU algorithm with adaptive replacement

作　　者：李占胜[1] 毕会娟[1] 李艳平[2] 张立松[1] 

机构地区：[1]华北计算技术研究所软件平台研究室,北京100083 [2]北京邮电大学计算机科学与技术学院,北京100876

出　　处：《计算机工程与应用》2008年第17期153-157,共5页Computer Engineering and Applications

基　　金：国家部委预研基金资助项目(the Pre-Research Foundation of China Ministries and Commissions)

摘　　要：数据库缓冲区页面置换算法对磁盘数据库的性能有着重要的影响,页面置换算法主要有基于访问时间的置换策略、基于访问次数的置换策略、两者结合的置换策略等。LRFU算法是一系列结合LRU和LFU置换策略的置换算法,很好地实现了两种置换策略的结合,但却没有给出一种在不同的应用场景中进行动态调整的机制。提出了一种对LRFU算法进行动态调整的方法,模拟测试发现改进的LRFU算法都不同程度地提高了缓冲区命中率。The database buffer page replacement algorithm has an important impact in the performance of the database system. Caching is one of the most fundamental metaphor in modern computing,Cache replacement policies play a crucial part in different aspects of today＇s high performance computing environments.h studies some of the page replacement algorithms,including the recency based algorithms,the frequency based algorithms and the adaptive algorithms.The LRFU algorithms isn＇t a self-tuning algorithm,although it combines the recency and frequency.This paper proposes an improved LRFU algorithm,that can adaptively and dynamically modify the λ value of LRFU.Conducting simulations with a variety of file access patterns and a wide range of buffer size,it shows that the improved LRFU algorithm outperforms a LRFU algorithm in many cases.

关 键 词：数据库缓冲区 页面置换算法 LRFU 动态调整 改进的LRFU算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]