Cache node processing
AssigneeHewlett Packard Enterprise Development LP
InventorWeimin Pan
Life of this patent
Estimating the term…
Abstract
A technique for cache node processing that includes generating a cache node in response to a request to write data to storage devices. If logical block address (LBA) of the generated cache node is adjacent to LBA of cache nodes of a cache node list, then check if there are cache nodes that are sequential up to a predefined boundary. If there are cache nodes that are sequential up to the predefined boundary, then flush the data of the sequential cache nodes together as a group up to the predefined boundary.
Claims18
A storage controller for cache node processing, comprising:
- a cache node list;
- and
- a cache management module to:
- generate a cache node in response to a request to write data to storage devices;
- in response to a logical block address (LBA) of the cache node that is generated being adjacent to the LBA of cache nodes of the cache node list, check if a total size of cache nodes that are in a consecutively addressed sequential order has reached a predefined boundary, wherein the predefined boundary includes a full stripe of storage configured as a redundant array of independent disk (RAID);
- and
- in response to the total size of the cache nodes that are in the consecutively addressed sequential order having reached the predefined boundary, flush the data of the cache nodes that are sequential together as a group up to the predefined boundary.
A method for cache node processing, comprising:
- generating a cache node in response to a request to write data to storage devices;
- in response to a logical block address (LBA) of the cache node that is generated being adjacent to the LBA of cache nodes of a cache node list, checking if a total size of cache nodes that are in a consecutively addressed sequential order has reached a predefined boundary, wherein the predefined boundary includes a full stripe of storage configured as a redundant array of independent disk (RAID);
- and
- in response to the total size of the cache nodes that are in the consecutively addressed sequential order having reached the predefined boundary, flushing the data of the cache nodes that are sequential together as a group up to the predefined boundary.
A non-transitory computer-readable medium having computer executable instructions stored thereon for cache node processing, the instructions are executable by a processor to:
- generate a cache node in response to a request to write data to storage devices;
- in response to a logical block address (LBA) of the cache node that is generated being adjacent to the LBA of cache nodes of a cache node list, check if a total size of cache nodes that are in a consecutively addressed sequential order has reached a predefined boundary, wherein the predefined boundary includes a full stripe of storage configured as a redundant array of independent disk (RAID);
- and
- in response to the total size of the cache nodes that are in the consecutively addressed sequential order having reached the predefined boundary, flush data of the cache nodes that are sequential together as a group up to the predefined boundary.
Dependencies are inferred from the claim text.