题目：面向大条带的纠删码设计与实现

主讲人：胡燏翀

时间：2021年03月18日10:00-11:30

地址：腾讯会议 ID 805 646 277

摘要：Erasure coding is a low-cost redundancy mechanism for distributed storage systems by storing stripes of data and parity chunks. Wide stripes are recently proposed to suppress the fraction of parity chunks in a stripe to achieve extreme storage savings. However, wide stripes aggravate the repair penalty, while existing repair-efficient approaches for erasure coding cannot effectively address wide stripes. We propose combined locality, the first mechanism that systematically addresses the wide-stripe repair problem via the combination of both parity locality and topology locality. We further augment combined locality with efficient encoding and update schemes. Experiments on Amazon EC2 show that combined locality reduces the single-chunk repair time by up to 90.5% compared to locality-based state-of-the-arts, with only a redundancy of 1:063.

主讲人简介：胡燏翀，华中科技大学计算机学院副教授，博导，经理助理。主要研究方向：面向极致成本的高可靠存储系统的设计与实现，包括云存储、大数据存储等。他以第一作者/通讯作者在存储顶级会议(FAST,两次)和计算机权威期刊(TPDS,TOS)，云计算顶级会议SoCC，以及网络领域权威期刊（JSAC,TON,TIT）和会议(Infocom)发表过10余篇文章，以及在专业期刊和会议发表近40篇学术论文，包括TC，ATC，DSN，ICCD，SRDS，MSST，ICPP等。

邀请人：胡思煌