Data Dispersal for Large Storage Systems

Ling Zhang; Shuai Shuai Zhu

doi:10.4028/www.scientific.net/AMM.644-650.2334

Paper Titles

The Research and Application of Web Data Mining Based on XML
p.2315

RETRACTED: Deconstructing Superblocks Using Niceness
p.2319

Review on Semantic Text Categorization
p.2323

An Effective Algorithm for Mining Forum Users Association Rules
p.2329

Data Dispersal for Large Storage Systems
p.2334

Research on the Model and Algorithm for the Vehicle Scheduling in Pooling Pallet Distribution
p.2338

RETRACTED: A Case for Model Checking
p.2342

RETRACTED: Deconstructing Redundancy Using PilousGnu
p.2346

The Study of Knowledge Pushing Technology Based on the Knowledge Context
p.2350

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 644-650Data Dispersal for Large Storage Systems

Data Dispersal for Large Storage Systems

Abstract:

Data dispersal mechanism is a group of basic working protocols for oceans of data processing and it plays an important role in enhancing system error correction and avoiding storage device failure. The data recovery availability of the client is the main design goal of data dispersal algorithms. The system storage and computing costs are also important factors for a data dispersal algorithm. In this paper, we discussed how to disperse data with the special properties as well as with acceptable system costs. We developed a universal approach to measure storage node availability based on state variables. After analyzed the existing data processing algorithms, we presented a new hybrid data dispersal algorithm using the above approach in detail evaluation. Two redundancy policies are adapted to storage node with different node availability. According to our analysis, this algorithm has its advantages in system storing and communication bandwidth costs.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 644-650)

Pages:

2334-2337

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.644-650.2334

Citation:

Cite this paper

Online since:

September 2014

Authors:

Ling Zhang*, Shuai Shuai Zhu

Keywords:

Data Process, Data Security, Error Correctness, Storage System

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Zhang Wei, MA Jian-feng. LPCA--data distribution algorithm in distributed storage [J]. Systems Engineering and Electronics, 2007, 29(3): 453-458.

Google Scholar

[2] http: /www. alphacom. co. uk/hitachi/thunder9500V. htm. 2011. 4.

Google Scholar

[3] Wang Pei, Han Yaowei, et al. Mechanism of software RAID Driver in Linux[J]. Mini-Micro System. 2001, 22(3): 305-308.

Google Scholar

[4] Kubiatowicz J, et al. OceanStore: architecture for global scale persistent storage[C]. In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000) November 2000: 90 - 201.

DOI: 10.1145/378993.379239

Google Scholar

[5] Blaum M, Brady J, Bruck J, et al. EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures [J]. IEEE, (1994).

DOI: 10.1109/isca.1994.288145

Google Scholar

[6] Xu L, Bruck J. Highly available distributed storage systems[C]. In Proceedings of Workshop on Distributed High Performance Computing, Lecture Notes in Control and Information Sciences, Springer Verlag, (1999).

DOI: 10.1007/bfb0110096

Google Scholar

[7] Joseph Cooley A, Jeremy Mineweaser L, Leslie Servi D, et al. Software-based erasure codes for scalable distributed storage[C]. In Proceedings of the 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03).

DOI: 10.1109/mass.2003.1194852

Google Scholar