|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Reliability Analysis for Full-2 Code
Kaohsiung, Taiwan
December 14-December 16
ISBN: 978-0-7695-3908-9
| ASCII Text | x | ||
| Sheng Lin, Chi Zhang, Gang Wang, Xiaoguang Liu, Jing Liu, "Reliability Analysis for Full-2 Code," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 454-459, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/I-SPAN.2009.95, author = {Sheng Lin and Chi Zhang and Gang Wang and Xiaoguang Liu and Jing Liu}, title = {Reliability Analysis for Full-2 Code}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2009}, isbn = {978-0-7695-3908-9}, pages = {454-459}, doi = {http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2009.95}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Reliability Analysis for Full-2 Code SN - 978-0-7695-3908-9 SP454 EP459 A1 - Sheng Lin, A1 - Chi Zhang, A1 - Gang Wang, A1 - Xiaoguang Liu, A1 - Jing Liu, PY - 2009 KW - erasure code KW - full-2 code KW - reliability KW - markov model KW - graph representation VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER - | |||
Recently, with the fast development of storage system, 2-erasure coding schemes were widely used in industrial society. To meet different requirements, many kinds of 2-erasure coding schemes were presented, such as Reed-Solomon codes, binary linear codes, parity array codes, and so on. Full-2 code is a 2-erasure binary linear code. It is a non-MDS code, but achieves optimal encoding, decoding, and updating performance. Moreover, its fault tolerance is beyond 2, i.e. “2-erasure” is the huge undervaluation of its fault tolerance. It is hard to evaluate the precise reliability of full-2 code. The reason is that the reliability model is complex and the proportion of recoverable k-erasures (k > 2) to total k-erasures is difficult to calculate. In this paper, we present a combinatorial method to analyze the precise reliability of full-2 code. The reliability of full-2 based storage systems is also evaluated.
Index Terms:
erasure code, full-2 code, reliability, markov model, graph representation
Citation:
Sheng Lin, Chi Zhang, Gang Wang, Xiaoguang Liu, Jing Liu, "Reliability Analysis for Full-2 Code," ispan, pp.454-459, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009
Usage of this product signifies your acceptance of the Terms of Use.