Flash copy relationship management

Patent metadata

Field	Value
Publication number	US-9542107-B2
Application number	US-201414314203-A
Country	US
Kind code	B2
Filing date	Jun 25, 2014
Priority date	Jun 25, 2014
Publication date	Jan 10, 2017
Grant date	Jan 10, 2017

Abstract

A method for combining storage array copy requests for a disk storage system is disclosed. The method may include receiving a BGC (background copy) request, determining that the BGC request satisfies a set of background copy (BGC) criteria, and adding, based on the determining, the BGC request to a sorted position in the wait accumulation queue (WAQ). The method may also include combining, based on a set of track combining criteria, the BGC request and an adjacent BGC request into a combined BGC request including data locations corresponding to the BGC request and to the adjacent BGC request. The method may also include replacing, in a sorted position in the WAQ, the BGC request and the adjacent BGC request with the combined BGC request, and moving, based on the set of BGC criteria, the combined BGC request to a BGC queue.

First claim

What is claimed is:

1. A method for combining storage array copy requests for a disk storage system, the method comprising:
receiving a first BGC (background copy) request;
determining that the first BGC request satisfies a set of background copy (BGC) criteria that at least includes a number of BGC relationships in a BGC queue, a number of BGC relationships corresponding to a source volume and a target volume, and a number of tracks in a current BGC relationship;
adding, based on the determining, the first BGC request to a sorted position in a wait accumulation queue (WAQ);
combining, based on comparing a set of track combining data to a set of track combining criteria that at least includes, corresponding to BGC requests to be combined, sequential source tracks, sequential target tracks, a matching source volume and a matching target volume, the first BGC request and a first adjacent BGC request, selected from a plurality of BGC requests in the BGC queue, into a second BGC request, the second BGC request including data locations corresponding to the first BGC request and data locations corresponding to the first adjacent BGC request;
replacing, in a sorted position in the WAQ, the first BGC request and the first adjacent BGC request with the second BGC request; and
moving, based on the set of BGC criteria, the second BGC request to the BGC queue.

2. The method of claim 1 , further comprising appending a first timestamp to the first BGC request and appending a second timestamp to the second BGC request, and moving, based upon the first timestamp and the second timestamp, a BGC request from the WAQ to the BGC queue.

3. The method of claim 1 , further comprising monitoring a size of the BGC queue and a growth rate of the BGC queue.

4. The method of claim 3 , further comprising dynamically adjusting the set of BGC criteria based on the size of the BGC queue.

5. The method of claim 3 , further comprising dynamically adjusting the set of BGC criteria based on the growth rate of the BGC queue.

6. The method of claim 1 , wherein the set of BGC criteria includes at least one member of a group consisting of: a BGC queue request count threshold, a relationship track count threshold, and a volume request count threshold.

7. The method of claim 1 , further comprising monitoring a set of track combining data including:
a first BGC request source volume;
a first adjacent BGC request source volume;
a first BGC request target volume;
a first adjacent BGC request target volume;
a first and a last BGC request source track;
a first and a last adjacent BGC request source track;
a first and a last BGC request target track; and
a first and a last adjacent BGC request target track.

8. The method of claim 1 , further comprising combining, based on comparing a set of track combining data to a set of track combining criteria, a second adjacent BGC request into the second BGC request, the second BGC request including data locations corresponding to the second adjacent BGC request.

9. An electronic system for combining storage array copy requests for a disk storage system, the electronic system comprising:
a multi-volume disk storage system;
a control unit adapter;
a memory device; and
one or more processor circuits configured to:
receive a first BGC (background copy) request;
determine that the first BGC request satisfies a set of background copy (BGC) criteria that at least includes a number of BGC relationships in a BGC queue, a number of BGC relationships corresponding to a source volume and a target volume, and a number of tracks in a current BGC relationship;
add, based on the determining, the first BGC request to a sorted position in a wait accumulation queue (WAQ);
combine, based on comparing a set of track combining data to a set of track combining criteria that at least includes, corresponding to BGC requests to be combined, sequential source tracks, sequential target tracks, a matching source volume and a matching target volume, the first BGC request and a first adjacent BGC request, selected from a plurality of BGC requests in the BGC queue, into a second BGC request, the second BGC request including data locations corresponding to the first BGC request and data locations corresponding to the first adjacent BGC request;
replace, in a sorted position in the WAQ, the first BGC request and the first adjacent BGC request with the second BGC request; and
move, based on the set of BGC criteria, the second BGC request to the BGC queue.

10. The electronic system of claim 9 , wherein the one or more processor circuits are further configured to monitor a set of track combining data including:
a first BGC request source volume;
a first adjacent BGC request source volume;
a first BGC request target volume;
a first adjacent BGC request target volume;
a first and a last BGC request source track;
a first and a last adjacent BGC request source track;
a first and a last BGC request target track; and
a first and a last adjacent BGC request target track.

11. The electronic system of claim 9 , wherein the one or more processor circuits are further configured to combine, based on comparing a set of track combining data to a set of track combining criteria, a second adjacent BGC request into the second BGC request, the second BGC request including data locations corresponding to the second adjacent BGC request.

12. A computer program product for combining storage array copy requests for a disk storage system, the computer program product comprising:
a computer readable storage medium having stored thereon:
program instructions executable by one or more processor circuits to cause the one or more processor circuits to:
receive a first BGC (background copy) request;
determine that the first BGC request satisfies a set of background copy (BGC) criteria that at least includes a number of BGC relationships in a BGC queue, a number of BGC relationships corresponding to a source volume and a target volume, and a number of tracks in a current BGC relationship;
add, based on the determining, the first BGC request to a sorted position in a wait accumulation queue (WAQ);
combine, based on comparing a set of track combining data to a set of track combining criteria that at least includes, corresponding to BGC requests to be combined, sequential source tracks, sequential target tracks, a matching source volume and a matching target volume, the first BGC request and a first adjacent BGC request, selected from a plurality of BGC requests in the BGC queue, into a second BGC request, the second BGC request including data locations corresponding to the first BGC request and data locations corresponding to the first adjacent BGC request;
replace, in a sorted position in the WAQ, the first BGC request and the first adjacent BGC request with the second BGC request; and
move, based on the set of BGC criteria, the second BGC request to the BGC queue.

13. The computer program product of claim 12 , wherein the program instructions are executable to further cause the one or more processor circuits to append a first timestamp to the first BGC request and append a second timestamp to the second BGC request, and move, based upon the first timestamp and the second timestamp, a BGC request from the WAQ to the BGC queue.

14. The computer program product of claim 12 , wherein the program instructions are executable to further cause the one or more processor circuits to monitor a size of the BGC queue and a growth rate of the BGC queue.

15. The computer program product of claim 12 wherein the program instructions are executable to f

Assignees

• IBM

Inventors

• Brown Theresa M
• Francisco Nedlaya Y
• Li Suguang
• Peterson Beth A

Classifications

• G06F3/0659

  Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title

• G06F3/0619 Primary

  in relation to data integrity, e.g. data losses, bit errors · CPC title

• G06F3/0689

  Disk arrays, e.g. RAID, JBOD · CPC title

• G06F3/061

  Improving I/O performance · CPC title