@inproceedings{khan2012rethinking,
author = {Khan, Osama and Burns, Randal and Plank, James and Pierce, William and Huang, Cheng},
title = {Rethinking Erasure Codes for Cloud File Systems: Minimizing I/O for Recovery and Degraded Reads},
booktitle = {FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies},
year = {2012},
month = {February},
abstract = {To reduce storage overhead, cloud file systems are transitioning from replication to erasure codes. This process has revealed new dimensions on which to evaluate the performance of different coding schemes: the amount of data used in recovery and when performing degraded reads. We present an algorithm that finds the optimal number of codeword symbols needed for recovery for any XOR-based erasure code and produces recovery schedules that use a minimum amount of data. We differentiate popular erasure codes based on this criterion and demonstrate that the differences improve I/O performance in practice for the large block sizes used in cloud file systems. Several cloud systems [15, 10] have adopted Reed-Solomon (RS) codes, because of their generality and their ability to tolerate larger numbers of failures. We define a new class of rotated Reed-Solomon codes that perform degraded reads more efficiently than all known codes, but otherwise inherit the reliability and performance properties of Reed-Solomon codes.},
publisher = {USENIX Association Berkeley, CA, USA},
url = {http://approjects.co.za/?big=en-us/research/publication/rethinking-erasure-codes-cloud-file-systems-minimizing-io-recovery-degraded-reads/},
pages = {20-20},
edition = {FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies},
}