Provided are a computer program product, system, and method for replicating tracks from a first storage to a second and third storages. A determination is made of a track in the first storage to transfer to the second storage as part of a point-in-time copy relationship and of a stride of tracks including the target track. The stride of tracks including the target track is staged from the first storage to a cache according to the point-in-time copy relationship. The staged stride is destaged from the cache to the second storage. The stride in the cache is transferred to the third storage as part of a mirror copy relationship. The stride of tracks in the cache is demoted in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.
|
10. A system in communication with a first storage, a second storage, a third storage, and a cache, comprising:
at least one processor; and
at least one computer readable storage media including at least one computer program executed by the at least one processor to cause operations, the operations comprising:
providing a point-in-time copy relationship to copy tracks as of a point-in-time in the first storage to the second storage;
providing a mirror copy relationship to copy data in the second storage to the third storage;
determining a target track in the first storage to transfer to the second storage as part of the point-in-time copy relationship;
determining a stride of tracks including the target track;
staging the stride of tracks including the target track from the first storage to the cache according to the point-in-time copy relationship;
destaging the staged stride from the cache to the second storage;
transferring the stride in the cache to the third storage as part of the mirror copy relationship; and
demoting the stride of tracks in the cache in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.
1. A computer program product for copying data from a first storage to a second storage and a third storage, wherein a cache is used to cache data for the second storage, the computer program product comprising a computer readable storage medium having computer readable program code embodied therein that executes to cause operations, the operations comprising:
providing a point-in-time copy relationship to copy tracks as of a point-in-time in the first storage to the second storage;
providing a mirror copy relationship to copy data in the second storage to the third storage;
determining a target track in the first storage to transfer to the second storage as part of the point-in-time copy relationship;
determining a stride of tracks including the target track;
staging the stride of tracks including the target track from the first storage to the cache according to the point-in-time copy relationship;
destaging the staged stride from the cache to the second storage;
transferring the stride in the cache to the third storage as part of the mirror copy relationship; and
demoting the stride of tracks in the cache in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.
2. The computer program product of
destaging the stride of tracks from the first cache to the second storage as a full stride write; and
destaging the stride of tracks from the second cache to the third storage as a full stride write.
3. The computer program product of
4. The computer program product of
receiving a write to a track that has not been copied to the second storage as part of the background copy operation;
staging a second stride of tracks including the track subject to the write from the first storage to the cache as part of the point-in-time copy relationship;
destaging the staged tracks of the second stride from the cache to the second storage;
transferring the staged tracks of the second stride from the cache to the third storage;
demoting the second stride of tracks in the cache in response to destaging the second stride of the tracks in the cache to the second storage and transferring the tracks from the second storage to the third storage; and
applying the write to the track in the first storage in response to staging the second stride of the tracks in the cache.
5. The computer program product of
determining tasks to assign at the first and second controllers to perform the staging, destaging and the transfer.
6. The computer program product of
assigning at least a first number of tasks to each of at least one port of the second controller for the transfer of the first or second stride of tracks to the third controller to store in the third storage as part of the mirror copy relationship;
assigning no more than a second number of tasks to the first controller to read the first or second stride of tracks from the first storage;
assigning no more than the second number of tasks to the second controller to destage the first or second stride of tracks from the cache to the second storage;
assigning no more than a third number of tasks to first device adaptors used to access the first storage;
assigning no more than the third number of tasks to second device adaptors used to access the second storage.
7. The computer program product of
receiving a write to a track in the first storage, wherein the determined target track comprises the track subject to the write;
determining if the received write is part of sequential write operations to sequential tracks, wherein the operation of staging, destaging, and transferring the stride are performed in response to determining that the received write is the part of sequential write operations; and
applying the write to the target track in the first storage in response to staging the stride of tracks to the cache.
8. The computer program product of
staging the target track subject to the write from the first storage to the cache;
destaging the staged target track from the cache to the second storage;
transferring the staged target track from the cache to the third storage;
demoting the target track in the cache in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage and
applying the write to the target track in the first storage in response to transferring the target track in the cache to the second storage and the third storage.
9. The computer program product of
11. The system of
destaging the stride of tracks from the first cache to the second storage as a full stride write; and
destaging the stride of tracks from the second cache to the third storage as a full stride write.
12. The system of
13. The system of
receiving a write to a track that has not been copied to the second storage as part of the background copy operation;
staging a second stride of tracks including the track subject to the write from the first storage to the cache as part of the point-in-time copy relationship;
destaging the staged tracks of the second stride from the cache to the second storage;
transferring the staged tracks of the second stride from the cache to the third storage;
demoting the second stride of tracks in the cache in response to destaging the second stride of the tracks in the cache to the second storage and transferring the tracks from the second storage to the third storage; and
applying the write to the track in the first storage in response to staging the second stride of the tracks in the cache.
14. The system of
determining tasks to assign at the first and second controllers to perform the staging, destaging and the transfer.
15. The system of
receiving a write to a track in the first storage, wherein the determined target track comprises the track subject to the write;
determining if the received write is part of sequential write operations to sequential tracks, wherein the operation of staging, destaging, and transferring the stride are performed in response to determining that the received write is the part of sequential write operations; and
applying the write to the target track in the first storage in response to staging the stride of tracks to the cache.
16. The system of
staging the target track subject to the write from the first storage to the cache;
destaging the staged target track from the cache to the second storage;
transferring the staged target track from the cache to the third storage;
demoting the target track in the cache in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage and
applying the write to the target track in the first storage in response to transferring the target track in the cache to the second storage and the third storage.
17. The system of
|
|||||||||||||||||||||||||
1. Field of the Invention
The present invention relates to a computer program product, system, and method for replicating tracks from a first storage to a second and third storages.
2. Description of the Related Art
In a storage environment, volumes may be mirrored to other volumes to provide redundant copies of data. A point-in-time copy replicates data in a manner that appears instantaneous and allows a host to continue accessing the source volume while actual data transfers to the copy volume are deferred to a later time. The point-in-time copy appears instantaneous because complete is returned to the copy operation in response to generating the relationship data structures without copying the data. Point-in-time copy techniques, such as the IBM FlashCopy® (FlashCopy is a registered trademark of International Business Machines, Corp. or “IBM”), defer the transfer of data back to the copy volume until a write operation is requested to that data block on the source volume. The FlashCopy operation may specify a background copy operation to copy tracks subject to the FlashCopy relation in the background before a write is received. Until the actual copy operation occurs, reads are directed to the data blocks on the source volume. The point-in-time copy relationships that are immediately established in response to the point-in-time copy command include a bitmap or other data structure indicating the location of blocks in the volume at either the source volume or the copy volume.
The FlashCopy relationship may also be configured with no background copy, so that tracks are only copied before a write is applied to the track. In this configuration, when a track is destaged on the source, the previous version of the source on the disk may need to be copied to the target before the destage is allowed on the source. This is done using a CST (Copy Source to Target) operation. CST will stage the track from the source disk and then synthesize the target track in the target cache and then destage the track to the target storage. Once the destage on the target is complete, the track is demoted from cache in an accelerated fashion.
In further configurations, the FlashCopy target may also comprise a primary storage in a mirror Peer-to-Peer Copy (PPRC) relationship. In such a case, the track in the PPRC primary, which is also the FlashCopy target, may need to be transferred to the PPRC secondary storage in a PPRC remote site.
There is a need in the art for improved techniques for managing the replication of a track in a first storage to multiple replication storages.
Provided are a computer program product, system, and method for replicating tracks from a first storage to a second and third storages. A point-in-time copy relationship is provided to copy tracks as of a point-in-time in the first storage to a second storage. A mirror copy relationship is provided to copy data in the second storage to the third storage. A determination is made of a track in the first storage to transfer to the second storage as part of the point-in-time copy relationship and of a stride of tracks including the target track. The stride of tracks including the target track is staged from the first storage to a cache according to the point-in-time copy relationship. The staged stride is destaged from the cache to the second storage. The stride in the cache is transferred to the third storage as part of the mirror copy relationship. The stride of tracks in the cache is demoted in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.
The controllers 6a, 6b, 6c include processors 8a, 8b, 8c and memories 10a, 10b, 10c, respectively. The controllers 6a, 6b, 6c further have caches 12a, 12b, 12c, respectively, to cache data subject to read and write requests directed to the storages 4a, 4b, 4c. Hosts (not shown) may direct read and write requests to the first controller 6a to access tracks in the first storage 4a. A host write to a track in the first storage 4a in a point-in-time (“PiT”) copy relationship 16 may result in the replication of that track to the second 2b and the third 2c clusters if the track is also part of a mirror copy relationship 22. The controllers 6a, 6b, 6c may communicate over a network 9.
The first memory 10a includes a point-in-time (PiT) copy program 14 to maintain a point-in-time copy of data by copying-on-write data in the first storage 4a before the data is updated. The PiT copy program 14a may implement a PiT program such as IBM FlashCopy, snapshot, and other PiT programs. The PiT copy program 14 maintains a PiT copy relationship 16 identifying tracks in the first storage 4a subject to being copied as part of a PiT copy to identified corresponding tracks in the second storage 4b. The PiT copy relationship 16 further includes a PiT bitmap 18 indicating tracks in the first storage 4a that have been copied to the second storage 4b, so that the data as of the point-in-time comprises the data in the first storage 4a and the PiT tracks copied to the second storage 4b before being updated. The PiT copy relationship 16 may be configured with a background copy operation to copy all tracks in the first storage 4a to the second storage 4b in the background. When a track is copied as part of the background operation, the bit for that copied track in the PiT bitmap 18 is updated to indicate that the track as of the point-in-time resides in the second storage 4b.
The second controller 6b maintains a mirror copy program 20 to create a mirror copy of tracks in the second storage 4b to the third storage 4c. The mirror copy program 20 may comprise mirror copy programs known in the art, such as the IBM Peer-to-Peer-Copy (“PPRC”) program. The mirror copy program 20 copies tracks indicated in a mirror copy relationship 22 that specifies the tracks to mirror from the second storage 4b to the third storage 4c. An out-of-synch (“OOS”) bitmap 24 includes a bit indicating each track in the mirror copy relationship 24, such that the bits are set to indicate copy at an initial point when all bits are sent to indicate copy to cause an initial copy of all the data to mirror and when a track is updated so that the updated track is copied to the third storage 4c.
A scheduler 26, shown as residing in the first controller 6a, but may alternatively reside in other controllers e.g., 6b, 6c, schedules the PiT copy program 14 and mirror copy program 20 to perform the copy operations specified in the PiT 16 and mirror 22 copy relationships, respectively. The scheduler 26 allocates tasks to perform the staging of the track from the first storage 4a to the second cache 12b to be destaged to the second storage 4b and to perform the mirror copy operation of the track staged into the second cache 12b to the third storage 4b.
The programs scheduler 26, PiT copy program 14, and mirror copy program 20 are shown in
The storages 4a, 4b, 4c may store tracks in a Redundant Array of Independent Disks (RAID) configuration where strides of tracks are written across multiple storage devices comprising the storages 4a, 4b, 4c. Strides comprise tracks written across disks in a RAID rank, where a stride of track includes data and parity information calculated form the data in the stride striped across the storage devices. A RAID rank comprises a group of storage devices configured to work as a RAID set, such that the stride of tracks, including data and parity tracks, are striped across the storage devices in the RAID rank. The storages 4a, 4b, 4c may include one or more configured RAID ranks.
The memories 10a, 10b, 10c may comprise one or more volatile or non-volatile storage devices, such as a Dynamic Random Access Memory (DRAM), Random Access Memory (RAM) or a non-volatile memory, e.g., battery backed-up Random Access Memory (RAM), static RAM (SRAM), solid state storage devices (SSDs), etc.
The storages 4a, 4b, 4c may each comprise one or more storage devices known in the art, such as interconnected storage devices, where the storage devices may comprise hard disk drives, solid state storage device (SSD) comprised of solid state electronics, such as a EEPROM (Electrically Erasable Programmable Read-Only Memory), flash memory, flash disk, Random Access Memory (RAM) drive, storage-class memory (SCM), etc., magnetic storage disk, optical disk, tape, etc. The network 9 may comprise a network such as a Local Area Network (LAN), Storage Area Network (SAN), Wide Area Network (WAN), peer-to-peer network, wireless network, etc. Further the network 9 may be separated into separate networks between the controllers 6a, 6b, 6c.
The scheduler 26 determines (at block 106) tasks to assign to first and second controllers 6a, 6b to stage, destage, and transfer the stride of tracks as part of the PiT copy relationship and the mirror copy relationship. The scheduler 26 may assign tasks to ports on the second controller 6b host adaptors 521, 522 . . . 52n for the mirror copy operation, and assign tasks to the device adaptors 501, 502 . . . 50n in the first 6a and second 6b controllers, and assign tasks to access the RAID ranks in the first 4a and second 4b storages. The scheduler 26 schedules the PiT copy program 14 to stage (at block 108) the stride of tracks including the target track from the first storage 4a to the second cache 12b according to the PiT copy relationship 16. The second controller 6b updates (at block 110) metadata for the stride of tracks staged into the second cache 12, e.g., synthesis, to indicate that the stride of tracks is stored in the second storage 4b, such as change the track identifier, volume identifier, and storage device identifier to that in the second storage 4b where the track will be destaged. The second controller 6b destages (at block 112) the staged stride from the second cache 12b to the second storage 4b. The PiT bitmap 18 is updated to indicate the tracks that were copied to the second cache 12b.
The scheduler 26 further schedules (at block 114) the mirror copy program 20 to transfer the stride of tracks in the second cache 12b to the third cluster 2c for storage in the third storage 4c as part of the mirror copy relationship 20. Upon transferring the stride of tracks to the third cluster 3c, the OOS bitmap 24 is updated to indicate the tracks that were transferred. In response to destaging the stride of the tracks in the second cache 12b to the second storage 4b and transferring the stride of tracks in the second cache 12b to the third cluster 2c, the stride of tracks are indicated (at block 116) as eligible for demotion, which means they may be demoted in an accelerated manner or demoted according to a Least Recently Used (LRU) cache management scheme.
With the operations of
The scheduler 26 assigns (at block 148) no more than a third number of tasks, e.g., another maximum number, to each of the first device adaptors 501, 502 . . . 50n in the first controller 6a used to access the first storage 4a and assigns (at block 150) no more than the third number of tasks, e.g., another maximum number, to each of the second device adaptors 501, 502 . . . 50n in the second controller 6b used to access the second storage 4b. The third number of tasks is a maximum number that is used to avoid overdriving the device adaptors 501, 502 . . . 50n. The tasks assigned to the first device adaptors 501, 502 . . . 50n are used by the first controller 6a to transfer the stride from the first storage 4a to the second cache 12b and the tasks assigned to the second device adaptors 501, 502 . . . 50n are used by the second controller 6b to destage the stride from the second cache 12b to the second storage 4b.
The scheduler 26 further schedules (at block 220) the transfer of the track(s) in the second cache 12b to the third cluster 2c for storage in the third storage 4c as part of the mirror copy relationship 20. Upon transferring the stride of tracks to the third cluster 3c, the OOS bitmap 24 is updated to indicate the track(s) that were transferred. In response to destaging the track(s) in the second cache 12b to the second storage 4b and transferring the track(s) in the second cache 12b to the third cluster 2c, the track(s) are indicated (at block 222) as eligible for demotion, which means they may be demoted in an accelerated fashion or demoted according to a Least Recently Used (LRU) cache management scheme.
If (at block 212) the write is part of sequential write operations, then the scheduler 26 and other components performs (at block 224) the operations at blocks 104-116 to determine a stride of track including the track to write, determine tasks to assign, schedule staging, destage, schedule the transfer, and demote the stride of tracks. After the track(s) are staged at blocks 220 or 224, the first controller 6a applies (at block 230) the write to the track in the first storage 4b.
The described embodiments provide techniques for optimizing the replication of tracks from a first storage to a second and third storages by staging the tracks to the second cache and then from the second cache, destaging the tracks to the second storage and transferring the tracks to the third cluster for storage in the third storage. Further, in certain situations, such as for a write when background copy is set or for a sequential write when there is no background copy, a stride of tracks including the track subject to the write may be staged from the first storage to the second cache so that when destaging to the second storage and transferring to the third storage a full stride write may occur, which optimizes the write operation to the RAID ranks including the tracks subject to the replication.
The described operations may be implemented as a method, apparatus or computer program product using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof. Accordingly, aspects of the embodiments may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the embodiments may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The terms “an embodiment”, “embodiment”, “embodiments”, “the embodiment”, “the embodiments”, “one or more embodiments”, “some embodiments”, and “one embodiment” mean “one or more (but not all) embodiments of the present invention(s)” unless expressly specified otherwise.
The terms “including”, “comprising”, “having” and variations thereof mean “including but not limited to”, unless expressly specified otherwise.
The enumerated listing of items does not imply that any or all of the items are mutually exclusive, unless expressly specified otherwise.
The terms “a”, “an” and “the” mean “one or more”, unless expressly specified otherwise.
Devices that are in communication with each other need not be in continuous communication with each other, unless expressly specified otherwise. In addition, devices that are in communication with each other may communicate directly or indirectly through one or more intermediaries.
A description of an embodiment with several components in communication with each other does not imply that all such components are required. On the contrary a variety of optional components are described to illustrate the wide variety of possible embodiments of the present invention.
Further, although process steps, method steps, algorithms or the like may be described in a sequential order, such processes, methods and algorithms may be configured to work in alternate orders. In other words, any sequence or order of steps that may be described does not necessarily indicate a requirement that the steps be performed in that order. The steps of processes described herein may be performed in any order practical. Further, some steps may be performed simultaneously.
When a single device or article is described herein, it will be readily apparent that more than one device/article (whether or not they cooperate) may be used in place of a single device/article. Similarly, where more than one device or article is described herein (whether or not they cooperate), it will be readily apparent that a single device/article may be used in place of the more than one device or article or a different number of devices/articles may be used instead of the shown number of devices or programs. The functionality and/or the features of a device may be alternatively embodied by one or more other devices which are not explicitly described as having such functionality/features. Thus, other embodiments of the present invention need not include the device itself.
The illustrated operations of the figures show certain events occurring in a certain order. In alternative embodiments, certain operations may be performed in a different order, modified or removed. Moreover, steps may be added to the above described logic and still conform to the described embodiments. Further, operations described herein may occur sequentially or certain operations may be processed in parallel. Yet further, operations may be performed by a single processing unit or by distributed processing units.
The foregoing description of various embodiments of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims herein after appended.
Gupta, Lokesh M., Benhase, Michael T., Spear, Gail A., Hatfield, Brian D.
| Patent | Priority | Assignee | Title |
| Patent | Priority | Assignee | Title |
| 6381677, | Aug 19 1998 | International Business Machines Corporation | Method and system for staging data into cache |
| 7409510, | May 27 2004 | International Business Machines Corporation | Instant virtual copy to a primary mirroring portion of data |
| 20050251634, | |||
| 20080098187, | |||
| 20120079224, | |||
| 20120198150, | |||
| 20120303861, | |||
| 20140075114, |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Sep 12 2012 | International Business Machines Corporation | (assignment on the face of the patent) | / |
| Date | Maintenance Fee Events |
| Date | Maintenance Schedule |
| Jun 16 2018 | 4 years fee payment window open |
| Dec 16 2018 | 6 months grace period start (w surcharge) |
| Jun 16 2019 | patent expiry (for year 4) |
| Jun 16 2021 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Jun 16 2022 | 8 years fee payment window open |
| Dec 16 2022 | 6 months grace period start (w surcharge) |
| Jun 16 2023 | patent expiry (for year 8) |
| Jun 16 2025 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Jun 16 2026 | 12 years fee payment window open |
| Dec 16 2026 | 6 months grace period start (w surcharge) |
| Jun 16 2027 | patent expiry (for year 12) |
| Jun 16 2029 | 2 years to revive unintentionally abandoned end. (for year 12) |