双粒度协议下基于hint的启发式缓存替换算法

王建勇; 祝明发; 徐志伟

引用本文:	王建勇,祝明发,徐志伟.双粒度协议下基于hint的启发式缓存替换算法.软件学报,1999,10(8):800-805

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 4019次下载 5572次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
双粒度协议下基于hint的启发式缓存替换算法
王建勇^1,2, 祝明发^3,2, 徐志伟^3,2
1.北京大学计算机科学与技术系,北京,100871;2.中国科学院计算技术研究所,北京,100080;3.国家智能计算机研究与开发中心,北京,100080

摘要:

合作式缓存技术是提高机群文件系统性能的关键技术之一.s2fs(scalable single-image file system)是一个单一映像机群文件系统原型,它利用双粒度协议实现了符合严格UNIX语义的合作式缓存.该文为s2fs设计了基于hint的启发式缓存替换算法,并为其建立了性能分析模型.分析结果表明,同现有的合作式缓存替换算法N-chance相比,启发式算法几乎在所有情况下都有效地降低了I/O的响应时间.

关键词: 启发式缓存替换算法,N-chance算法,双粒度协议,s2fs(scalable single-image file system),合作式缓存.

DOI：

分类号:

基金项目:本文研究得到国家自然科学基金和国家863高科技项目基金资助.

Hint-based Heuristic Cache Replacement Algorithm under Dual-granularity Protocol

WANG Jian-yong,ZHU Ming-fa,XU Zhi-wei

Abstract:

Cooperative caching is one of the key technologies used to improve the performance of a cluster file system. s2fs (scalable single-image file system), a single-image cluster file system prototype, uses dual-granularity cache coherence protocol in order to implement efficient cooperative caching which meets the needs for strict UNIX-semantics. In this paper, a hint-based heuristic cache replacement algorithm under s2fs' dual-granularity protocol is proposed, and the analytical models are established for heuristic algorithm and one of the existing coordinated algorithm——N-chance. The analytical results show that the heuristic algorithm can effectively reduce the I/O response time compared with N-chance algorithm almost in each case.

Key words: Heuristic cache replacement algorithm, N-chance algorithm, dual-granularity protocol, s2fs (scalable single-image file system), cooperative caching.