Generating a large, non-compressible data stream

US10218764B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10218764-B2
Application numberUS-201816022501-A
CountryUS
Kind codeB2
Filing dateJun 28, 2018
Priority dateSep 17, 2014
Publication dateFeb 26, 2019
Grant dateFeb 26, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Generating non-compressible data streams is disclosed, including: receiving an initialization parameter; determining a constrained prime number, wherein the constrained prime number comprises a plurality of component values, wherein each of the plurality of component values comprises a prime number, wherein each of the plurality of component values is different; and generating a non-compressible sequence based at least in part on the initialization parameter and the constrained prime number.

First claim

Opening claim text (preview).

What is claimed is: 1. A system, comprising: a processor configured to: receive an initialization parameter; determine a first constrained prime number and a second constrained prime number; and generate based in part on the initialization parameter, the first constrained prime number, and the second constrained prime number, a non-compressible data stream comprising a plurality of data blocks; send the non-compressible data stream comprising the plurality of data blocks to be stored at a storage device, wherein the storage device is configured to store all of the plurality of data blocks in response to determining that none of the data blocks have been already stored at the storage device; receive restored data associated with the non-compressible data stream from the storage device, wherein the restored data associated with the non-compressible data stream comprises the plurality of data blocks; determine the first constrained prime number based at least in part on a difference between a first pair of non-consecutive values from the restored data associated with the non-compressible data stream; determine the second constrained prime number based at least in part on a difference between a second pair of non-consecutive values from the restored data associated with the non-compressible data stream; and verify an accuracy and/or reliability of the storage device based on the determined first constrained prime number and the determined second constrained prime number; and a memory coupled to the processor and configured to provide the processor with instructions. 2. The system of claim 1 , wherein the non-compressible data stream is generated at least in part by merging a first non-compressible sequence that is based on the first constrained prime number and a second non-compressible sequence that is based on the second constrained prime number. 3. The system of claim 1 , wherein the storage device is configured to store only new data blocks that have not already been stored at the storage device. 4. The system of claim 1 , wherein the initializing parameter is selected from a range of values included in an address space, wherein the address space ranges from 0 to 2 N −1 where N is a positive integer. 5. The system of claim 1 , wherein the first and second constrained prime numbers comprise a corresponding prime number from a set of prime numbers including “1” and excluding “2” in a range of 0 to 2 N −1, where N is a positive integer. 6. The system of claim 1 , wherein the non-compressible data stream comprises a plurality of component values selected from a set of prime numbers including “1” and excluding “2” in a range of 0 to 255. 7. The system of claim 1 , wherein the constrained prime number is determined from an identified set of constrained prime numbers based at least in part on a revision parameter. 8. The system of claim 1 , wherein the restored data is verified without a master copy of the non-compressible data stream. 9. The system of claim 1 , wherein to verify the restored data associated with the non-compressible data stream by using the first constrained prime number and the second constrained prime number comprises: determine of a first offset between the first pair of non-consecutive numbers from the restored data; determine of a second offset between the second pair of non-consecutive numbers from the restored data; and verify the data stream in response to determining the first offset is equal to the first constrained prime number and the second offset is equal to the second constrained prime number. 10. The system of claim 1 , wherein four consecutive values of the restored data associated with the non-compressible data stream are used to verify the accuracy and/or reliability of the storage device. 11. The system of claim 10 , wherein the four consecutive values are selected from a start portion of the restored data associated with the non-compressible data stream. 12. The system of claim 10 , wherein the four consecutive values are selected from a middle portion of the restored data associated with the non-compressible data stream. 13. The system of claim 1 , wherein the non-compressible data stream comprises a plurality of component values that comprise a byte value. 14. A method, comprising: receiving an initialization parameter; determining a first constrained prime number and a second constrained prime number; generating based in part on the initialization parameter, the first constrained prime number, and the second constrained prime number, a non-compressible data stream comprising a plurality of data blocks; sending, by the processor, the non-compressible data stream comprising the plurality of data blocks to be stored at a storage device, wherein the storage device is configured to store all is of the plurality of data blocks in response to determining that none of the data blocks have been already stored at the storage device; receiving restored data associated with the non-compressible data stream from the storage device, wherein the restored data associated with the non-compressible data stream comprises the plurality of data blocks; determining the first constrained prime number based at least in part on a difference between a first pair of non-consecutive values from the restored data associated with the non-compressible data stream; determining the second constrained prime number based at least in part on a difference between a second pair of non-consecutive values from the restored data associated with the non-compressible data stream; and verifying an accuracy and/or reliability of the storage device based on the determined first constrained prime number and the determined second constrained prime number. 15. The method of claim 14 , wherein the non-compressible data stream is generated at least in part by merging a first non-compressible sequence that is based on the first constrained prime number and a second non-compressible sequence that is based on the second constrained prime number. 16. The method of claim 14 , wherein verifying the restored data associated with the non-compressible data stream by using the first constrained prime number and the second constrained prime number comprises: determining a first offset between the first pair of non-consecutive numbers from the restored data; determining a second offset between the second pair of non-consecutive numbers from the restored data; and verifying the data stream in response to determining the first offset is equal to the first constrained prime number and the second offset is equal to the second constrained prime number. 17. The method of claim 14 , wherein four consecutive values of the restored data associated with the non-compressible data stream are used to verify the accuracy and/or reliability of the storage device. 18. The method of claim 17 , wherein the four consecutive values are selected from a start portion of the restored data associated with the non-compressible data stream. 19. The method of claim 17 , wherein the four consecutive values are selected from a middle portion of the restored data associated with the non-compressible data stream. 20. A computer program product, the computer program product embodied in a non-transitory computer readable storage medium and comprising computer instructions for: receiving an initialization parameter; determining a first constrained prime number and a second constrained prime number; generating based in part on the initialization para

Assignees

Inventors

Classifications

  • H04L65/607Primary

    Electricity · mapped topic

  • H04L65/70Primary

    Media network packetisation · CPC title

  • H04L43/50Primary

    Testing arrangements · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10218764B2 cover?
Generating non-compressible data streams is disclosed, including: receiving an initialization parameter; determining a constrained prime number, wherein the constrained prime number comprises a plurality of component values, wherein each of the plurality of component values comprises a prime number, wherein each of the plurality of component values is different; and generating a non-compressibl…
Who is the assignee on this patent?
Emc Ip Holding Co Llc
What technology area does this patent fall under?
Primary CPC classification H04L65/607. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Feb 26 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).