The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Apr. 08, 2014

Filed:

Mar. 15, 2012
Applicants:

Itzhak Tamo, Pasadena, CA (US);

Zhiying Wang, Pasadena, CA (US);

Jehoshua Bruck, La Canada, CA (US);

Inventors:

Itzhak Tamo, Pasadena, CA (US);

Zhiying Wang, Pasadena, CA (US);

Jehoshua Bruck, La Canada, CA (US);

Assignee:
Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G11C 29/00 (2006.01);
U.S. Cl.
CPC ...
Abstract

MDS (maximum distance separable) array codes are widely used in storage systems to protect data against erasures. The rebuilding ratio problem is addressed and efficient parity codes are proposed. A controller as disclosed is configured for receiving configuration data at the controller that indicates operating features of the array and determining a parity code for operation of the array according to a permutation, wherein the configuration data specifies the array as comprising nodes defined by A=(a) with size r×k for some integers k,m, and wherein for T={v, . . . , V}Za subset of vectors of size k, where for each v=(v, . . . , v)∈T, gcd (v, . . . , v, r), where gcd is the greatest common divisor, such that for any l, 0≦l≦r−1, and v ∈T, the code values are determined by the permutation f:[0,r−1]→[0,r−1]by f(x)=x+lv.


Find Patent Forward Citations

Loading…