CONVERTING A DATA CHUNK INTO A RING ALGEBRAIC STRUCTURE FOR FAST ERASURE CODING
First Claim
Patent Images
1. 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.
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:
-
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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A 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; 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. - 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:
-
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.
-
Specification