A Server Cache Size Aware Cache Replacement Algorithm for Block Level Network Storage

Yusuke Nagasako, Saneyasu Yamaguchi
{"title":"A Server Cache Size Aware Cache Replacement Algorithm for Block Level Network Storage","authors":"Yusuke Nagasako, Saneyasu Yamaguchi","doi":"10.1109/ISADS.2011.80","DOIUrl":null,"url":null,"abstract":"Storage management cost is one of the most important issues in the current computer system. Network storage is deployed in many companies to decrease this cost. In the network storage system, both the server computer and network storage have cache memory for the same storage. In most cache implementation, LRU replacement algorithm, which is suitable for accesses with temporal locality of reference, is adopted. However, accesses to network storage do not have usual temporal locality but have negative temporal locality. Consequently, caches in network storages do not work effectively. In this paper, we propose a new cache replacement algorithm, which is suitable for negative temporal locality of reference. Our simulation evaluation demonstrated that the proposed algorithm provides better cache hit ratio than other existing algorithms.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Tenth International Symposium on Autonomous Decentralized Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2011.80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Storage management cost is one of the most important issues in the current computer system. Network storage is deployed in many companies to decrease this cost. In the network storage system, both the server computer and network storage have cache memory for the same storage. In most cache implementation, LRU replacement algorithm, which is suitable for accesses with temporal locality of reference, is adopted. However, accesses to network storage do not have usual temporal locality but have negative temporal locality. Consequently, caches in network storages do not work effectively. In this paper, we propose a new cache replacement algorithm, which is suitable for negative temporal locality of reference. Our simulation evaluation demonstrated that the proposed algorithm provides better cache hit ratio than other existing algorithms.
面向块级网络存储的服务器缓存大小感知缓存替换算法
存储管理成本是当前计算机系统中的一个重要问题。许多公司都部署了网络存储以降低这一成本。在网络存储系统中,服务器计算机和网络存储器对于同一存储器都具有缓存存储器。在大多数缓存实现中,都采用LRU替换算法,该算法适用于具有时间局部性的访问。然而,对网络存储的访问不具有通常的时间局部性,而是具有负时间局部性。因此,网络存储中的缓存不能有效地工作。在本文中,我们提出了一种新的缓存替换算法,该算法适用于参考的负时间局部性。我们的仿真评估表明,该算法提供了比其他现有算法更好的缓存命中率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信