An LIRS-Based Replica Replacement Strategy for Data-Intensive Applications

Wei Liu, Feiyan Shi, Wei Du
{"title":"An LIRS-Based Replica Replacement Strategy for Data-Intensive Applications","authors":"Wei Liu, Feiyan Shi, Wei Du","doi":"10.1109/TrustCom.2011.188","DOIUrl":null,"url":null,"abstract":"Data Replication, creating identical copies of data on different sites geographically, is one of the effective optimization techniques for reducing data access costs and improving load balance among sites in data-intensive computing. However, due to the limitation of storage capacity of each site, an efficient replica replacement can make a significant difference in the performance and efficiency of replication technologies. In this paper, for the inability of LRU to cope with access patterns with weak locality, a novel replacement strategy called Low Inter-reference Recency Set (LIRS) was applied into replica replacement during data replication. And then, OptorSim was extended, and LIRS replica replacement algorithm was implemented. Finally, LIRS replacement strategy was comprehensively compared with other algorithms including LRU, MRU LFU and MFU by use of different scheduling algorithms and file access patterns, and the results show that LIRS replacement algorithm can improve the performance of the data access, especially under access pattern with weak locality.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TrustCom.2011.188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Data Replication, creating identical copies of data on different sites geographically, is one of the effective optimization techniques for reducing data access costs and improving load balance among sites in data-intensive computing. However, due to the limitation of storage capacity of each site, an efficient replica replacement can make a significant difference in the performance and efficiency of replication technologies. In this paper, for the inability of LRU to cope with access patterns with weak locality, a novel replacement strategy called Low Inter-reference Recency Set (LIRS) was applied into replica replacement during data replication. And then, OptorSim was extended, and LIRS replica replacement algorithm was implemented. Finally, LIRS replacement strategy was comprehensively compared with other algorithms including LRU, MRU LFU and MFU by use of different scheduling algorithms and file access patterns, and the results show that LIRS replacement algorithm can improve the performance of the data access, especially under access pattern with weak locality.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
数据密集型应用中基于lirs的副本替换策略
数据复制(Data Replication)在地理位置上的不同站点上创建相同的数据副本,是数据密集型计算中用于降低数据访问成本和改善站点之间负载平衡的有效优化技术之一。但是,由于每个站点存储容量的限制,高效的副本替换可以显著提高复制技术的性能和效率。本文针对LRU无法应对弱局域性访问模式的问题,提出了一种新的替换策略——低引用间最近集(LIRS),用于数据复制过程中的副本替换。然后对OptorSim进行扩展,实现了LIRS副本替换算法。最后,通过使用不同的调度算法和文件访问模式,将LIRS替换策略与LRU、MRU、LFU和MFU等其他算法进行了综合比较,结果表明,LIRS替换算法可以提高数据访问性能,特别是在弱局域性访问模式下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Access Control in Distributed Systems: Merging Theory with Practice Modeling Trees with Rugged Surfaces Nose Surgery Simulation Based on Volumetric Laplacian Deformation FTGS: Fault-Tolerant Fixed-Priority Scheduling on Multiprocessors Multiparty Quantum Group Signature Scheme with Quantum Parallel Computation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1