EP2387751B1 - Appareil et procédé de sauvegarde de données - Google Patents

Appareil et procédé de sauvegarde de données Download PDF

Info

Publication number
EP2387751B1
EP2387751B1 EP10724831A EP10724831A EP2387751B1 EP 2387751 B1 EP2387751 B1 EP 2387751B1 EP 10724831 A EP10724831 A EP 10724831A EP 10724831 A EP10724831 A EP 10724831A EP 2387751 B1 EP2387751 B1 EP 2387751B1
Authority
EP
European Patent Office
Prior art keywords
copy
cascade
data
incremental
periodic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Not-in-force
Application number
EP10724831A
Other languages
German (de)
English (en)
Other versions
EP2387751A1 (fr
Inventor
Christopher Barry Beeken
Carlos Francisco Fuente
Colin Robert Jewell
William James Scales
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to EP10724831A priority Critical patent/EP2387751B1/fr
Publication of EP2387751A1 publication Critical patent/EP2387751A1/fr
Application granted granted Critical
Publication of EP2387751B1 publication Critical patent/EP2387751B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G06F11/1446—Point-in-time backing up or restoration of persistent data
    • G06F11/1458—Management of the backup or restore process
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G06F11/1446—Point-in-time backing up or restoration of persistent data
    • G06F11/1456—Hardware arrangements for backup
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G06F11/1446—Point-in-time backing up or restoration of persistent data
    • G06F11/1458—Management of the backup or restore process
    • G06F11/1466—Management of the backup or restore process to make the backup process non-disruptive
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/815—Virtual

Definitions

  • the present invention relates to the field of backing up of data in computer systems and more specifically to an apparatus and method for providing periodic data backups while reducing the risk of data corruption or loss.
  • FlashCopy is a function where a second image of 'some data' is made available. This function is sometimes known in other system contexts as Point-In-Time copy, or T 0 -copy. The second image's contents are initially identical to that of the first. The second image is made available 'instantly'. In practical terms this means that the second image is made available in much less time than would be required to create a true, separate, physical copy, and that this means that it can be established without unacceptable disruption to a using application's operation.
  • the second copy can be used for a number of purposes including performing backups, system trials, and data mining.
  • the first copy continues to be used for its original purpose by the original using application. Contrast this with backup without FlashCopy, where the application must be shut down, and the backup taken, before the application can be restarted again. It is becoming increasingly difficult to find time windows where an application is sufficiently idle to be shut down. The cost of taking a backup is increasing. There is thus significant and increasing business value in the ability of FlashCopy to allow backups to be taken without stopping the business.
  • FlashCopy implementations achieve the illusion of the existence of a second image by redirecting read I/O addressed to the second image (henceforth Target) to the original image (henceforth Source), unless that region (also known as a "grain") has been subject to a write.
  • a region has been the subject of a write (to either Source or Target)
  • a process is invoked which suspends the operation of the write command, and without it having taken effect, issues a read of the affected region from the Source, applies the read data to the Target with a write, then (and only if all steps were successful) releases the suspended write.
  • Subsequent writes to the same region do not need to be suspended since the Target will already have its own copy of the data.
  • This copy-on-write technique is well known and is used in many environments.
  • Some storage controllers allow a user to configure more than one target for a given source, also known as multiple target FlashCopy. This has a number of applications. For instance, different experiments could be run against each of the targets. Or the targets might be taken at different times (e.g. different days in the week), and allow historical access to the disk, perhaps for the purpose of recovering from some data corruption, such as might be caused by a virus.
  • multiple-target FlashCopy is cascaded FlashCopy.
  • Cascaded FlashCopy is disclosed in, for example, United States Patent Serial No 7,386,695 .
  • cascade implementations according to the disclosure of United States Patent Serial No 7,386,695 such as the multiple target FlashCopy facility available with the IBM SAN Volume Controller (SVC)
  • SVC IBM SAN Volume Controller
  • a write to the source disk for an area that has not yet been copied will result in the data being copied to just one of the target disks.
  • a read I/O request submitted to a target disk may require FlashCopy to read data from the source disk, the target disk or another target disk in the cascade depending on which source or target disks have previously been written to.
  • This solution gives the user an RPO for data loss equal to the time since the full copy was triggered.
  • the RPO for data corruption is equal to the time since the last space-efficient FlashCopy was taken. If the data is lost the production system cannot be recovered from the space-efficient copies because these copies are dependent on the production data. The user must go back to the full copy which must be complete. If the data is lost before the full copy is complete the production data cannot be recovered. This means that users are exposed to data loss whenever they retrigger their full copy.
  • Another approach is for the user to take a full incremental copy of the production data. Then at regular intervals take a space-efficient FlashCopy of the full copy target and then retrigger the full incremental copy. This means that the user will have more frequent copies that are independent of the production data once the full copy has completed. However, while full copy is not complete the space-efficient copies taken using FlashCopy are dependent on the production data, so the act of retriggering causes the user temporarily to lose some data protection.
  • a backup control apparatus for periodic data backup in a virtualized storage system having a point-in-time copy function operable to copy first data into a cascade and comprising: a storage targeting component for selecting a target virtual disk for one of a full copy or an incremental copy of said first data; a periodic backup component for triggering a periodic point-in-time copy of said first data to a virtual disk in said cascade; a testing component for testing a status of said full copy, said incremental copy and said periodic point-in-time copy; and a cascade splitting component responsive to said status for splitting said cascade to remove a dependency relationship of one or more of said full copy, said incremental copy and said periodic point-in-time copy on said first data.
  • said cascade splitting component is operable to selectively reattach said one or more of said full copy, said incremental copy and said periodic point-in-time copy at a different position in said cascade.
  • said cascade is controllable by means of a relocatable cascade disk mapping.
  • said point-in-time copy function comprises FlashCopy.
  • said relocatable cascade disk mapping comprises a FlashCopy Fdisk.
  • said one or more of said full copy, said incremental copy and said periodic point-in-time copy comprises a space-efficient copy.
  • a backup control method for periodic data backup in a virtualized storage system having a point-in-time copy function operable to copy first data into a cascade comprising steps of: selecting, by a storage targeting component, a target virtual disk for one of a full copy or an incremental copy of said first data; triggering, by a periodic backup component, a periodic point-in-time copy of said first data to a virtual disk in said cascade; testing, by a testing component, a status of said full copy, said incremental copy and said periodic point-in-time copy; and responsive to said status, splitting, by a cascade splitting component, said cascade to remove a dependency relationship of one or more of said full copy, said incremental copy and said periodic point-in-time copy on said first data.
  • said cascade splitting component is operable to selectively reattach said one or more of said full copy, said incremental copy and said periodic point-in-time copy at a different position in said cascade.
  • said cascade is controllable by means of a relocatable cascade disk mapping.
  • said point-in-time copy function comprises FlashCopy.
  • said relocatable cascade disk mapping comprises a FlashCopy Fdisk.
  • said one or more of said full copy, said incremental copy and said periodic point-in-time copy comprises a space-efficient copy.
  • a computer program comprising computer program code to, when loaded into a computer system and executed thereon, cause said computer system to perform the steps of a method according to the second aspect.
  • Preferred embodiments of the present invention thus advantageously provide an apparatus and method for providing storage-efficient periodic data backups while reducing the risk of data corruption or loss.
  • Figure 1a shows an arrangement of apparatus 100 suitable for the implementation of a data backup system according to a preferred embodiment of the invention and comprising:
  • Figure 1b shows an apparatus or arrangement of apparatus 1000 for data backup according to a preferred embodiment of the invention.
  • the apparatus is operable with a point-in-time copy function to copy production data 110 into a cascade 1004, and comprises a storage targeting component 1006 for selecting a target virtual disk for a full or incremental copy of the production data 110, and a periodic backup component 1008 for triggering a periodic point-in-time copy of the production data 110 to a virtual disk in the cascade 1004.
  • Apparatus 1000 also comprises a testing component 1010 for testing a status of the full copy, the incremental copy and the periodic point-in-time copy and a cascade splitting component 1012 responsive to the status for splitting the cascade 1004 to remove a dependency relationship of one or more of the full copy, the incremental copy and the periodic point-in-time copy on the production data 110.
  • the backup control apparatus 1000 is arranged such that the cascade splitting component 1008 is operable to selectively reattach the one or more of the full copy, the incremental copy and the periodic point-in-time copy at a different position in the cascade.
  • the backup control apparatus 1000 s arranged such that the full copy, the incremental copy and the periodic point-in-time copy may comprise space-efficient copies in which, although the target virtual disk is defined to the system (for example, to a host computer) as being of the same size as the source, it is in fact only as large as necessary to accommodate the actual data that has been written to the source disk, thus saving any space that would otherwise have been taken up with copies of the unwritten portions of the source disk.
  • step 200 the process begins at Start step 200.
  • step 202 the target space-efficient Vdisk is acquired by space-efficient storage 104 on command from FlashCopy control 106 as instructed by backup controller and test step 204 determines whether the full copy is complete. If the full copy is not complete step 208 begins the copy of the production data Vdisk to the new target disk and test step 210 determines whether the full copy has been started. If the determination at test step 210 is that the full copy has been started, the process waits for the specified period at step 214 before returning to step 202.
  • step 210 determines that the full copy has not been started, the incremental map is started at step 212 and the process waits for the specified period at step 214 before returning to step 202. If test step 204 determines that the full copy is complete, step 206 starts the copy of the target Vdisk of the full copy onto the new target Vdisk and then proceeds to start the incremental map at step 212. After starting the incremental map, the process waits for the specified period at step 214 before returning to step 202.
  • backup controller 108 When the incremental FlashCopy completes, backup controller 108 performs the further steps of the method as shown in Figure 3 .
  • step 302 the full copy is removed from the cascade by splitting the cascade, and test step determines whether the full copy is the latest copy. If the full copy is determined at test step 304 not to be the latest copy, step 308 starts the incremental map and the process exits at step 306. If the full copy is determined at test step 304 to be the latest copy, the process exits at step 306.
  • Splitting the cascade relies on a method for removing a map from a cascade by means of Fdisks.
  • An Fdisk which is a data structure internal to FlashCopy, is used to represent the source or target disk for a given FlashCopy mapping in the cascade.
  • the use of Fdisks enables FlashCopy mappings to be manipulated by allowing a Vdisk to be represented in multiple cascades or at multiple points in the same cascade by different Fdisks.
  • a first Fdisk will represent the VDisk that is being presented to the host and the other Fdisks will represent the VDisk required to maintain the cascade at other points.
  • the act of splitting the cascade means that, when the incremental map is retriggered, any maps downstream of the incremental map are attached to the secondary Fdisk and any Fdisks initially downstream of the secondary Fdisk are moved to the end of the cascade. This modification is possible in this case because any data on targets initially downstream of the primary Fdisk cannot be needed by the targets downstream of the secondary Fdisk.
  • Figure 4 Initially the arrangement of disks and contents is as shown in Figure 4 .
  • production data Vdisk 400 operatively connected for I/O redirection to production data primary Fdisk 402.
  • Production data primary Fdisk 402 is operatively connected for incremental mapping to full copy primary Fdisk 406, which in turn is operatively connected for I/O redirection to full copy Vdisk 404.
  • Full copy primary Fdisk 406 is operatively connected for backup to target 1 space-efficient primary Fdisk 410, which in turn is operatively connected for I/O redirection to target space-efficient Vdisk 408.
  • the production data is protected from corruption and data loss with RPO the start of backup 1.
  • the production data is protected from data corruption with RPO the start of backup 2.
  • the arrangement of disks and contents is as shown in Figure 8 , in which backup 1 and backup 2 are isolated from the production data and backup 3 relationship has been started.
  • the production data is protected from corruption and data loss with RPO the start of the backup 2.
  • this method allows backups (and in particular, space-efficient backups) to be collected that protect the production data from data loss and data corruption. These copies subsequently maintain this level of protection. It will be clear to one of ordinary skill in the art that, because of the removal of dependencies as described herein, the user can conveniently remove copies that are no longer needed, and that the production data can be recovered from any backup copy.
  • Embodiments of the invention thus provide an apparatus and method for providing periodic data backups while reducing the risk of data corruption or loss.
  • all or part of the method of the preferred embodiments of the present invention may suitably and usefully be embodied in a logic apparatus, or a plurality of logic apparatus, comprising logic elements arranged to perform the steps of the method and that such logic elements may comprise hardware components, firmware components or a combination thereof.
  • a logic arrangement may suitably be embodied in a logic apparatus comprising logic elements to perform the steps of the method, and that such logic elements may comprise components such as logic gates in, for example a programmable logic array or application-specific integrated circuit.
  • Such a logic arrangement may further be embodied in enabling elements for temporarily or permanently establishing logic structures in such an array or circuit using, for example, a virtual hardware descriptor language, which may be stored and transmitted using fixed or transmittable carrier media.
  • a method is generally conceived to be a self-consistent sequence of steps leading to a desired result. These steps require physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It is convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, parameters, items, elements, objects, symbols, characters, terms, numbers, or the like. It should be noted, however, that all of these terms and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities.
  • the present invention may further suitably be embodied as a computer program product for use with a computer system.
  • Such an implementation may comprise a series of computer-readable instructions either fixed on a tangible medium, such as a computer readable medium, for example, diskette, CD-ROM, ROM, or hard disk, or transmittable to a computer system, via a modem or other interface device, over either a tangible medium, including but not limited to optical or analogue communications lines, or intangibly using wireless techniques, including but not limited to microwave, infrared or other transmission techniques.
  • the series of computer readable instructions embodies all or part of the functionality previously described herein.
  • Such computer readable instructions can be written in a number of programming languages for use with many computer architectures or operating systems. Further, such instructions may be stored using any memory technology, present or future, including but not limited to, semiconductor, magnetic, or optical, or transmitted using any communications technology, present or future, including but not limited to optical, infrared, or microwave. It is contemplated that such a computer program product may be distributed as a removable medium with accompanying printed or electronic documentation, for example, shrink-wrapped software, pre-loaded with a computer system, for example, on a system ROM or fixed disk, or distributed from a server or electronic bulletin board over a network, for example, the Internet or World Wide Web.
  • the preferred embodiment of the present invention may be realized in the form of a computer implemented method of deploying a service comprising steps of deploying computer program code operable to, when deployed into a computer infrastructure and executed thereon, cause said computer system to perform all the steps of the method.
  • the preferred embodiment of the present invention may be realized in the form of a data carrier having functional data thereon, said functional data comprising functional computer data structures to, when loaded into a computer system and operated upon thereby, enable said computer system to perform all the steps of the method.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)

Claims (13)

  1. Dispositif de commande de sauvegarde (1000) pour une sauvegarde périodique de données dans un système de mémoire virtualisé ayant une fonction de copie instantanée apte à copier des premières données en cascade (1004), le dispositif comprenant :
    un composant cible de mémoire (1006) pour la sélection d'un disque cible virtuel pour une copie complète ou une copie incrémentale desdites premières données ;
    un composant d'écriture de mémoire pour effectuer ladite copie complète ou ladite copie incrémentale desdites premières données sur ledit disque cible Virtuel ;
    un composant de sauvegarde périodique (1008) pour déclencher une copie instantanée périodique desdites premières données sur un autre disque virtuel dans ladite cascade (1004) ;
    un composant de détermination (1010) pour déterminer un statut « lancé », « achevé » ou « le plus récent » de la copie complète, de la copie incrémentale et de la copie instantanée ; et
    un composant de partage (1012) qui réagit audit statut « lancé », « achevé » ou « le plus récent » pour partager ladite cascade (1004) afin de supprimer une relation de dépendance entre une ou plusieurs desdites copies complètes ou desdites copies incrémentales ou desdites copies périodiques instantanées et desdites premières données.
  2. Dispositif de commande de sauvegarde selon la revendication 1, dans lequel le dit composant de partage de cascade est apte à rattacher sélectivement une ou plusieurs desdites copies complètes, desdites copies incrémentales et desdites copies périodiques instantanées à une position différente dans ladite cascade.
  3. Dispositif de commande de sauvegarde selon la revendication 1 ou la revendication 2, dans lequel ladite cascade est commandable au moyen d'un mappage de disque en cascade translatable.
  4. Dispositif de commande de sauvegarde selon l'une quelconque des revendications précédentes, dans lequel ladite fonction de copie instantanée comprend FlashCopy.
  5. Dispositif de commande de sauvegarde selon la revendication 4, dans lequel ledit mappage de disque en cascade translatable comprend FlashCopFdisk.
  6. Dispositif de commande de sauvegarde selon l'une quelconque des revendications précédentes, dans lequel une ou plusieurs desdites copies complètes ou desdites copies incrémentales ou desdites copies périodiques instantanées comprennent une copie économisant l'espace.
  7. Procédé de commande de sauvegarde pour une sauvegarde périodique de données dans un système de mémoire virtualisé ayant une fonction de copie instantanée apte à copier des premières données en cascade (1004) et comprenant les étapes suivantes :
    sélection, avec un composant cible de mémoire (1006), d'un disque cible virtuel pour une copie complète ou une copie incrémentale desdites premières données ;
    réalisation de ladite copie complète ou de ladite copie incrémentale de desdites premières données sur ledit disque cible virtuel par un composant d'écriture de mémoire;
    déclenchement par un composant de sauvegarde périodique (1008) d'une copie instantanée périodique desdites premières données sur un autre disque virtuel en dite cascade (1004) ;
    détermination par un composant de détermination (1010) d'un statut « lancé », « achevé » ou « le plus récent » de ladite copie complète, de ladite copie incrémentale et de ladite copie périodique instantanée ; et
    partage de ladite cascade (1004) par un composant de partage de cascade (1012), en réponse audit statut « lancé », « achevé » ou « le plus récent » pour supprimer une relation de dépendance entre une ou plusieurs desdites copies complètes ou desdites copies incrémentales ou desdites copies périodiques instantanées et lesdites premières données.
  8. Procédé de commande de sauvegarde selon la revendication 7, dans lequel ledit composant de partage en cascade est apte à rattacher sélectivement une ou plusieurs desdites copies complètes ou desdites copies incrémentales ou desdites copies périodiques instantanées à une position différente dans ladite cascade.
  9. Procédé de commande de sauvegarde selon la revendication 7 ou la revendication 8, dans lequel ladite cascade est commandable au moyen d'un mappage de disque en cascade translatable.
  10. Procédé de commande de sauvegarde, selon l'une quelconque des revendications 7 à 9, dans lequel ladite fonction de copie instantanée comprend FlashCopy.
  11. Procédé de commande de sauvegarde, selon la revendication 9, dans lequel ledit mappage de disque en cascade translatable comprend Fdisk FlashCopy.
  12. Procédé de commande de sauvegarde selon l'une quelconque des revendications 7 à 11, dans lequel une ou plusieurs desdites copies complètes ou desdites copies incrémentales ou desdites copies périodiques instantanées comprennent une copie économisant l'espace.
  13. Programme informatique comprenant un code de programme informatique au chargement et à l'exécution dans un système informatique qui amène ledit ordinateur à exécuter chacune des étapes d'un procédé selon l'une quelconque des revendications 7 à 12.
EP10724831A 2009-06-15 2010-06-09 Appareil et procédé de sauvegarde de données Not-in-force EP2387751B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP10724831A EP2387751B1 (fr) 2009-06-15 2010-06-09 Appareil et procédé de sauvegarde de données

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP09162728 2009-06-15
EP10724831A EP2387751B1 (fr) 2009-06-15 2010-06-09 Appareil et procédé de sauvegarde de données
PCT/EP2010/058046 WO2010145973A1 (fr) 2009-06-15 2010-06-09 Appareil et procédé de sauvegarde de données

Publications (2)

Publication Number Publication Date
EP2387751A1 EP2387751A1 (fr) 2011-11-23
EP2387751B1 true EP2387751B1 (fr) 2012-05-09

Family

ID=42563043

Family Applications (1)

Application Number Title Priority Date Filing Date
EP10724831A Not-in-force EP2387751B1 (fr) 2009-06-15 2010-06-09 Appareil et procédé de sauvegarde de données

Country Status (6)

Country Link
US (2) US8468316B2 (fr)
EP (1) EP2387751B1 (fr)
JP (1) JP5656984B2 (fr)
CN (1) CN102341785A (fr)
AT (1) ATE557346T1 (fr)
WO (1) WO2010145973A1 (fr)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8230185B2 (en) 2008-10-08 2012-07-24 International Business Machines Corporation Method for optimizing cleaning of maps in FlashCopy cascades containing incremental maps
US8285679B2 (en) 2010-03-11 2012-10-09 International Business Machines Corporation Creating a buffer point-in-time copy relationship for a point-in-time copy function executed to create a point-in-time copy relationship
US10114701B2 (en) 2011-01-28 2018-10-30 International Business Machines Corporation Space efficient cascading point in time copying
US9047233B2 (en) 2012-06-25 2015-06-02 International Business Machines Corporation Source cleaning cascaded volumes using write and background copy indicators
US9037819B2 (en) 2012-06-25 2015-05-19 Inernational Business Machines Corporation Source cleaning cascaded volumes using reference counts
CN103577297B (zh) * 2012-07-26 2016-07-06 阿里巴巴集团控股有限公司 一种自动搜索方法和设备
US9417815B1 (en) 2013-06-21 2016-08-16 Amazon Technologies, Inc. Capturing snapshots of storage volumes
US9501379B2 (en) * 2014-04-11 2016-11-22 Nutanix, Inc. Mechanism for providing real time replication status information in a networked virtualization environment for storage management
US10007602B2 (en) * 2014-05-06 2018-06-26 International Business Machines Corporation Flash copy relationship management
US10108352B2 (en) 2015-03-03 2018-10-23 International Business Machines Corporation Incremental replication of a source data set
US10078555B1 (en) 2015-04-14 2018-09-18 EMC IP Holding Company LLC Synthetic full backups for incremental file backups
US9996429B1 (en) 2015-04-14 2018-06-12 EMC IP Holding Company LLC Mountable container backups for files
US9946603B1 (en) * 2015-04-14 2018-04-17 EMC IP Holding Company LLC Mountable container for incremental file backups
CN105893186A (zh) * 2016-04-01 2016-08-24 浪潮电子信息产业股份有限公司 一种存储容灾数据的验证方法、装置及系统
US10416922B1 (en) * 2017-04-28 2019-09-17 EMC IP Holding Company LLC Block-based backups for large-scale volumes and advanced file type devices
US10409521B1 (en) * 2017-04-28 2019-09-10 EMC IP Holding Company LLC Block-based backups for large-scale volumes
CN109408278B (zh) * 2017-08-15 2021-06-15 李剑春 数据处理方法及装置
US11032156B1 (en) 2019-03-29 2021-06-08 Amazon Technologies, Inc. Crash-consistent multi-volume backup generation

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3019A (en) * 1843-03-30 Hatching chickens
US6020A (en) * 1849-01-09 Improvement in plows
US6820180B2 (en) * 2002-04-04 2004-11-16 International Business Machines Corporation Apparatus and method of cascading backup logical volume mirrors
US6957362B2 (en) * 2002-08-06 2005-10-18 Emc Corporation Instantaneous restoration of a production copy from a snapshot copy in a data storage system
JP2004258944A (ja) * 2003-02-26 2004-09-16 Hitachi Ltd ストレージ装置およびその管理方法
US20060080362A1 (en) * 2004-10-12 2006-04-13 Lefthand Networks, Inc. Data Synchronization Over a Computer Network
GB0428108D0 (en) * 2004-12-23 2005-01-26 Ibm Storage system with multiple copy targeting
GB0504390D0 (en) * 2005-03-02 2005-04-06 Ibm Storage system with cascaded copy targeting and enhanced integrity
US8195620B2 (en) * 2007-10-19 2012-06-05 International Business Machines Corporation Storage system with improved multiple copy targeting
US8051259B2 (en) * 2008-06-23 2011-11-01 International Business Machines Corporation Space efficient de-allocation for cascade/multiple target flash copy cleaning
US8959300B2 (en) * 2010-05-18 2015-02-17 International Business Machines Corporation Cascade ordering

Also Published As

Publication number Publication date
JP2012530286A (ja) 2012-11-29
US20120221815A1 (en) 2012-08-30
EP2387751A1 (fr) 2011-11-23
WO2010145973A1 (fr) 2010-12-23
US20100318757A1 (en) 2010-12-16
CN102341785A (zh) 2012-02-01
US8468316B2 (en) 2013-06-18
ATE557346T1 (de) 2012-05-15
US8464010B2 (en) 2013-06-11
JP5656984B2 (ja) 2015-01-21

Similar Documents

Publication Publication Date Title
EP2387751B1 (fr) Appareil et procédé de sauvegarde de données
US10140039B1 (en) I/O alignment for continuous replication in a storage system
EP2731013B1 (fr) Procédé de sauvegarde, dispositif et système de machine virtuelle
US7386695B2 (en) Storage system with multiple copy targeting
EP1907935B1 (fr) Systeme et procede pour la virtualisation d'images de sauvegarde
US10168908B2 (en) Method and system for cascaded flashcopy zoning and algorithm and/or computer program code and method implementing the same
EP2893471B1 (fr) Techniques de récupération d'une machine virtuelle
EP2755141B1 (fr) Système de gestion de fichier et procédé de gestion de fichier
EP2539804B1 (fr) Systèmes et procédés pour permettre à des cibles de duplication de réclamer un espace de stockage inutilisé sur des systèmes de stockage à attribution à la demande
JP2016115220A (ja) ストレージシステム、ストレージ管理装置、ストレージ管理方法およびストレージ管理プログラム
US8555009B1 (en) Method and apparatus for enabling and managing application input/output activity while restoring a data store
WO2011147715A1 (fr) Processus de sauvegarde en cascade multiple
US8655852B2 (en) Storage system with improved multiple copy targeting
US20120260051A1 (en) Computer system, management system and data management method
EP2836900B1 (fr) Création de volumes de mémorisation chiffrés
US20140337594A1 (en) Systems and methods for collapsing a derivative version of a primary storage volume
US10705756B2 (en) Agent aware selective backup of a virtual machine using virtual I/O filter snapshots
US20100049823A1 (en) Initial copyless remote copy
JP5284604B2 (ja) 過渡状態情報を格納するための方法、システムおよびコンピュータ・プログラム
US20130024726A1 (en) System and method for removable network attached storage enabling system recovery from backup
US8769334B1 (en) Techniques for providing instant disaster recovery
US20150378836A1 (en) Data Backup Recovery
US20150089118A1 (en) Methods, systems, and computer readable media for partition and cache restore
CN107209727B (zh) 存储系统

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20110815

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

DAX Request for extension of the european patent (deleted)
AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: AT

Ref legal event code: REF

Ref document number: 557346

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120515

REG Reference to a national code

Ref country code: CH

Ref legal event code: NV

Representative=s name: IBM RESEARCH GMBH ZURICH RESEARCH LABORATORY INTEL

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602010001515

Country of ref document: DE

Effective date: 20120705

REG Reference to a national code

Ref country code: GB

Ref legal event code: 746

Effective date: 20120702

REG Reference to a national code

Ref country code: DE

Ref legal event code: R084

Ref document number: 602010001515

Country of ref document: DE

Effective date: 20120606

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20120509

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

Effective date: 20120509

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120809

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120909

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 557346

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120509

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120810

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120910

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20120630

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20130228

26N No opposition filed

Effective date: 20130212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20120709

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20120609

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602010001515

Country of ref document: DE

Effective date: 20130212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120809

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120820

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120509

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20120609

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100609

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140630

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140630

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20170629

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20180601

Year of fee payment: 9

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20180609

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180609

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602010001515

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200101