多个并发(本地)数据恢复的双代码界限
Dual-Code Bounds on Multiple Concurrent (Local) Data Recovery
摘要:
我们关注的是线性冗余存储方案,其能力提供并发(本地)恢复多个数据对象。本文在经典编码理论的基础上对这类系统进行了研究。我们展示了如何使用定义该计划的生成矩阵的结构特性来获得系统可以支持的数据访问速率集的边界多面体。我们得到了两个对偶距离外界,这是尖锐的一些大类矩阵族。
英文摘要:
We are concerned with linear redundancy storage schemes regarding their ability to provide concurrent (local) recovery of multiple data objects. This paper initiates a study of such systems within the classical coding theory. We show how we can use the structural properties of the generator matrix defining the scheme to obtain a bounding polytope for the set of data access rates the system can support. We derive two dual distance outer bounds, which are sharp for some large classes of matrix families.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。