Data storage cache management

Patent metadata

Field	Value
Publication number	US-10078591-B2
Application number	US-201615277104-A
Country	US
Kind code	B2
Filing date	Sep 27, 2016
Priority date	Sep 27, 2016
Publication date	Sep 18, 2018
Grant date	Sep 18, 2018

Abstract

A method of managing a data storage cache, comprising: providing a redundant cache comprising first and second caches associated with first and second storage volumes. One of the first and second storage volumes is an active, and one is a passive volume. A write request is received at one of the volumes. If the write request is received at the passive volume, it is forwarded to the active volume. It is determined whether the active volume is a low latency volume. If it is a low latency volume, it is determined whether data exists in the cache associated with the active volume which overlaps with data contained in the write request. If no data exists in that cache which overlaps with data contained in the write request, the write request is processed straight down to said active volume.

First claim

The invention claimed is:

1. A method of managing a data storage cache, comprising:
providing a redundant cache comprising a first cache associated with a first storage volume and a second cache associated with a second storage volume, one of said first and second storage volumes being an active volume and the other of said first and second storage volumes being a passive volume;
receiving, at one of said first storage volume or said second storage volume, a request to write data;
if said request to write data is received at said passive volume, forwarding said request to write data to said active volume;
determining whether said active volume is a low latency volume;
responsive to said active volume being a low latency volume, determining whether data exists in the cache associated with said active volume which overlaps with data contained in said write request; and
responsive to no data existing in the cache associated with said active volume which overlaps with data contained in said write request, processing said write request straight down to said active volume.

2. The method of claim 1 , further comprising, responsive to data existing in the cache associated with said active volume which overlaps with data contained in said write request, processing said write request using a conventional caching algorithm and accelerating when the data written is destaged.

3. The method of claim 1 , further comprising, responsive to said active volume not being a low latency volume, processing said write request using a conventional caching algorithm to be destaged at a later time.

4. The method of claim 1 , further comprising publishing which of said first storage volume or said second storage volume is said active volume.

5. The method of claim 1 , where said determination as to whether said active volume is a low latency volume uses information indicating the latency of the volume stored in a volume mapping.

6. An apparatus for managing a data storage cache, the apparatus comprising:
a first storage volume and a second storage volume, one of said first and second storage volumes being an active volume and the other of said first and second storage volumes being a passive volume;
a redundant cache comprising a first cache associated with a first storage volume and a second cache associated with a second storage volume; and
a first node associated with said first cache and a second node associated with said second cache, one of said first node or said second node receiving a request to write data, if said request to write data is received at the node associated with said passive volume, forwarding said request to write data to the node associated with said active volume, the node associated with said active volume determining whether said active volume is a low latency volume, responsive to said active volume being a low latency volume, determining whether data exists in the cache associated with said active volume which overlaps with data contained in said write request; and responsive to no data existing in the cache associated with said active volume which overlaps with data contained in said write request, processing said write request straight down to said active volume.

7. The apparatus of claim 6 , wherein the node associated with said active volume, responsive to data existing in the cache associated with said active volume which overlaps with data contained in said write request, processing said write request using a conventional caching algorithm and accelerating when the data written is destaged.

8. The apparatus of claim 6 , wherein the node associated with said active volume, responsive to said active volume not being a low latency volume, processing said write request using a conventional caching algorithm to be destaged at a later time.

9. The apparatus of claim 6 , wherein the node associated with said active volume publishes which of said first storage volume or said second storage volume is said active volume.

10. The apparatus of claim 6 , wherein the node associated with said active volume uses information indicating the latency of the volume stored in a volume mapping in determining whether said active volume is a low latency volume.

11. A computer program product for managing a data storage cache, the computer program product comprising:
a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to:
provide a redundant cache comprising a first cache associated with a first storage volume and a second cache associated with a second storage volume, one of said first and second storage volumes being an active volume and the other of said first and second storage volumes being a passive volume;
receive, at one of said first storage volume or said second storage volume, a request to write data;
if said request to write data is received at said passive volume, forward said request to write data to said active volume;
determine whether said active volume is a low latency volume;
responsive to said active volume being a low latency volume, determine whether data exists in the cache associated with said active volume which overlaps with data contained in said write request; and
responsive to no data existing in the cache associated with said active volume which overlaps with data contained in said write request, process said write request straight down to said active volume.

12. The computer program product of claim 11 , further comprising, responsive to data existing in the cache associated with said active volume which overlaps with data contained in said write request, processing said write request using a conventional caching algorithm and accelerating when the data written is destaged.

13. The computer program product of claim 11 , further comprising, responsive to said active volume not being a low latency volume, processing said write request using a conventional caching algorithm to be destaged at a later time.

14. The computer program product of claim 11 , further comprising publishing which of said first storage volume or said second storage volume is said active volume.

15. The computer program product of claim 11 , where said determination as to whether said active volume is a low latency volume uses information indicating the latency of the volume stored in a volume mapping.

Assignees

• IBM

Inventors

• Boden Ian
• Clayton Nicolas M
• Sanders Lee J
• Scales William J
• Whyte Barry D

Classifications

• G06F11/2056

  by mirroring · CPC title

• G06F12/0866

  for peripheral storage systems, e.g. disk cache · CPC title

• G06F2212/285

  Redundant cache memory · CPC title

• G06F12/0888

  using selective caching, e.g. bypass · CPC title

• G06F12/084 Primary

  with a shared cache · CPC title