一种集群文件系统二级缓存协同置换算法  

A Cooperative Replacement Algorithm for the L2 Cache of Cluster File Systems

作　　者：韩宗芬[1] 林运章[1] 金海[1] 岳建辉[1] 徐婕[1] 

机构地区：[1]华中科技大学计算机学院,湖北武汉430074

出　　处：《计算机工程与科学》2004年第9期54-56,共3页Computer Engineering & Science

基　　金：国家 8 63计划资助项目 ( 2 0 0 2AA1Z2 10 2 )

摘　　要：集群文件系统二级缓存置换算法中 ,某一存储节点的二级缓存单点不命中会破坏集群文件系统的并行性 ,从而降低其他存储节点二级缓存的效率 ,进而降低系统缓存的整体命中率。本文提出了存储节点间协同置换的概念 ,并设计了置换算法CMQ。仿真结果表明 ,与LRU、LFU和MQ等传统置换算法相比 ,CMQ算法命中率有了显著提高。With the traditional replacement algorithms for the L2 cache of cluster file systems,a single storage node's cache missing would break down the system parallelism, and degrade the efficiency of other storage nodes' caches,and thus decrease the overall hit ratio of the system's caches. This paper proposes the concept of cooperative replacment among multiple storage nodes, and presents an algorithm named CMQ. Simulation results indicate that the hit ratio of CMQ is increased remarkably, compared to other algorithms such as LRU, LFU and MQ.

关 键 词：集群文件系统 二级缓存 协同置换 CMQ 

分 类 号：TP338.8[自动化与计算机技术—计算机系统结构]