修复内存中键值存储的友好宽条擦除编码

IF 3.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Xuzhe Liu, Yuchong Hu, Dan Feng, Leihua Qin, Hai Zhou, Xin Zhao, Renzhi Xiao
{"title":"修复内存中键值存储的友好宽条擦除编码","authors":"Xuzhe Liu,&nbsp;Yuchong Hu,&nbsp;Dan Feng,&nbsp;Leihua Qin,&nbsp;Hai Zhou,&nbsp;Xin Zhao,&nbsp;Renzhi Xiao","doi":"10.1016/j.sysarc.2025.103516","DOIUrl":null,"url":null,"abstract":"<div><div>Erasure coding is a low-cost redundancy mechanism over replication for in-memory key–value stores by storing stripes of data and parity chunks. <em>Wide stripes</em> are recently proposed to suppress the fraction of parity chunks in a stripe for extreme storage savings. However, wide stripes aggravate the repair penalty, and existing repair-efficient approaches for erasure coding fail to address this effectively.</div><div>We investigate two representative approaches, locally repairable codes (LRCs) and regenerating codes (RGCs), which reduce repair overhead in distributed storage. Building on this foundation, we propose two systematic solutions to address the repair penalty in wide-stripe erasure coding: (i) <em>Combine Locality (CL)</em>, a cross-rack data placement mechanism for Azure-LRC combining parity and topological locality, (ii) <em>Repair-Contribution-Based Placement (RCBP)</em>, a cross-rack data placement mechanism for Hitchhiker codes (a subclass of RGCs), strategically co-locating chunks with high repair contributions in the same rack. We apply CL-based LRC and RCBP-based Hitchhiker codes to in-memory key–value (KV) stores, augmenting them with efficient encoding and update schemes. Experiments on Amazon EC2 show that CL reduces the single-chunk repair time by up to 90.5% compared to locality-based state-of-the-art. RCBP improves repair throughput by up to 19.3% and 44.6% compared to original Hitchhiker and RS codes, respectively.</div></div>","PeriodicalId":50027,"journal":{"name":"Journal of Systems Architecture","volume":"167 ","pages":"Article 103516"},"PeriodicalIF":3.7000,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Repair friendly wide-stripe erasure coding for in-memory key–value stores\",\"authors\":\"Xuzhe Liu,&nbsp;Yuchong Hu,&nbsp;Dan Feng,&nbsp;Leihua Qin,&nbsp;Hai Zhou,&nbsp;Xin Zhao,&nbsp;Renzhi Xiao\",\"doi\":\"10.1016/j.sysarc.2025.103516\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Erasure coding is a low-cost redundancy mechanism over replication for in-memory key–value stores by storing stripes of data and parity chunks. <em>Wide stripes</em> are recently proposed to suppress the fraction of parity chunks in a stripe for extreme storage savings. However, wide stripes aggravate the repair penalty, and existing repair-efficient approaches for erasure coding fail to address this effectively.</div><div>We investigate two representative approaches, locally repairable codes (LRCs) and regenerating codes (RGCs), which reduce repair overhead in distributed storage. Building on this foundation, we propose two systematic solutions to address the repair penalty in wide-stripe erasure coding: (i) <em>Combine Locality (CL)</em>, a cross-rack data placement mechanism for Azure-LRC combining parity and topological locality, (ii) <em>Repair-Contribution-Based Placement (RCBP)</em>, a cross-rack data placement mechanism for Hitchhiker codes (a subclass of RGCs), strategically co-locating chunks with high repair contributions in the same rack. We apply CL-based LRC and RCBP-based Hitchhiker codes to in-memory key–value (KV) stores, augmenting them with efficient encoding and update schemes. Experiments on Amazon EC2 show that CL reduces the single-chunk repair time by up to 90.5% compared to locality-based state-of-the-art. RCBP improves repair throughput by up to 19.3% and 44.6% compared to original Hitchhiker and RS codes, respectively.</div></div>\",\"PeriodicalId\":50027,\"journal\":{\"name\":\"Journal of Systems Architecture\",\"volume\":\"167 \",\"pages\":\"Article 103516\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Systems Architecture\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1383762125001882\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Systems Architecture","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1383762125001882","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

Erasure编码是一种低成本的冗余机制,通过存储数据条纹和奇偶校验块来实现内存中键值存储的复制。宽条纹最近被提议用来抑制条带中奇偶校验块的比例,以极大地节省存储空间。然而,宽条纹加重了修复的损失,现有的修复效率的方法擦除编码不能有效地解决这个问题。我们研究了两种具有代表性的方法,局部可修复代码(lrc)和再生代码(rgc),它们减少了分布式存储中的修复开销。在此基础上,我们提出了两种系统的解决方案来解决宽条擦除编码中的修复损失:(i)组合局域性(CL),一种结合奇偶性和拓扑局域性的Azure-LRC跨机架数据放置机制;(ii)基于修复贡献的放置(RCBP),一种针对搭便车代码(rgc的一个子集)的跨机架数据放置机制,在同一机架中战略性地共同定位具有高修复贡献的块。我们将基于cl的LRC和基于rcbp的Hitchhiker代码应用于内存中的键值(KV)存储,并使用高效的编码和更新方案对其进行扩展。在Amazon EC2上的实验表明,与基于位置的技术相比,CL最多可将单块修复时间减少90.5%。与原始的Hitchhiker和RS代码相比,RCBP分别提高了19.3%和44.6%的维修吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Repair friendly wide-stripe erasure coding for in-memory key–value stores
Erasure coding is a low-cost redundancy mechanism over replication for in-memory key–value stores by storing stripes of data and parity chunks. Wide stripes are recently proposed to suppress the fraction of parity chunks in a stripe for extreme storage savings. However, wide stripes aggravate the repair penalty, and existing repair-efficient approaches for erasure coding fail to address this effectively.
We investigate two representative approaches, locally repairable codes (LRCs) and regenerating codes (RGCs), which reduce repair overhead in distributed storage. Building on this foundation, we propose two systematic solutions to address the repair penalty in wide-stripe erasure coding: (i) Combine Locality (CL), a cross-rack data placement mechanism for Azure-LRC combining parity and topological locality, (ii) Repair-Contribution-Based Placement (RCBP), a cross-rack data placement mechanism for Hitchhiker codes (a subclass of RGCs), strategically co-locating chunks with high repair contributions in the same rack. We apply CL-based LRC and RCBP-based Hitchhiker codes to in-memory key–value (KV) stores, augmenting them with efficient encoding and update schemes. Experiments on Amazon EC2 show that CL reduces the single-chunk repair time by up to 90.5% compared to locality-based state-of-the-art. RCBP improves repair throughput by up to 19.3% and 44.6% compared to original Hitchhiker and RS codes, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Systems Architecture
Journal of Systems Architecture 工程技术-计算机:硬件
CiteScore
8.70
自引率
15.60%
发文量
226
审稿时长
46 days
期刊介绍: The Journal of Systems Architecture: Embedded Software Design (JSA) is a journal covering all design and architectural aspects related to embedded systems and software. It ranges from the microarchitecture level via the system software level up to the application-specific architecture level. Aspects such as real-time systems, operating systems, FPGA programming, programming languages, communications (limited to analysis and the software stack), mobile systems, parallel and distributed architectures as well as additional subjects in the computer and system architecture area will fall within the scope of this journal. Technology will not be a main focus, but its use and relevance to particular designs will be. Case studies are welcome but must contribute more than just a design for a particular piece of software. Design automation of such systems including methodologies, techniques and tools for their design as well as novel designs of software components fall within the scope of this journal. Novel applications that use embedded systems are also central in this journal. While hardware is not a part of this journal hardware/software co-design methods that consider interplay between software and hardware components with and emphasis on software are also relevant here.
×
引用
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学术官方微信