Computational storage, known as a solution to significantly reduce the latency by moving data-processing down to the data storage, has received wide attention because of its potential to accelerate data-driven devices at the edge. To meet the insatiable appetite for complicated functionalities tailored for intelligent devices such as autonomous vehicles, properties including heterogeneity, scalability, and flexibility are becoming increasingly important. Based on our prior work on hierarchical erasure coding that enables scalability and flexibility in cloud storage, we develop an efficient decoding algorithm that corrects a mixture of errors and erasures simultaneously. We first extract the basic component code, the so-called extended Cauchy (EC) codes, of the proposed coding solution. We prove that the class of EC codes is strictly larger than that of relevant codes with known explicit decoding algorithms. Motivated by this finding, we then develop an efficient decoding method for the general class of EC codes, based on which we propose the local and global decoding algorithms for the hierarchical codes. Our proposed hybrid error correction not only enables the usage of hierarchical codes in computational storage at the edge, but also applies to any Cauchy-like codes and allows potentially wider applications of the EC codes.
翻译:计算存储被称作通过将数据处理移到数据存储处以大幅降低延缓度的一种解决办法,由于它有可能加速边缘的数据驱动装置,因此受到广泛的关注。为了满足为智能装置定制的复杂功能的难以满足的胃口,例如自主车辆,包括异质性、可缩放性和灵活性等特性,正在变得越来越重要。根据我们先前关于允许云存储的可缩放性和灵活性的分级删除编码的工作,我们制定了高效的解码算法,同时纠正错失和消化的混合。我们首先提取了拟议编码的基本组成部分代码,即所谓的扩展的Cauchy(EC)代码。我们证明,EC代码的类别严格大于相关代码,而已知的解码算法也日益明显。受这一发现的影响,我们随后为一般类别的EC代码开发了一种有效的解码方法,据此我们提出了等级代码的本地和全球解码算法。我们提议的混合错误校正不仅能够使用更广义的计算代码,而且还允许使用更广义的EC至边缘的编码。