基于伸展树的文件数据缓存管理策略研究  

Research of Cache Management Strategy Based on Splay Tree

作　　者：姚智海 徐宏喆[1] 李文[1] 吴夏[1] 

机构地区：[1]西安交通大学陕西省计算机网络重点实验室,西安710049

出　　处：《计算机科学》2016年第9期131-134,共4页Computer Science

摘　　要：针对企业内部网络存储,研究并提出了一种基于伸展树的缓存管理策略,以对网络缓存空间进行组织和管理。在内部网络存储缓存链的基础上,引入并改进了伸展树结构和操作,将改进后的伸展树作为缓存节点数据组织和管理的索引结构,分析并设计了基于伸展树的文件数据缓存管理策略。实验结果表明,基于伸展树算法的缓存管理策略提高了缓存空间利用率和用户访问数据的效率,有较好的实时性。Taking the enterprise＇s internal network storage application as background, we put forward a cache manage- ment strategy based on splay tree to organize buffer memory space. We improved the structure and operation of splay tree and took it as the index structure for organizing and managing cached data. Finally, according to the actual applica- tion requirements, we analyzed and designed the model of cache management and made it come true. The experimental results show that, through combining with the improved splay tree algorithm, the buffer memory space and cached data can be effectively organized and managed, therefore, the cache management strategy proposed in this paper has good real time property and the efficiency of accessing data can also be improved.

关 键 词：伸展树 缓存链 替换价值度 缓存管理 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]