对象存储系统动态复制管理

Q. Wei, B. Veeravalli, Zhixiang Li
{"title":"对象存储系统动态复制管理","authors":"Q. Wei, B. Veeravalli, Zhixiang Li","doi":"10.1109/NAS.2010.24","DOIUrl":null,"url":null,"abstract":"Data replication has been widely used as a mean of increasing the data availability of large-scale storage systems where failures are normal. Aiming to provide cost-effective availability, and improve performance and load-balancing of large-scale storage cluster, this paper presents a dynamic replication management scheme referred to as DRM. A model is developed to express availability as function of replica number. Based on this model, minimal replica number to satisfy availability requirement can be determined. DRM further places these replicas among Object-Based Storage Devices (OSD) in a balance way, taking into account different capacity and blocking probability of each OSD in heterogeneous environment. Proposed DRM can dynamically redistribute workloads among OSD cluster by adjusting replica number and location according to workload changing and OSD capacity. Our experiment results conclusively demonstrate that DRM is reliable and can achieve a significant average response time, and load balancing for large-scale OSD cluster.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Dynamic Replication Management for Object-Based Storage System\",\"authors\":\"Q. Wei, B. Veeravalli, Zhixiang Li\",\"doi\":\"10.1109/NAS.2010.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data replication has been widely used as a mean of increasing the data availability of large-scale storage systems where failures are normal. Aiming to provide cost-effective availability, and improve performance and load-balancing of large-scale storage cluster, this paper presents a dynamic replication management scheme referred to as DRM. A model is developed to express availability as function of replica number. Based on this model, minimal replica number to satisfy availability requirement can be determined. DRM further places these replicas among Object-Based Storage Devices (OSD) in a balance way, taking into account different capacity and blocking probability of each OSD in heterogeneous environment. Proposed DRM can dynamically redistribute workloads among OSD cluster by adjusting replica number and location according to workload changing and OSD capacity. Our experiment results conclusively demonstrate that DRM is reliable and can achieve a significant average response time, and load balancing for large-scale OSD cluster.\",\"PeriodicalId\":284549,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2010.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2010.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

数据复制已被广泛用于提高大型存储系统的数据可用性,在这些系统中故障是很常见的。为了提供高性价比的可用性,提高大规模存储集群的性能和负载均衡,本文提出了一种动态复制管理方案(DRM)。建立了可用性作为副本数函数的模型。基于该模型,可以确定满足可用性要求的最小副本数。DRM进一步考虑到异构环境中每个OSD的容量和阻塞概率的不同,以均衡的方式将这些副本放置在各个OSD之间。DRM可以根据工作负载的变化和OSD的容量调整副本的数量和位置,在OSD集群之间动态地重新分配工作负载。实验结果表明,对于大规模OSD集群,DRM是可靠的,可以实现显著的平均响应时间和负载均衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dynamic Replication Management for Object-Based Storage System
Data replication has been widely used as a mean of increasing the data availability of large-scale storage systems where failures are normal. Aiming to provide cost-effective availability, and improve performance and load-balancing of large-scale storage cluster, this paper presents a dynamic replication management scheme referred to as DRM. A model is developed to express availability as function of replica number. Based on this model, minimal replica number to satisfy availability requirement can be determined. DRM further places these replicas among Object-Based Storage Devices (OSD) in a balance way, taking into account different capacity and blocking probability of each OSD in heterogeneous environment. Proposed DRM can dynamically redistribute workloads among OSD cluster by adjusting replica number and location according to workload changing and OSD capacity. Our experiment results conclusively demonstrate that DRM is reliable and can achieve a significant average response time, and load balancing for large-scale OSD cluster.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Heterogeneous Multi-core Parallel SGEMM Performance Testing and Analysis on Cell/B.E Processor Stabilizing Path Modification of Power-Aware On/Off Interconnection Networks Modelling Speculative Prefetching for Hybrid Storage Systems Binomial Probability Redundancy Strategy for Multimedia Transmission Fast and Memory-Efficient Traffic Classification with Deep Packet Inspection in CMP Architecture
×
引用
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