WPS:一种工作负载感知的擦除编码内存存储放置方案

Shuang Wang, Jianzhong Huang, X. Qin, Q. Cao, C. Xie
{"title":"WPS:一种工作负载感知的擦除编码内存存储放置方案","authors":"Shuang Wang, Jianzhong Huang, X. Qin, Q. Cao, C. Xie","doi":"10.1109/NAS.2017.8026881","DOIUrl":null,"url":null,"abstract":"Data-intensive applications are increasingly depending on in-memory stores to meet high-I/O- performance requirements. To be resilient to server failures and in turn achieve high availability, both replication and erasure codes are introduced to in- memory stores. Since erasure codes have an advantage of memory efficiency over replication, we focus our work on erasure-coded in-memory stores and investigate placement schemes to address the issue of workload fluctuation. To mitigate the I/O imbalanced incurred by workload skew and maximize the utilization of all nodes, we proposed a \\ul{W}orkload-aware \\ul{P}lacement \\ul{S}cheme called WPS for Reed-Solomon-coded in- memory stores. WPS accomplishes balanced I/Os as follows: it divides in-memory data blocks into multiple groups based on access characteristics (e.g., popularity), and classifies all nodes into several groups according to nodes' access performance (e.g., indicated by available bandwidth), and places or migrates high-access- popularity in-memory data blocks to high-performance nodes without violating the essential principle of fault tolerance. The comparative experiments indicate that WPS can significantly improve load balancing for RS-coded in-memory stores exhibiting workload popularity skew; meanwhile, WPS achieves comparable mean, median, and tail latencies relative to two candidate placement schemes.","PeriodicalId":222161,"journal":{"name":"2017 International Conference on Networking, Architecture, and Storage (NAS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"WPS: A Workload-Aware Placement Scheme for Erasure-Coded In-Memory Stores\",\"authors\":\"Shuang Wang, Jianzhong Huang, X. Qin, Q. Cao, C. Xie\",\"doi\":\"10.1109/NAS.2017.8026881\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data-intensive applications are increasingly depending on in-memory stores to meet high-I/O- performance requirements. To be resilient to server failures and in turn achieve high availability, both replication and erasure codes are introduced to in- memory stores. Since erasure codes have an advantage of memory efficiency over replication, we focus our work on erasure-coded in-memory stores and investigate placement schemes to address the issue of workload fluctuation. To mitigate the I/O imbalanced incurred by workload skew and maximize the utilization of all nodes, we proposed a \\\\ul{W}orkload-aware \\\\ul{P}lacement \\\\ul{S}cheme called WPS for Reed-Solomon-coded in- memory stores. WPS accomplishes balanced I/Os as follows: it divides in-memory data blocks into multiple groups based on access characteristics (e.g., popularity), and classifies all nodes into several groups according to nodes' access performance (e.g., indicated by available bandwidth), and places or migrates high-access- popularity in-memory data blocks to high-performance nodes without violating the essential principle of fault tolerance. The comparative experiments indicate that WPS can significantly improve load balancing for RS-coded in-memory stores exhibiting workload popularity skew; meanwhile, WPS achieves comparable mean, median, and tail latencies relative to two candidate placement schemes.\",\"PeriodicalId\":222161,\"journal\":{\"name\":\"2017 International Conference on Networking, Architecture, and Storage (NAS)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Networking, Architecture, and Storage (NAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2017.8026881\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Networking, Architecture, and Storage (NAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2017.8026881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

数据密集型应用程序越来越依赖于内存存储来满足高i /O性能要求。为了适应服务器故障并实现高可用性,在内存存储中引入了复制和擦除代码。由于擦除码在内存效率方面优于复制,因此我们将工作重点放在擦除编码的内存存储上,并研究放置方案以解决工作负载波动问题。为了减轻由工作负载倾斜引起的I/O不平衡,并最大限度地提高所有节点的利用率,我们提出了一种用于reed - solomon编码的内存存储的\ul{P}放置\ul{S}方案。WPS实现均衡I/ o的方式是:根据访问特性(如热度)将内存数据块划分为多个组,根据节点的访问性能(如可用带宽)将所有节点划分为多个组,在不违背容错基本原则的情况下,将高访问热度的内存数据块放置或迁移到高性能节点。对比实验表明,WPS可以显著改善存在工作负载流行度倾斜的rs编码内存存储的负载平衡;同时,相对于两种候选放置方案,WPS实现了可比较的平均、中位数和尾部延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
WPS: A Workload-Aware Placement Scheme for Erasure-Coded In-Memory Stores
Data-intensive applications are increasingly depending on in-memory stores to meet high-I/O- performance requirements. To be resilient to server failures and in turn achieve high availability, both replication and erasure codes are introduced to in- memory stores. Since erasure codes have an advantage of memory efficiency over replication, we focus our work on erasure-coded in-memory stores and investigate placement schemes to address the issue of workload fluctuation. To mitigate the I/O imbalanced incurred by workload skew and maximize the utilization of all nodes, we proposed a \ul{W}orkload-aware \ul{P}lacement \ul{S}cheme called WPS for Reed-Solomon-coded in- memory stores. WPS accomplishes balanced I/Os as follows: it divides in-memory data blocks into multiple groups based on access characteristics (e.g., popularity), and classifies all nodes into several groups according to nodes' access performance (e.g., indicated by available bandwidth), and places or migrates high-access- popularity in-memory data blocks to high-performance nodes without violating the essential principle of fault tolerance. The comparative experiments indicate that WPS can significantly improve load balancing for RS-coded in-memory stores exhibiting workload popularity skew; meanwhile, WPS achieves comparable mean, median, and tail latencies relative to two candidate placement schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信