Name
Abstract | ||
|---|---|---|
To overcome the drawbacks in the P2P storage clouds previously proposed, this paper designs a new P2P storage cloud, in which the erasure coding is performed on the dedicated computing nodes, rather than storage nodes. Through experiments, we find that the coding performance of the existing CRS codes has become the bottleneck of the new P2P storage cloud. Thus, we preliminarily optimize the CRS code, and confirm that the hard drive I/O performance in the computing node has caused the bottleneck in CRS coding. Therefore, we propose two buffer-based I/O minimization CRS codes and conduct a performance evaluation. The experimental results show that, on average, the preliminarily optimized CRS codes improve by 43.13%, and the coding performance of the two buffer-based I/O minimization CRS codes reach 202.282 and 275.297 MB/s, respectively, thereby meeting the performance requirements of erasure coding in the P2P storage cloud. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31869-6_33 | WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2012 |
Keywords | Field | DocType |
erasure code, cloud storage, P2P, optimizing | Bottleneck,Computer science,Parallel computing,Cauchy distribution,Reed–Solomon error correction,Coding (social sciences),Minification,Erasure code,Cloud storage,Distributed computing,Cloud computing | Conference |
Volume | Issue | ISSN |
7405 | null | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhefeng Xiao | 1 | 1 | 1.11 |
| Zunguo Huang | 2 | 14 | 4.52 |
| Yujun Liu | 3 | 0 | 0.34 |