Failure Recovery Cost Reduction of Disk Arrays Using Adaptive Erasure Correction Coding and Data Compression

2015 ◽  
Author(s):  
Haruhiko Kaneko
Keyword(s):  
Data Compression ◽  
Cost Reduction ◽  
Failure Recovery ◽  
Disk Arrays ◽  
Recovery Cost ◽  
Erasure Correction

scholarly journals Referential DNA Data Compression using Hadoop Map Reduce Framework

2019 ◽  
Vol 17 (2) ◽  
pp. 207-214
Author(s):  
Raju Bhukya ◽  
Sumit Deshmuk
Keyword(s):  
Data Compression ◽  
Dna Sequences ◽  
High Performance ◽  
Deoxyribonucleic Acid ◽  
Genetic Data ◽  
Disk Arrays ◽  
Distributed Environment ◽  
Mapreduce Framework ◽  
Hadoop Mapreduce ◽  
Time Required

The indispensable knowledge of Deoxyribonucleic Acid (DNA) sequences and sharply reducing cost of the DNA sequencing techniques has attracted numerous researchers in the field of Genetics. These sequences are getting available at an exponential rate leading to the bulging size of molecular biology databases making large disk arrays and compute clusters inevitable for analysis.In this paper, we proposed referential DNA data compression using hadoop MapReduce Framework to process humongous amount of genetic data in distributed environment on high performance compute clusters. Our method has successfully achieved a better balance between compression ratio and the amount of time required for DNA data compression as compared to other Referential DNA Data Compression methods.

scholarly journals Implementation of Reed Solomon Code Over GF(9) and 9-Ary Symmetric Channel

2021 ◽  
Author(s):  
Elyes Balti
Keyword(s):  
Monte Carlo ◽  
Monte Carlo Simulations ◽  
Upper Bound ◽  
Data Centers ◽  
The Other ◽  
Disk Arrays ◽  
Primitive Polynomial ◽  
Symmetric Channel ◽  
Reed Solomon Code ◽  
Erasure Correction

Reed-Solomon and related codes have recently become very important for erasure correction in large disk arrays used in data centers. In this paper, we will implement a 3-error correcting Reed-Solomon encoder and decoder over the field GF(9) generated by the primitive polynomial D^2 + D + 2 over GF(3) and the decoding is carried out by the Berlekamp. We simulate the encoder and decoder using Monte-Carlo simulations over the 9-ary symmetric channel that outputs the correct symbol with probability (1-p), and outputs one of the other 8 possible incorrect symbols with probability p/8. Then, we compare the simulated probability of symbol error P(E) of out code with the union upper bound.

Architectures and algorithms for on-line failure recovery in redundant disk arrays

1994 ◽  
Vol 2 (3) ◽  
pp. 295-335 ◽  
Author(s):  
Mark Holland ◽  
Garth A. Gibson ◽  
Daniel P. Siewiorek
Keyword(s):  
Failure Recovery ◽  
Disk Arrays ◽  
On Line ◽  
Redundant Disk Arrays
Sign in / Sign up

Export Citation Format

Share Document