Converting a data chunk into a ring algebraic structure for fast erasure coding
First Claim
Patent Images
1. A method comprising:
- at a storage manager of a storage system;
arranging a first data chunk into a ring structure;
tagging the first data chunk by appending extra data to the ring structure;
performing erasure coding on the first data chunk utilizing only exclusive or (XOR) operations and the ring structure, wherein erasure coded encoded data resulting from the erasure coding is written to a persistent storage device; and
maintaining an index pointer that references a portion of the ring structure;
wherein the ring structure allows for multiplication of data included in the first data chunk to be implemented by rotation of the data utilizing the index pointer, thereby increasing efficiency of the storage system as the multiplication is simplified to an adjustment of the index pointer.
1 Assignment
0 Petitions
Accused Products
Abstract
One embodiment provides a method comprising arranging a first data chunk into a ring structure, tagging the first data chunk by appending extra data to the first data chunk, and performing erasure coding on the first data chunk utilizing only exclusive or (XOR) operations.
-
Citations
20 Claims
-
1. A method comprising:
at a storage manager of a storage system; arranging a first data chunk into a ring structure; tagging the first data chunk by appending extra data to the ring structure; performing erasure coding on the first data chunk utilizing only exclusive or (XOR) operations and the ring structure, wherein erasure coded encoded data resulting from the erasure coding is written to a persistent storage device; and maintaining an index pointer that references a portion of the ring structure; wherein the ring structure allows for multiplication of data included in the first data chunk to be implemented by rotation of the data utilizing the index pointer, thereby increasing efficiency of the storage system as the multiplication is simplified to an adjustment of the index pointer. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
11. A storage system comprising:
-
at least one processor; and a non-transitory processor-readable memory device storing instructions that when executed by the at least one processor causes the at least one processor to perform operations including; at a storage manager of the storage system; arranging a first data chunk into a ring structure; tagging the first data chunk by appending extra data to the ring structure; performing erasure coding on the first data chunk utilizing only exclusive or (XOR) operations and the ring structure, wherein erasure coded encoded data resulting from the erasure coding is written to a persistent storage device; and maintaining an index pointer that references a portion of the ring structure; wherein the ring structure allows for multiplication of data included in the first data chunk to be implemented by rotation of the data utilizing the index pointer, thereby increasing efficiency of the storage system as the multiplication is simplified to an adjustment of the index pointer. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A computer program product comprising a computer-readable hardware storage medium having program code embodied therewith, the program code being executable by a computer to implement a method comprising:
at a storage manager of a storage system; arranging a first data chunk into a ring structure; tagging the first data chunk by appending extra data to the first data chunk ring structure; and performing erasure coding on the first data chunk utilizing only exclusive or (XOR) operations and the ring structure, wherein erasure coded encoded data resulting from the erasure coding is written to a persistent storage device; and maintaining an index pointer that references a portion of the ring structure; wherein the ring structure allows for multiplication of data included in the first data chunk to be implemented by rotation of the data utilizing the index pointer, thereby increasing efficiency of the storage system as the multiplication is simplified to an adjustment of the index pointer.
Specification