Accumulating i/o operations into a single combined i/o operation for implementation by an underlying storage device layer
US-2024143234-A1 · May 2, 2024 · US
US9692447B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9692447-B2 |
| Application number | US-201514682205-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 9, 2015 |
| Priority date | Apr 9, 2015 |
| Publication date | Jun 27, 2017 |
| Grant date | Jun 27, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Various embodiments for data compression by a processor. Levels of data distribution are configured for data processing, including a first level of the data distribution incorporating a GRID network of data storage nodes, and a second level of the data distribution incorporating a GRID network of compressive nodes in communication with the GRID network of data storage nodes. Input/output (I/O) for an associated storage volume is load balanced between the data storage nodes, as data passes through the first level into the second level to be compressed or uncompressed.
Opening claim text (preview).
What is claimed is: 1. A method for data compression by a processor, the method comprising: configuring levels of data distribution for data processing, including a first level of the data distribution incorporating a GRID network of data storage nodes, and a second level of the data distribution incorporating a GRID network of compressive nodes in communication with the GRID network of data storage nodes; wherein input/output (I/O) for an associated storage volume is load balanced between the data storage nodes, as data passes through the first level into the second level to be compressed or uncompressed. 2. The method of claim 1 , further including configuring the second level incorporating the GRID network of compressive nodes between the first level incorporating the GRID network of data storage nodes and an additional level incorporating a GRID network of interface nodes. 3. The method of claim 2 , further including directing the I/O from one of the interface nodes to one of the compressive nodes, or directing the I/O from one of the compressive nodes to one of the data storage nodes. 4. The method of claim 1 , further including pursuant to load balancing the I/O between the data storage nodes, upon a failure of one of the data storage nodes in the GRID network, redistributing the I/O among the remaining data storage nodes. 5. The method of claim 1 , further including organizing sections of the storage volume into a plurality of compression objects to be passed to the compressive nodes. 6. The method of claim 5 , further including directing the I/O to an appropriate one of the compressive nodes by determining a relationship between an associated section and the appropriate one of the compressive nodes in a compression distribution table. 7. The method of claim 6 , further including determining a section number as a function of a logical block address (LBA), a volume offset, a region size, and a number of sections. 8. A system for data compression, comprising: a processor that configures levels of data distribution for data processing, including a first level of the data distribution incorporating a GRID network of data storage nodes, and a second level of the data distribution incorporating a GRID network of compressive nodes in communication with the GRID network of data storage nodes; wherein input/output (I/O) for an associated storage volume is load balanced between the data storage nodes, as data passes through the first level into the second level to be compressed or uncompressed. 9. The system of claim 8 , wherein the processor configures the second level incorporating the GRID network of compressive nodes between the first level incorporating the GRID network of data storage nodes and an additional level incorporating a GRID network of interface nodes. 10. The system of claim 9 , wherein the processor directs the I/O from one of the interface nodes to one of the compressive nodes, or directs the I/O from one of the compressive nodes to one of the data storage nodes. 11. The system of claim 8 , wherein the processor, pursuant to load balancing the I/O between the data storage nodes, upon a failure of one of the data storage nodes in the GRID network, redistributes the I/O among the remaining data storage nodes. 12. The system of claim 8 , wherein the processor organizes sections of the storage volume into a plurality of compression objects to be passed to the compressive nodes. 13. The system of claim 12 , wherein the processor directs the I/O to an appropriate one of the compressive nodes by determining a relationship between an associated section and the appropriate one of the compressive nodes in a compression distribution table. 14. The system of claim 13 , wherein the processor determines a section number as a function of a logical block address (LBA), a volume offset, a region size, and a number of sections. 15. A computer program product for data compression by a processor, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising: a first executable portion that configures levels of data distribution for data processing, including a first level of the data distribution incorporating a GRID network of data storage nodes, and a second level of the data distribution incorporating a GRID network of compressive nodes in communication with the GRID network of data storage nodes; wherein input/output (I/O) for an associated storage volume is load balanced between the data storage nodes, as data passes through the first level into the second level to be compressed or uncompressed. 16. The computer program product of claim 15 , further including a second executable portion that configures the second level incorporating the GRID network of compressive nodes between the first level incorporating the GRID network of data storage nodes and an additional level incorporating a GRID network of interface nodes. 17. The computer program product of claim 16 , further including a third executable portion that directs the I/O from one of the interface nodes to one of the compressive nodes, or directs the I/O from one of the compressive nodes to one of the data storage nodes. 18. The computer program product of claim 15 , further including a second executable portion that, pursuant to load balancing the I/O between the data storage nodes, upon a failure of one of the data storage nodes in the GRID network, redistributes the I/O among the remaining data storage nodes. 19. The computer program product of claim 15 , further including a second executable portion that organizes sections of the storage volume into a plurality of compression objects to be passed to the compressive nodes. 20. The computer program product of claim 19 , further including a third executable portion that directs the I/O to an appropriate one of the compressive nodes by determining a relationship between an associated section and the appropriate one of the compressive nodes in a compression distribution table. 21. The computer program product of claim 20 , further including a fourth executable portion that determines a section number as a function of a logical block address (LBA), a volume offset, a region size, and a number of sections.
Disk arrays, e.g. RAID, JBOD · CPC title
Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction · CPC title
Distributed Source coding, e.g. Wyner-Ziv, Slepian Wolf · CPC title
Saving memory space in the encoder or decoder · CPC title
Compression optimized for errors · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.