计算机科学 ›› 2016, Vol. 43 ›› Issue (9): 131-134.doi: 10.11896/j.issn.1002-137X.2016.09.025

• 网络与通信 • 上一篇    下一篇

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

姚智海,徐宏喆,李文,吴夏   

  1. 西安交通大学陕西省计算机网络重点实验室 西安710049,西安交通大学陕西省计算机网络重点实验室 西安710049,西安交通大学陕西省计算机网络重点实验室 西安710049,西安交通大学陕西省计算机网络重点实验室 西安710049
  • 出版日期:2018-12-01 发布日期:2018-12-01

Research of Cache Management Strategy Based on Splay Tree

YAO Zhi-hai, XU Hong-zhe, LI Wen and WU Xia   

  • Online:2018-12-01 Published:2018-12-01

摘要: 针对企业内部网络存储,研究并提出了一种基于伸展树的缓存管理策略,以对网络缓存空间进行组织和管理。在内部网络存储缓存链的基础上,引入并改进了伸展树结构和操作,将改进后的伸展树作为缓存节点数据组织和管理的索引结构,分析并设计了基于伸展树的文件数据缓存管理策略。实验结果表明,基于伸展树算法的缓存管理策略提高了缓存空间利用率和用户访问数据的效率,有较好的实时性。

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

Abstract: Taking the enterprise’s internal network storage application as background,we put forward a cache management 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 application 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.

Key words: Splay tree,Buffer chain,Replacement value,Cache management

[1] 韩德志,傅丰著.高可用存储网络——关键技术研究[M] .北京:科学出版社,2009:1-2,146
[2] Tewari R,Dahlin M,Vin H M,et al.Design Considerations for Distributed Caching on the Internet[C]∥Proc.of the 19th IEEE Distributed Computing Systems.Austin,TX,USA,1999
[3] Raunak M S.A survey of cooperative caching:Technical Report[R].1999
[4] Devi U C,Chetlur M,Kalyanaraman S.Object placement for cooperative caches with bandwidth constraints[C]∥ Jeannot E,Namyst R,Roman J,Eds.17th International Conference on Pa-rallel Processing.Euro-Par 2011,Part I,2011:579-593
[5] Wang K,Chen Z K,et al.Research on Storage Service-oriented Distributed Cache System[J].Computer Engineering ,2010,36(15):80-82(in Chinese) 王侃,陈志奎,等.面向存储服务的分布式缓存系统研究[J].计算机工程,2010,36(15):80-82
[6] Morales K,Lee B K.Fixed Segmented LRU cache replacement scheme with selective caching[C]∥2012 IEEE 31st InternationalPerformance Computing and Communications Conference (IPCCC).IEEE,2012:199-200
[7] Khulbe P,Pant S.Hybrid (LRU) Page-Replacement Algorithm[J].International Journal of Computer Applications,2014,91(16):25-28
[8] Zhu R,Xie J C,Xiao N,et al.Research on Autonomic Collaborative Caching in RAM Grids[J].Computer Engineering & Scien-ce, 2008,30(8):111-115 褚瑞,谢健聪,肖侬,等.内存网格中的自主协同缓存技术研究[J].计算机工程与科学,2008,30(8):111-115
[9] Pan P,Lu Y S.R-tree Updating Caching and Batch Processing Mechanism Based on Gird[J].Computer Engineering,2008,34(15):28-30(in Chinees) 潘鹏,卢炎生.基于栅格的R树更新缓存与批处理机制[J].计算机工程,2008,34(15):28-30
[10] Yang C H,Wang L S.Prefetching T-Tree:A Cache-optimized Main Memory Database Index Structure[J].Computer Sience,2011,38(10):161-165(in Chinese) 杨朝辉,王立松.pT-树:高速缓存优化的主存数据库索引结构[J].计算机科学,2011,38(10):161-165
[11] Sleator D D,Tarjan R E.Self-Adjusting Binary Search Trees[J].Journal of the Association for Computing Machinery,1985,32(3):652-686
[12] Huang M,Cai Z G.Survey of Cache Replacement Algorithm[J].Computer Sience,2006,23(12):191-193(in Chinese) 黄敏,蔡志刚.缓存替换算法研究综述[J].计算机科学,2006,23(12):191-193
[13] Jiang S,Zhang X.LIRS:An efficient low inter-reference recency set replacement policy to improve buffer cache performance[C]∥ACM SIGMETRICS Conf (SIGMETRICS’ 2002).Marina Del Rey,California,2002
[14] 姜宁康,时成阁.网络存储导论[M].北京:清华大学出版社,2007:5-6

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!