Cassuto, Yuval and Bruck, Jehoshua (2009) Low-Complexity Codes for Random and Clustered High-Order Failures in Storage Arrays. California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:2009.ETR098
See Usage Policy.
PDF (Revised 10 February 2010)
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:2009.ETR098
RC (Random/Clustered) codes are a new efficient array-code family for recovering from 4-erasures. RC codes correct most 4-erasures, and essentially all 4-erasures that are clustered. Clustered erasures are introduced as a new erasure model for storage arrays. This model draws its motivation from correlated device failures, that are caused by physical proximity of devices, or by age proximity of endurance-limited solid-state drives. The reliability of storage arrays that employ RC codes is analyzed and compared to known codes. The new RC code is significantly more efficient, in all practical implementation factors, than the best known 4-erasure correcting MDS code. These factors include: small-write update-complexity, full-device update-complexity, decoding complexity and number of supported devices in the array.
|Item Type:||Report or Paper (Technical Report)|
|Additional Information:||This work was supported in part by the Caltech Lee Center for Advanced Networking.|
|Group:||Parallel and Distributed Systems Group|
|Subject Keywords:||Array codes, clustered erasures, correlated failures, storage arrays|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechPARADISE|
|Deposited On:||04 Dec 2009|
|Last Modified:||26 Dec 2012 13:54|
Repository Staff Only: item control page