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:
Jan. 14, 2020

Filed:

Nov. 28, 2016
Applicant:

File System Labs Llc, Northbrook, IL (US);

Inventors:

Elan Pavlov, Cambridge, MA (US);

Stephen Ness, San Francisco, CA (US);

Roger Critchlow, Santa Fe, NM (US);

Robert Swartz, Highland Park, IL (US);

Timothy S. Murphy, Milwaukee, WI (US);

Ronald Lachman, Northbrook, IL (US);

Assignee:

File System Labs LLC, Northbrook, IL (US);

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H03M 13/05 (2006.01); G06F 16/13 (2019.01); G06F 16/182 (2019.01); G06F 11/10 (2006.01); G06F 3/06 (2006.01); H03M 13/00 (2006.01); H03M 13/53 (2006.01); G06F 11/20 (2006.01);
U.S. Cl.
CPC ...
H03M 13/05 (2013.01); G06F 3/064 (2013.01); G06F 3/0619 (2013.01); G06F 3/0647 (2013.01); G06F 3/0689 (2013.01); G06F 11/1076 (2013.01); G06F 16/134 (2019.01); G06F 16/137 (2019.01); G06F 16/182 (2019.01); G06F 16/1827 (2019.01); H03M 13/611 (2013.01); G06F 11/2094 (2013.01); G06F 2211/1028 (2013.01);
Abstract

A distributed data storage system breaks data into n slices and k checksums using at least one matrix-based erasure code based on matrices with invertible submatrices, stores the slices and checksums on a plurality of storage elements, retrieves the slices from the storage elements, and, when slices have been lost or corrupted, retrieves the checksums from the storage elements and restores the data using the at least one matrix-based erasure code and the checksums. In a method for ensuring restoration and integrity of data in computer-related applications, data is broken into n pieces, k checksums are calculated using at least one matrix-based erasure code based on matrices with invertible submatrices, and the n data pieces and k checksums are stored on n+k storage elements or transmitted over a network. If, upon retrieving the n pieces from the storage elements or network, pieces have been lost or corrupted, the checksums are retrieved and the data is restored using the matrix-based erasure code and the checksums.


Find Patent Forward Citations

Loading…