本文選題：分布式存儲可靠性 + 再生碼　； 參考：《計(jì)算機(jī)應(yīng)用》2017年07期

【摘要】：針對已有的再生碼編碼方案的運(yùn)算是基于有限域GF(q)、運(yùn)算復(fù)雜度高、效率低的問題,提出了一種將GF(2)上的稀疏隨機(jī)矩陣和乘積矩陣框架相結(jié)合的再生碼構(gòu)造方法。首先,將文件數(shù)據(jù)矩陣式排布后根據(jù)編碼矩陣進(jìn)行行異或運(yùn)算;其次,節(jié)點(diǎn)失效后,參與幫助節(jié)點(diǎn)根據(jù)失效節(jié)點(diǎn)的編碼向量編碼本地?cái)?shù)據(jù)并發(fā)送至修復(fù)節(jié)點(diǎn);最后,修復(fù)節(jié)點(diǎn)根據(jù)接收到的數(shù)據(jù)譯碼出失效節(jié)點(diǎn)原有的數(shù)據(jù)。實(shí)驗(yàn)結(jié)果表明修復(fù)帶寬至多只有傳統(tǒng)糾刪碼修復(fù)方案的1/10,相比基于傳統(tǒng)范德蒙編碼矩陣的再生碼,編碼速率提升了70%,譯碼恢復(fù)速率提升了50%,方便了再生碼在大規(guī)模存儲系統(tǒng)中的應(yīng)用。
[Abstract]:In order to solve the problem that the operation of existing regenerative code coding scheme is based on the finite field GFFQ, which has high computational complexity and low efficiency, a method of constructing reproducing codes by combining the framework of sparse random matrix and product matrix on GF2) is proposed. First, the file data matrix is arranged according to the encoding matrix to perform the XOR operation. Secondly, after the node fails, it helps the node encode local data according to the coding vector of the failed node and send it to the repaired node. The repair node decodes the original data of the invalid node according to the received data. The experimental results show that the restoration bandwidth is only 1 / 10 of that of the traditional erasure code repair scheme, compared with the traditional Van der Mon coding matrix. The coding rate is increased by 70 bit and the decoding recovery rate is increased by 50%, which facilitates the application of the regenerative code in the large-scale storage system.
【作者單位】： 中國科學(xué)院成都計(jì)算機(jī)應(yīng)用研究所;中國科學(xué)院大學(xué)計(jì)算機(jī)與控制學(xué)院;
【基金】：四川省科技廳支撐計(jì)劃項(xiàng)目(2015GZ0088)~~
【分類號】：TP333

【參考文獻(xiàn)】

相關(guān)期刊論文 前2條

1 郝杰;逯彥博;劉鑫吉;夏樹濤;;分布式存儲中的再生碼綜述[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年01期

2 羅象宏;舒繼武;;存儲系統(tǒng)中的糾刪碼研究綜述[J];計(jì)算機(jī)研究與發(fā)展;2012年01期

【共引文獻(xiàn)】

相關(guān)期刊論文 前10條

1 鄭力明;李曉冬;;面向糾刪碼的低成本多節(jié)點(diǎn)失效修復(fù)方法[J];計(jì)算機(jī)工程;2017年07期

2 徐志強(qiáng);袁德砦;陳亮;;基于稀疏隨機(jī)矩陣的再生碼構(gòu)造方法[J];計(jì)算機(jī)應(yīng)用;2017年07期

3 吳煬;付印金;陳衛(wèi)衛(wèi);倪桂強(qiáng);;一種高效的混合內(nèi)存布局機(jī)制與編碼技術(shù)[J];計(jì)算機(jī)科學(xué);2017年06期

4 吳昊;賴成U，

本文編號：1853410