.png){kind=icon}
返回
An Efficient Binary Locally Repairable Code for Hadoop Distributed File System
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2014.2332491.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the Hadoop distributed file systems (HDFSs), to lower costly communication traffic for data recovery, the concept of locally repairable codes (LRCs) has been recently proposed. With regard to the immense size of modern energy-hungry HDFS, computational complexity reduction can be attractive. In this letter, to avoid finite field multiplications, which are the major source of complexity, we put forward the idea of designing binary locally repairable codes (BLRCs). More specifically, we design a BLRC with a length of 15, rate of 2/3, and minimum distance of 4, which has the minimum possible locality among its type. We show that our code has lower complexity than most recent non-binary LRC in the literature while meeting other desirable requirements in HDFS such as storage overhead and reliability.
Keyword:
Erasure coding
hadoop distributed file system
locally repairable codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
The effect of geometrical parameters on dimensional deviation in LPBF produced TPMS lattices: a numerical simulation based study几何参数对LPBF制造的TPMS晶格尺寸偏差的影响：一项基于数值模拟的研究
OAAI
OAAI分享收藏