本文選題：分布式存儲系統(tǒng) + 計算能力異構(gòu)�。� 參考：《計算機(jī)研究與發(fā)展》2015年S2期

【摘要】：隨著海量存儲數(shù)據(jù)的劇增,分布式存儲系統(tǒng)逐漸得到廣泛使用.分布式存儲系統(tǒng)中存儲節(jié)點數(shù)目的增加使得節(jié)點失效的機(jī)率增大.使用副本作為冗余的方式會帶來很大的存儲開銷.為了減少存儲開銷,使用糾刪碼產(chǎn)生冗余是存儲系統(tǒng)中一種主要的冗余策略.基于糾刪碼的數(shù)據(jù)修復(fù)過程中,需要在幸存節(jié)點中選擇供應(yīng)節(jié)點向新生節(jié)點傳送數(shù)據(jù),這就面臨著修復(fù)節(jié)點的選擇問題,需要設(shè)計一個節(jié)點選擇機(jī)制來使得修復(fù)過程較快,提升存儲系統(tǒng)的可靠性.結(jié)合實際數(shù)據(jù)修復(fù)過程中參與修復(fù)的節(jié)點對數(shù)據(jù)的計算速度不同,即存儲節(jié)點存在計算能力異構(gòu)的場景下,提出節(jié)點選擇機(jī)制:星形拓?fù)湫迯?fù)算法S-SPAC和樹形拓?fù)湫迯?fù)算法T-SPA-C,以加快失效節(jié)點的修復(fù)速度,從而減少整個修復(fù)過程中的修復(fù)時間.仿真結(jié)果表明,相對傳統(tǒng)的隨機(jī)節(jié)點選擇策略,本文提出的選擇機(jī)制可以有效減少數(shù)據(jù)修復(fù)時間.
[Abstract]:With the rapid increase of mass storage data, distributed storage system has been widely used. The increase of the number of storage nodes in distributed storage system increases the probability of node failure. Using replicas as redundant means can result in significant storage overhead. In order to reduce storage overhead, using erasure codes to generate redundancy is one of the main redundancy strategies in storage systems. In the process of data repair based on erasure code, it is necessary to select the supplier node among the surviving nodes to transfer data to the new node, which is faced with the problem of selecting the repair node, so we need to design a node selection mechanism to make the repair process faster. Improve the reliability of the storage system. Considering the different computing speed of the nodes involved in the restoration of the actual data, that is, the storage nodes have heterogeneous computing power in the scenario. The star topology repair algorithm (S-SPAC) and the tree topology repair algorithm (T-SPA-C-) are proposed to speed up the repair of the failed nodes and reduce the repair time in the whole repair process. Simulation results show that the proposed selection mechanism can effectively reduce the data repair time compared with the traditional random node selection strategy.
【作者單位】： 復(fù)旦大學(xué)計算機(jī)科學(xué)技術(shù)學(xué)院;網(wǎng)絡(luò)信息安全審計與監(jiān)控教育部工程研究中心;
【基金】：國家自然科學(xué)基金項目(61571136) 上海市“科技創(chuàng)新行動計劃”項目(14511101000) 上海浦江人才計劃項目(14PJ1401400)
【分類號】：TP333

【相似文獻(xiàn)】

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

1 何公明;張元濤;;面向數(shù)字媒體的高性能分布式存儲系統(tǒng)的研究與應(yīng)用[J];廣播電視信息;2009年10期

2 范劍波,郭建康;分布式存儲系統(tǒng)性能模型的建立與應(yīng)用[J];計算機(jī)工程與應(yīng)用;2001年13期

3 范劍波,徐利浩;分布式存儲系統(tǒng)可靠性的研究[J];計算機(jī)工程;2001年06期

4 吳英;謝廣軍;劉t，

本文編號：1945948