Virtual machine joining or separating

Information

  • Patent Grant
  • 10235196
  • Patent Number
    10,235,196
  • Date Filed
    Monday, December 28, 2015
    8 years ago
  • Date Issued
    Tuesday, March 19, 2019
    5 years ago
Abstract
In one aspect, a method includes separating a set of virtual machines from a first consistency group to a second consistency group and third consistency group. The method also includes combining a first virtual machine of the second consistency group to the third consistency group to form a fourth consistency group.
Description
BACKGROUND

Computer data is vital to today's organizations and a significant part of protection against disasters is focused on data protection. As solid-state memory has advanced to the point where cost of memory has become a relatively insignificant factor, organizations can afford to operate with systems that store and process terabytes of data.


Conventional data protection systems include tape backup drives, for storing organizational production site data on a periodic basis. Another conventional data protection system uses data replication, by creating a copy of production site data of an organization on a secondary backup storage system, and updating the backup with changes. The backup storage system may be situated in the same physical location as the production storage system, or in a physically remote location. Data replication systems generally operate either at the application level, at the file system level, or at the data block level.


SUMMARY

In one aspect, a method includes separating a set of virtual machines from a first consistency group to a second consistency group and third consistency group. The method also includes combining a first virtual machine of the second consistency group to the third consistency group to form a fourth consistency group.


In another aspect, an apparatus includes electronic hardware circuitry configured to separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group and combine a first virtual machine of the second consistency group to the third consistency group to form a fourth consistency group.


In a further aspect, an article includes a non-transitory computer-readable medium that stores computer-executable instructions. The instructions cause a machine to separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group and combine a first virtual machine of the second consistency group to the third consistency group to form a fourth consistency group.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of an example of a data protection system.



FIG. 2 is an illustration of an example of a journal history of write transactions for a storage system.



FIG. 3 is a block diagram of an example of separating a virtual machine into a separate consistency group, according to one embodiment of the disclosure.



FIG. 4 is a flowchart of an example of a process to separate a virtual machine into a separate consistency group, according to one embodiment of the disclosure.



FIG. 5 is a block diagram of an example of joining consistency groups, according to one embodiment of the disclosure.



FIG. 6 is a flowchart of an example of a process to join consistency groups, according to one embodiment of the disclosure.



FIG. 7 is a computer on which any of the processes of FIGS. 4 and 6 may be implemented, according to one embodiment of the disclosure.





DETAILED DESCRIPTION

Described herein are techniques to unify multiple consistency groups (CGs) into a single CG and to separate a CG into more than one CG.


The following definition may be useful in understanding the specification and claims.


I/O REQUEST—an input/output request (sometimes referred to as an I/O), which may be a read I/O request (sometimes referred to as a read request or a read) or a write I/O request (sometimes referred to as a write request or a write);


A description of journaling and some techniques associated with journaling may be described in the patent titled “METHODS AND APPARATUS FOR OPTIMAL JOURNALING FOR CONTINUOUS DATA REPLICATION” and with U.S. Pat. No. 7,516,287, which is hereby incorporated by reference.


Referring to FIG. 1, a data protection system 100 includes two sites; Site I, which is a production site, and Site II, which is a backup site or replica site. Under normal operation the production site is the source side of system 100, and the backup site is the target side of the system. The backup site is responsible for replicating production site data. Additionally, the backup site enables roll back of Site I data to an earlier pointing time, which may be used in the event of data corruption of a disaster, or alternatively in order to view or to access data from an earlier point in time.



FIG. 1 is an overview of a system for data replication of either physical or virtual logical units. Thus, one of ordinary skill in the art would appreciate that in a virtual environment a hypervisor, in one example, would consume logical units, generate a distributed file system on them (such as, for example, VMWARE® VMFS® creates files in the file system) and exposes the files as logical units to the virtual machines (e.g., each VMDK is seen as a SCSI device by virtual hosts). In another example, the hypervisor consumes a network based file system and exposes files in the NFS as SCSI devices to virtual hosts.


During normal operations, the direction of replicate data flow goes from source side to target side. It is possible, however, for a user to reverse the direction of replicate data flow, in which case Site I starts to behave as a target backup site, and Site II starts to behave as a source production site. Such change of replication direction is referred to as a “failover”. A failover may be performed in the event of a disaster at the production site, or for other reasons. In some data architectures, Site I or Site II behaves as a production site for a portion of stored data, and behaves simultaneously as a backup site for another portion of stored data. In some data architectures, a portion of stored data is replicated to a backup site, and another portion is not.


The production site and the backup site may be remote from one another, or they may both be situated at a common site, local to one another. Local data protection has the advantage of minimizing data lag between target and source, and remote data protection has the advantage is being robust in the event that a disaster occurs at the source side.


The source and target sides communicate via a wide area network (WAN) 128, although other types of networks may be used.


Each side of system 100 includes three major components coupled via a storage area network (SAN); namely, (i) a storage system, (ii) a host computer, and (iii) a data protection appliance (DPA). Specifically with reference to FIG. 1, the source side SAN includes a source host computer 104, a source storage system 108, and a source DPA 112. Similarly, the target side SAN includes a target host computer 116, a target storage system 120, and a target DPA 124. As well, the protection agent (sometimes referred to as a splitter) may run on the host, or on the storage, or in the network or at a hypervisor level, and that DPAs are optional and DPA code may run on the storage array too, or the DPA 124 may run as a virtual machine.


Generally, a SAN includes one or more devices, referred to as “nodes”. A node in a SAN may be an “initiator” or a “target”, or both. An initiator node is a device that is able to initiate requests to one or more other devices; and a target node is a device that is able to reply to requests, such as SCSI commands, sent by an initiator node. A SAN may also include network switches, such as fiber channel switches. The communication links between each host computer and its corresponding storage system may be any appropriate medium suitable for data transfer, such as fiber communication channel links.


The host communicates with its corresponding storage system using small computer system interface (SCSI) commands.


System 100 includes source storage system 108 and target storage system 120. Each storage system includes physical storage units for storing data, such as disks or arrays of disks. Typically, storage systems 108 and 120 are target nodes. In order to enable initiators to send requests to storage system 108, storage system 108 exposes one or more logical units (LU) to which commands are issued. Thus, storage systems 108 and 120 are SAN entities that provide multiple logical units for access by multiple SAN initiators.


Logical units are a logical entity provided by a storage system, for accessing data stored in the storage system. The logical unit may be a physical logical unit or a virtual logical unit. A logical unit is identified by a unique logical unit number (LUN). Storage system 108 exposes a logical unit 136, designated as LU A, and storage system 120 exposes a logical unit 156, designated as LU B.


LU B is used for replicating LU A. As such, LU B is generated as a copy of LU A. In one embodiment, LU B is configured so that its size is identical to the size of LU A. Thus, for LU A, storage system 120 serves as a backup for source side storage system 108. Alternatively, as mentioned hereinabove, some logical units of storage system 120 may be used to back up logical units of storage system 108, and other logical units of storage system 120 may be used for other purposes. Moreover, there is symmetric replication whereby some logical units of storage system 108 are used for replicating logical units of storage system 120, and other logical units of storage system 120 are used for replicating other logical units of storage system 108.


System 100 includes a source side host computer 104 and a target side host computer 116. A host computer may be one computer, or a plurality of computers, or a network of distributed computers, each computer may include inter alia a conventional CPU, volatile and non-volatile memory, a data bus, an I/O interface, a display interface and a network interface. Generally a host computer runs at least one data processing application, such as a database application and an e-mail server.


Generally, an operating system of a host computer creates a host device for each logical unit exposed by a storage system in the host computer SAN. A host device is a logical entity in a host computer, through which a host computer may access a logical unit. Host device 104 identifies LU A and generates a corresponding host device 140, designated as Device A, through which it can access LU A. Similarly, host computer 116 identifies LU B and generates a corresponding device 160, designated as Device B.


In the course of continuous operation, host computer 104 is a SAN initiator that issues I/O requests (write/read operations) through host device 140 to LU A using, for example, SCSI commands. Such requests are generally transmitted to LU A with an address that includes a specific device identifier, an offset within the device, and a data size. Offsets are generally aligned to 512 byte blocks. The average size of a write operation issued by host computer 104 may be, for example, 10 kilobytes (KB); i.e., 20 blocks. For an I/O rate of 50 megabytes (MB) per second, this corresponds to approximately 5,000 write transactions per second.


System 100 includes two data protection appliances, a source side DPA 112 and a target side DPA 124. A DPA performs various data protection services, such as data replication of a storage system, and journaling of I/O requests issued by a host computer to source side storage system data. As explained in detail herein, when acting as a target side DPA, a DPA may also enable roll back of data to an earlier point in time, and processing of rolled back data at the target site. Each DPA 112 and 124 is a computer that includes inter alia one or more conventional CPUs and internal memory.


For additional safety precaution, each DPA is a cluster of such computers. Use of a cluster ensures that if a DPA computer is down, then the DPA functionality switches over to another computer. The DPA computers within a DPA cluster communicate with one another using at least one communication link suitable for data transfer via fiber channel or IP based protocols, or such other transfer protocol. One computer from the DPA cluster serves as the DPA leader. The DPA cluster leader coordinates between the computers in the cluster, and may also perform other tasks that require coordination between the computers, such as load balancing.


In the architecture illustrated in FIG. 1, DPA 112 and DPA 124 are standalone devices integrated within a SAN. Alternatively, each of DPA 112 and DPA 124 may be integrated into storage system 108 and storage system 120, respectively, or integrated into host computer 104 and host computer 116, respectively. Both DPAs communicate with their respective host computers through communication lines such as fiber channels using, for example, SCSI commands or any other protocol.


DPAs 112 and 124 are configured to act as initiators in the SAN; i.e., they can issue I/O requests using, for example, SCSI commands, to access logical units on their respective storage systems. DPA 112 and DPA 124 are also configured with the necessary functionality to act as targets; i.e., to reply to I/O requests, such as SCSI commands, issued by other initiators in the SAN, including inter alia their respective host computers 104 and 116. Being target nodes, DPA 112 and DPA 124 may dynamically expose or remove one or more logical units.


As described hereinabove, Site I and Site II may each behave simultaneously as a production site and a backup site for different logical units. As such, DPA 112 and DPA 124 may each behave as a source DPA for some logical units, and as a target DPA for other logical units, at the same time.


Host computer 104 and host computer 116 include protection agents 144 and 164, respectively. Protection agents 144 and 164 intercept SCSI commands issued by their respective host computers, via host devices to logical units that are accessible to the host computers. A data protection agent may act on an intercepted SCSI commands issued to a logical unit, in one of the following ways: send the SCSI commands to its intended logical unit; redirect the SCSI command to another logical unit; split the SCSI command by sending it first to the respective DPA; after the DPA returns an acknowledgement, send the SCSI command to its intended logical unit; fail a SCSI command by returning an error return code; and delay a SCSI command by not returning an acknowledgement to the respective host computer.


A protection agent may handle different SCSI commands, differently, according to the type of the command. For example, a SCSI command inquiring about the size of a certain logical unit may be sent directly to that logical unit, while a SCSI write command may be split and sent first to a DPA associated with the agent. A protection agent may also change its behavior for handling SCSI commands, for example as a result of an instruction received from the DPA.


Specifically, the behavior of a protection agent for a certain host device generally corresponds to the behavior of its associated DPA with respect to the logical unit of the host device. When a DPA behaves as a source site DPA for a certain logical unit, then during normal course of operation, the associated protection agent splits I/O requests issued by a host computer to the host device corresponding to that logical unit. Similarly, when a DPA behaves as a target device for a certain logical unit, then during normal course of operation, the associated protection agent fails I/O requests issued by host computer to the host device corresponding to that logical unit.


Communication between protection agents and their respective DPAs may use any protocol suitable for data transfer within a SAN, such as fiber channel, or SCSI over fiber channel. The communication may be direct, or via a logical unit exposed by the DPA. Protection agents communicate with their respective DPAs by sending SCSI commands over fiber channel.


Protection agents 144 and 164 are drivers located in their respective host computers 104 and 116. Alternatively, a protection agent may also be located in a fiber channel switch, or in any other device situated in a data path between a host computer and a storage system or on the storage system itself. In a virtualized environment, the protection agent may run at the hypervisor layer or in a virtual machine providing a virtualization layer.


What follows is a detailed description of system behavior under normal production mode, and under recovery mode.


In production mode DPA 112 acts as a source site DPA for LU A. Thus, protection agent 144 is configured to act as a source side protection agent; i.e., as a splitter for host device A. Specifically, protection agent 144 replicates SCSI I/O write requests. A replicated SCSI I/O write request is sent to DPA 112. After receiving an acknowledgement from DPA 124, protection agent 144 then sends the SCSI I/O write request to LU A. After receiving a second acknowledgement from storage system 108 host computer 104 acknowledges that an I/O command complete.


When DPA 112 receives a replicated SCSI write request from data protection agent 144, DPA 112 transmits certain I/O information characterizing the write request, packaged as a “write transaction”, over WAN 128 to DPA 124 on the target side, for journaling and for incorporation within target storage system 120.


DPA 112 may send its write transactions to DPA 124 using a variety of modes of transmission, including inter alia (i) a synchronous mode, (ii) an asynchronous mode, and (iii) a snapshot mode. In synchronous mode, DPA 112 sends each write transaction to DPA 124, receives back an acknowledgement from DPA 124, and in turns sends an acknowledgement back to protection agent 144. Protection agent 144 waits until receipt of such acknowledgement before sending the SCSI write request to LU A.


In asynchronous mode, DPA 112 sends an acknowledgement to protection agent 144 upon receipt of each I/O request, before receiving an acknowledgement back from DPA 124.


In snapshot mode, DPA 112 receives several I/O requests and combines them into an aggregate “snapshot” of all write activity performed in the multiple I/O requests, and sends the snapshot to DPA 124, for journaling and for incorporation in target storage system 120. In snapshot mode DPA 112 also sends an acknowledgement to protection agent 144 upon receipt of each I/O request, before receiving an acknowledgement back from DPA 124.


For the sake of clarity, the ensuing discussion assumes that information is transmitted at write-by-write granularity.


While in production mode, DPA 124 receives replicated data of LU A from DPA 112, and performs journaling and writing to storage system 120. When applying write operations to storage system 120, DPA 124 acts as an initiator, and sends SCSI commands to LU B.


During a recovery mode, DPA 124 undoes the write transactions in the journal, so as to restore storage system 120 to the state it was at, at an earlier time.


As described hereinabove, LU B is used as a backup of LU A. As such, during normal production mode, while data written to LU A by host computer 104 is replicated from LU A to LU B, host computer 116 should not be sending I/O requests to LU B. To prevent such I/O requests from being sent, protection agent 164 acts as a target site protection agent for host Device B and fails I/O requests sent from host computer 116 to LU B through host Device B.


Target storage system 120 exposes a logical unit 176, referred to as a “journal LU”, for maintaining a history of write transactions made to LU B, referred to as a “journal”. Alternatively, journal LU 176 may be striped over several logical units, or may reside within all of or a portion of another logical unit. DPA 124 includes a journal processor 180 for managing the journal.


Journal processor 180 functions generally to manage the journal entries of LU B. Specifically, journal processor 180 enters write transactions received by DPA 124 from DPA 112 into the journal, by writing them into the journal LU, reads the undo information for the transaction from LU B. updates the journal entries in the journal LU with undo information, applies the journal transactions to LU B, and removes already-applied transactions from the journal.


Referring to FIG. 2, which is an illustration of a write transaction 200 for a journal. The journal may be used to provide an adaptor for access to storage 120 at the state it was in at any specified point in time. Since the journal contains the “undo” information necessary to roll back storage system 120, data that was stored in specific memory locations at the specified point in time may be obtained by undoing write transactions that occurred subsequent to such point in time.


Write transaction 200 generally includes the following fields: one or more identifiers; a time stamp, which is the date & time at which the transaction was received by source side DPA 112; a write size, which is the size of the data block; a location in journal LU 176 where the data is entered; a location in LU B where the data is to be written; and the data itself.


Write transaction 200 is transmitted from source side DPA 112 to target side DPA 124. As shown in FIG. 2, DPA 124 records the write transaction 200 in the journal that includes four streams. A first stream, referred to as a DO stream, includes new data for writing in LU B. A second stream, referred to as an DO METADATA stream, includes metadata for the write transaction, such as an identifier, a date & time, a write size, a beginning address in LU B for writing the new data in, and a pointer to the offset in the DO stream where the corresponding data is located. Similarly, a third stream, referred to as an UNDO stream, includes old data that was overwritten in LU B; and a fourth stream, referred to as an UNDO METADATA, include an identifier, a date & time, a write size, a beginning address in LU B where data was to be overwritten, and a pointer to the offset in the UNDO stream where the corresponding old data is located.


In practice each of the four streams holds a plurality of write transaction data. As write transactions are received dynamically by target DPA 124, they are recorded at the end of the DO stream and the end of the DO METADATA stream, prior to committing the transaction. During transaction application, when the various write transactions are applied to LU B, prior to writing the new DO data into addresses within the storage system, the older data currently located in such addresses is recorded into the UNDO stream. In some examples, the metadata stream (e.g., UNDO METADATA stream or the DO METADATA stream) and the data stream (e.g., UNDO stream or DO stream) may be kept in a single stream each (i.e., one UNDO data and UNDO METADATA stream and one DO data and DO METADATA stream) by interleaving the metadata into the data stream.


In some embodiments, a consistency group (CG) may be a set of logical units (LUs) or virtual machines which are replicated together for which write order fidelity is preserved.


A CG construct take significant amount of resources from the system, and thus the amount of CGs the system can run is limited. Hence, it is resource prohibitive to generate a CG construct for every virtual machine replicated in some cases. In response to these constraints multiple unrelated virtual machines or LUs are grouped in a single CG. On the other hand, a CG also has limited performance and thus if the CG includes entities which have too high of a performance requirement, it may be better to separate the CG into several CG constructs. Thus, it is desirable to unify multiple CGs into a single CG and be able to separate CG into more than one CG.


A new virtual CG may be formed which may include several internal CGs. The virtual CG may be presented to the user and the user may be able to perform all actions on the virtual CG. Internally, in some examples, each internal CG may replicate just some of the stripes of the volumes. As well as consistency point may be achieved across internal CGs. That is, it may be possible to form an image of a particular time by rolling each internal CG group to that time. In some examples, the internal CGs may not be exposed to the user and all actions happen automatically on the internal CGs when performed on the virtual CG. Internal CG groups may also be referred to as Grid Copies. In a further example, one box may be accepting all the I/Os, this box will split the I/Os between relevant boxes running the consistency groups. In one example, each grid CG may receive its own IOs.


In cloud platforms, using the processes described in FIGS. 1 and 2, data protection system 100 faces a number of challenges and biggest among them are scalability issues. One way to solve such issues is the ability to unify or separate the data processing according to the needs of the system or a user.


For example, suppose a user tries to replicate 1000 low traffic virtual machines (VMs). In current system architecture the only choices for system configuration are: 1. define a separate consistency group (CG) for each VM; or 2. put a number of VMs in the same CG and make less CGs.


The first configuration will use a lot of resources in the replication process. For example, each group will require separate journal space, separate memory reservations. In practice, the system will reach its memory, CPU and disk space limits despite the fact that traffic is low.


The second configuration has two major problems. In the first problem, operations “Test copy”, “Failover” and “Recover production” can be done for a CG only so that if one VM has a data corruption on production site the problem cannot be fixed without destroying the production copy for other VMs. In the second problem, if a VM in CG has a traffic peak the CG will enter a high load state and replication from all VMs in the CG will be stopped.


The solution of the problem involves keeping a number of VMs in one CG until a problem occurs and then separate out the VM into a new CG. When the problems pass merging the VM back into the old CG. Techniques to accomplish these objectives are further described herein.


Referring to FIG. 3, a diagram 300 is an example of separating a virtual machine into a separate consistency group, according to one embodiment of the disclosure. In this example, a consistency group CG1 includes a first virtual machine VM1, a second virtual machine VM2, a third virtual machine VM3 and a fourth virtual machine VM4. VM4 needs to be separated from CG1 due to performance issues such high IOPS (Input/Output Operations Per Second), for example. Thus, a consistency group CG2 is formed with VM4.



FIG. 4 is a flowchart of an example of a process to separate a virtual machine into a separate consistency group as shown in FIG. 3, according to one embodiment of the disclosure. For example, process 400 splits a consistency group, CG2 having a first virtual machine (VM1), a second virtual machine (VM2), a third virtual machine (VM3) and a fourth virtual machine (VM4) and forms two new consistency group, CG2 for VM4 and CG3 for VM1, VM2 and VM3.


Process 400 generates a new DO METADATA stream for CG2 (402) and generates a new DO stream for CG2 (404). Process 400 generates a new DO METADATA stream for CG3 (406) and generates a new DO stream for CG3 (408).


Process 400 pauses distribution (410). For example, no data is read from a DO streams and moved to an UNDO stream.


Process 400 writes new data arriving to CG2 to its DO stream and the corresponding metadata to its DO METADATA stream (412). For example, data from new I/Os arriving to VM4 are written to the DO stream generated in processing block 404 and the corresponding metadata from the new I/Os arriving to VM4 are written to the DO METADATA stream generated in processing block 402.


Process 400 writes new data arriving to CG3 to its DO stream and the corresponding metadata to its DO METADATA stream (414). For example, data from new I/Os arriving to VM1 is written to the DO stream generated in processing block 408 and the corresponding metadata from these new I/Os is written to the DO METADATA stream generated in processing block 406.


Process 400 separates the DO METADATA stream of CG1 (416). For example, a background process separates the metadata DO stream of CG1 into the beginning of the metadata streams of CG2, CG3 respectively. For example, process 400 copies metadata entries which relate to VM4 to the DO METADATA stream of CG2 and of VM1, VM2, VM3 to the DO METADATA stream of CG1. Since the metadata includes pointers to the locations of the storage where the data corresponding to the metadata exists in the DO stream when the distribution process continues (e.g., data is read from a DO stream and moved to an UNDO stream), it can access the data and apply it to the remote storage. In one particular example, for each block referenced, the reference count is increased by 1.


Process 400 separates the UNDO METADATA stream of CG1 (418). For example, a background process separates the metadata UNDO stream of CG1 into the beginning of the metadata streams of CG2, CG3 respectively. For example, process 400 copies metadata entries which relate to VM4 to the UNDO METADATA stream of CG2 and of VM1, VM2 and VM3 to the UNDO METADATA stream of CG1. In one particular example, for each block referenced, the reference count is increased by 1.


Process 400 allocates new blocks of data to the UNDO stream of CG2 (420) and allocates new blocks of data to the UNDO stream of CG3 (422).


Process 400 resumes distribution process (424). For example, data is read from the DO streams and moved to the UNDO streams. In one example, after a new data is written to VM4 the data is sent to the UNDO stream of CG2. In another example, after a data is written to VM1 the data is sent to the UNDO stream of CG3.


In one example, each stream of data is a list of blocks with relatively large size (e.g., 100 MB). The reason the streams are a list of blocks is to be able to sequentially write data to the storage as sequential writes, which are much faster for spindle-type storage. When data is distributed and data from a block is moved from the DO stream to the UNDO stream the block is erased and returns to the free block pool. Since after the separation into two streams a block may belong to two separate streams. A block can be erased only when it can be erased from the perspective of the two streams. For this reason a reference count is added to each block and when one stream wants to erase the block is just reduces the reference count. When the reference count reaches 0 the block is returned to the free pool block.


After the separation of the data streams, some operations may temporarily be less sequential as the data of a single CG may not be continuous in a single block. Caching and similar optimization may reduce the amount of non-sequential reads. As new data is written sequentially to each CG operations will return to be sequential eventually.


Referring to FIG. 5, a diagram 500 is an example of joining consistency groups, according to one embodiment of the disclosure. In this example, a consistency group CG4 includes a fifth virtual machine VM5, a sixth virtual machine VM6 and a seventh virtual machine VM7. A consistency group CG5 includes an eighth virtual machine VM8. CG4 is joined with CG5 to form CG6 that includes VM5, VM6, VM7 and VM8.



FIG. 6 is a flowchart of an example of a process to join consistency groups as shown in FIG. 5, according to one embodiment of the disclosure. For example, process 600 CG4 is combined with CG5 to form CG6. In one example, process 600 is performed without losing journal data and without copying data.


Process 600 waits for the DO streams of CG4 and CG5 to be at the same point-in-time (602). A problem may arise if the DO stream of CG4 is updated to a later point-in-time than the DO stream of CG5 or visa-versa. Therefore, process 600 waits for the CG4 and CG5 to be at the same point-in-time in their respective DO streams. For example, this is performed by rolling the CG which points to an earlier point-in-time while stopping the rolling of the other CG.


Process 600 generates a DO stream for CG6 (604) and generates a DO METADATA stream (608). For example, all the new I/Os generated by VMS, VM6, VM7 and VM8 will be sent to the DO stream for CG6 and the metadata for these new I/Os will be sent to the DO METADATA stream for CG6.


Process 600 combines the DO METADATA streams of CG4 and CG5 (612). For example, the DO METADATA stream of CG4 and the DO METADATA stream of CG5 are combined to form a new DO METADATA stream. For example, the list of metadata of the two CGs is interlaced into a single metadata stream according to the order of the timestamps.


Process 600 attaches the combined DO METADATA streams of CG4 and CG5 to the DO METADATA steam of CG6 (618). For example, the new DO METADATA stream formed in processing block 612 is attached to the beginning of the DO METADATA stream of CG6.


Process 600 combines the UNDO METADATA streams of CG4 and CG5 (622). For example, the UNDO METADATA stream of CG4 and the UNDO METADATA stream of CG5 are combined to form a new UNDO METADATA stream. As data is distributed from the DO stream to the UNDO stream and old blocks of the UNDO stream are erased the data of the combined CG, becomes sequential on single blocks.


Referring to FIG. 7, in one example, a computer 700 includes a processor 702, a volatile memory 704, a non-volatile memory 706 (e.g., hard disk) and the user interface (UI) 708 (e.g., a graphical user interface, a mouse, a keyboard, a display, touch screen and so forth), according to one embodiment of the disclosure. The non-volatile memory 706 stores computer instructions 712, an operating system 716 and data 718. In one example, the computer instructions 712 are executed by the processor 702 out of volatile memory 704 to perform all or part of the processes described herein (e.g., processes 400 and 600).


The processes described herein (e.g., processes 400 and 600) are not limited to use with the hardware and software of FIG. 7; they may find applicability in any computing or processing environment and with any type of machine or set of machines that is capable of running a computer program. The processes described herein may be implemented in hardware, software, or a combination of the two. The processes described herein may be implemented in computer programs executed on programmable computers/machines that each includes a processor, a non-transitory machine-readable medium or other article of manufacture that is readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and one or more output devices. Program code may be applied to data entered using an input device to perform any of the processes described herein and to generate output information.


The system may be implemented, at least in part, via a computer program product, (e.g., in a non-transitory machine-readable storage medium such as, for example, a non-transitory computer-readable medium), for execution by, or to control the operation of, data processing apparatus (e.g., a programmable processor, a computer, or multiple computers)). Each such program may be implemented in a high level procedural or object-oriented programming language to communicate with a computer system. However, the programs may be implemented in assembly or machine language. The language may be a compiled or an interpreted language and it may be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program may be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network. A computer program may be stored on a non-transitory machine-readable medium that is readable by a general or special purpose programmable computer for configuring and operating the computer when the non-transitory machine-readable medium is read by the computer to perform the processes described herein. For example, the processes described herein may also be implemented as a non-transitory machine-readable storage medium, configured with a computer program, where upon execution, instructions in the computer program cause the computer to operate in accordance with the processes. A non-transitory machine-readable medium may include but is not limited to a hard drive, compact disc, flash memory, non-volatile memory, volatile memory, magnetic diskette and so forth but does not include a transitory signal per se.


The processes described herein are not limited to the specific examples described. For example, the processes 400 and 600 are not limited to the specific processing order of FIGS. 4 and 6, respectively. Rather, any of the processing blocks of FIGS. 4 and 6 may be re-ordered, combined or removed, performed in parallel or in serial, as necessary, to achieve the results set forth above.


The processing blocks (for example, in the processes 400 and 600) associated with implementing the system may be performed by one or more programmable processors executing one or more computer programs to perform the functions of the system. All or part of the system may be implemented as, special purpose logic circuitry (e.g., an FPGA (field-programmable gate array) and/or an ASIC (application-specific integrated circuit)). All or part of the system may be implemented using electronic hardware circuitry that include electronic devices such as, for example, at least one of a processor, a memory, a programmable logic device or a logic gate.


Elements of different embodiments described herein may be combined to form other embodiments not specifically set forth above. Other embodiments not specifically described herein are also within the scope of the following claims.

Claims
  • 1. A method comprising: separating a set of virtual machines from a first consistency group to a second consistency group and third consistency group; andcombining a first virtual machine of the second consistency group to the third consistency group to form a fourth consistency group,wherein the set of virtual machines in the first consistency group are replicated together for which write order fidelity is preserved;wherein virtual machines in the fourth consistency group are replicated together for which write order fidelity is preserved;wherein combining the first virtual machine of the second consistency group to the third consistency group to form the fourth consistency group comprises: generating a DO stream for the fourth consistency group;generating a DO METADATA stream for the fourth consistency group;combining DO METADATA streams of the second consistency group and the third consistency group to form a combined DO METADATA;attaching the combined DO METADATA to the DO METADATA stream of the fourth consistency group;combining UNDO METADATA streams of the second and third consistency groups; andafter writing new data to the fourth consistency group, sending the new data to an UNDO stream of the second consistency group;wherein combining the first virtual machine of the second consistency group to a third consistency group further comprises waiting for the second consistency group and the third consistency group to be distributed at the same point of time, wherein distribution at the same point of time is performed by rolling one of the second consistency group and the third consistency group that points to an earlier point in time while stopping rolling of the other of the second consistency group and the third consistency group.
  • 2. The method of claim 1, wherein combining the first virtual machine of the second consistency group to a third consistency group to form a fourth consistency group comprises combining the first virtual machine of the second consistency group to a third consistency group to form a fourth consistency group without losing journal and without data copying.
  • 3. The method of claim 1, wherein separating a set of virtual machines from a first consistency group to a second consistency group and third consistency group comprises: generating a DO METADATA stream and DO stream for the second consistency group;generating a DO METADATA stream and DO stream for the third consistency group;pausing distribution of data, the pausing comprising stopping reads of data from the DO streams and movement to the UNDO streams;writing data from new I/Os arriving to the second consistency group to its DO stream and corresponding metadata to its DO METADATA stream; andwriting data from new I/Os arriving to the third consistency group to its DO stream and corresponding metadata to its DO METADATA stream.
  • 4. The method of claim 3, wherein separating a set of virtual machines from a first consistency group to a second consistency group and third consistency group further comprises: separating a DO METADATA stream of the first consistency group into the DO METADATA streams of the second and third consistency groups; andseparating an UNDO METADATA stream of the first consistency group into UNDO METADATA streams of the second and third consistency groups.
  • 5. The method of claim 4, wherein each of the DO stream, UNDO stream, DO METADATA stream, and UNDO METADATA stream comprises a list of blocks, wherein when data from one of the blocks is moved from one of the streams to another, the corresponding one of the blocks is erased and returned to a block pool.
  • 6. The method of claim 5, wherein after separating the DO METADATA stream of the first consistency group into the DO METADATA streams of the second and third consistency groups, and after separating the UNDO METADATA stream of the first consistency group into UNDO METADATA streams of the second and third consistency groups, the method further comprises: identifying a block belonging to both streams and erasing the block belonging to both streams after the movement only when it can be erased from both streams.
  • 7. An apparatus, comprising: a processor and a memory configured to: separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group;combine a first virtual machine of the second consistency group to the third consistency group to form a fourth consistency group, wherein the set of virtual machines in the first consistency group are replicated together for which write order fidelity is preserved;wherein virtual machines in the fourth consistency group are replicated together for which write order fidelity is preserved;wherein the processor and memory configured to combine the first virtual machine of the second consistency group to the third consistency group to form the fourth consistency group comprises circuitry configured to: generate a DO stream for the fourth consistency group;generate a DO METADATA stream for the fourth consistency group;combine DO METADATA streams of the second consistency group and the third consistency group to form a combined DO METADATA;attach the combined DO METADATA to the DO METADATA stream of the fourth consistency group;combine UNDO METADATA streams of the second and third consistency groups; andafter writing new data to the fourth consistency group, sending the new data to an UNDO stream of the second consistency group,wherein combining the first virtual machine of the second consistency group to a third consistency group further comprises waiting for the second consistency group and the third consistency group to be distributed at the same point of time, wherein distribution at the same point of time is performed by rolling one of the second consistency group and the third consistency group that points to an earlier point in time while stopping rolling of the other of the second consistency group and the third consistency group.
  • 8. The apparatus of claim 7, wherein the processor and the memory are configured to combine the first virtual machine of the second consistency group to a third consistency group to form a fourth consistency group comprises circuitry configured to combine the first virtual machine of the second consistency group to a third consistency group to form a fourth consistency group without losing journal and without data copying.
  • 9. The apparatus of claim 7, wherein the processor and the memory configured to separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group comprises circuitry configured to: generate a DO METADATA stream and DO stream for the second consistency group;generate a DO METADATA stream and DO stream for the third consistency group;pause distribution of data by stopping reads of data from the DO streams and movement to the UNDO streams;write data from new I/Os arriving to the second consistency group to its DO stream and corresponding metadata to its DO METADATA stream; andwrite data from new I/Os arriving to the second third consistency group to its DO stream and corresponding metadata to its DO METADATA stream.
  • 10. The apparatus of claim 9, wherein the processor and the memory configured to separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group comprises circuitry configured to: separate a DO METADATA stream of the first consistency group into the DO METADATA streams of the second and third consistency groups; andseparate an UNDO METADATA stream of the first consistency group into UNDO METADATA streams of the second and third consistency groups.
  • 11. An article comprising: a non-transitory computer-readable medium that stores computer-executable instructions, the instructions causing a machine to: separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group; andcombine a first virtual machine of the second consistency group to the third consistency group to form a fourth consistency group,wherein the set of virtual machines in the first consistency group are replicated together for which write order fidelity is preserved;wherein virtual machines in the fourth consistency group are replicated together for which write order fidelity is preserved;wherein the instructions causing the machine to combine the first virtual machine of the second consistency group to the third consistency group to form the fourth consistency group comprises instructions causing the machine to combine:generate a DO stream for the fourth consistency group;generate a DO METADATA stream for the fourth consistency group;combine DO METADATA streams of the second consistency group and the third consistency group to form a combined DO METADATA;attach the combined DO METADATA to the DO METADATA stream of the fourth consistency group;combine UNDO METADATA streams of the second and third consistency groups; andafter writing new data to the fourth consistency group, sending the new data to an UNDO stream of the second consistency group;wherein combining the first virtual machine of the second consistency group to a third consistency group further comprises waiting for the second consistency group and the third consistency group to be distributed at the same point of time, wherein distribution at the same point of time is performed by rolling one of the second consistency group and the third consistency group that points to an earlier point in time while stopping rolling of the other of the second consistency group and the third consistency group.
  • 12. The article of claim 11, wherein the instructions causing the machine to combine the first virtual machine of the second consistency group to a third consistency group to form a fourth consistency group comprises instructions causing the machine to combine the first virtual machine of the second consistency group to a third consistency group to form a fourth consistency group without losing journal and without data copying.
  • 13. The article of claim 11, wherein the instructions causing the machine to separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group comprises instructions causing the machine to: generate a DO METADATA stream and DO stream for the second consistency group;generate a DO METADATA stream and DO stream for the third consistency group;pause distribution of data by stopping reads of data from the DO streams and movement to the UNDO streams;write data from new I/Os arriving to the second consistency group to its DO stream and corresponding metadata to its DO METADATA stream; andwrite data from new I/Os arriving to the second third consistency group to its DO stream and corresponding metadata to its DO METADATA stream.
  • 14. The article of claim 13, wherein the instructions causing the machine to separate a set of virtual machines from a first consistency group to a second consistency group and third consistency group further comprises instructions causing the machine to: separate a DO METADATA stream of the first consistency group into the DO METADATA streams of the second and third consistency groups; andseparate an UNDO METADATA stream of the first consistency group into UNDO METADATA streams of the second and third consistency groups.
US Referenced Citations (278)
Number Name Date Kind
5170480 Mohan et al. Dec 1992 A
5249053 Jain Sep 1993 A
5388254 Betz et al. Feb 1995 A
5499367 Bamford et al. Mar 1996 A
5526397 Lohman Jun 1996 A
5864837 Maimone Jan 1999 A
5879459 Gadgil et al. Mar 1999 A
5990899 Whitten Nov 1999 A
6042652 Hyun et al. Mar 2000 A
6065018 Beier et al. May 2000 A
6143659 Leem Nov 2000 A
6148340 Bittinger et al. Nov 2000 A
6174377 Doering et al. Jan 2001 B1
6174809 Kang et al. Jan 2001 B1
6203613 Gates et al. Mar 2001 B1
6260125 McDowell Jul 2001 B1
6270572 Kim et al. Aug 2001 B1
6272534 Guha Aug 2001 B1
6287965 Kang et al. Sep 2001 B1
6467023 DeKoning et al. Oct 2002 B1
6574657 Dickinson Jun 2003 B1
6621493 Whitten Sep 2003 B1
6804676 Bains, II Oct 2004 B1
6947981 Lubbers et al. Sep 2005 B2
7043610 Horn et al. May 2006 B2
7051126 Franklin May 2006 B1
7076620 Takeda et al. Jul 2006 B2
7111197 Kingsbury et al. Sep 2006 B2
7117327 Hirakawa et al. Oct 2006 B2
7120768 Mizuno et al. Oct 2006 B2
7130975 Suishu et al. Oct 2006 B2
7139927 Park et al. Nov 2006 B2
7159088 Hirakawa et al. Jan 2007 B2
7167963 Hirakawa et al. Jan 2007 B2
7203741 Marco et al. Apr 2007 B2
7222136 Brown et al. May 2007 B1
7296008 Passerini et al. Nov 2007 B2
7328373 Kawamura et al. Feb 2008 B2
7353335 Kawamura Apr 2008 B2
7360113 Anderson et al. Apr 2008 B2
7426618 Vu et al. Sep 2008 B2
7519625 Honami et al. Apr 2009 B2
7519628 Leverett Apr 2009 B1
7546485 Cochran et al. Jun 2009 B2
7590887 Kano Sep 2009 B2
7606940 Yamagami Oct 2009 B2
7719443 Natanzon May 2010 B1
7757057 Sangapu et al. Jul 2010 B2
7840536 Ahal et al. Nov 2010 B1
7840662 Natanzon Nov 2010 B1
7844856 Ahal et al. Nov 2010 B1
7860836 Natanzon et al. Dec 2010 B1
7882286 Natanzon et al. Feb 2011 B1
7934262 Natanzon et al. Apr 2011 B1
7958372 Natanzon Jun 2011 B1
8037162 Marco et al. Oct 2011 B2
8041940 Natanzon et al. Oct 2011 B1
8060713 Natanzon Nov 2011 B1
8060714 Natanzon Nov 2011 B1
8103937 Natanzon et al. Jan 2012 B1
8108634 Natanzon et al. Jan 2012 B1
8205009 Heller et al. Jun 2012 B2
8214612 Natanzon Jul 2012 B1
8250149 Marco et al. Aug 2012 B2
8271441 Natanzon et al. Sep 2012 B1
8271447 Natanzon et al. Sep 2012 B1
8332687 Natanzon et al. Dec 2012 B1
8335761 Natanzon Dec 2012 B1
8335771 Natanzon et al. Dec 2012 B1
8341115 Natanzon et al. Dec 2012 B1
8370648 Natanzon Feb 2013 B1
8380885 Natanzon Feb 2013 B1
8392680 Natanzon et al. Mar 2013 B1
8429362 Natanzon et al. Apr 2013 B1
8433869 Natanzon et al. Apr 2013 B1
8438135 Natanzon et al. May 2013 B1
8464101 Natanzon et al. Jun 2013 B1
8478955 Natanzon et al. Jul 2013 B1
8495304 Natanzon et al. Jul 2013 B1
8510279 Natanzon et al. Aug 2013 B1
8521691 Natanzon Aug 2013 B1
8521694 Natanzon Aug 2013 B1
8543609 Natanzon Sep 2013 B1
8583885 Natanzon Nov 2013 B1
8600945 Natanzon et al. Dec 2013 B1
8601085 Ives et al. Dec 2013 B1
8627012 Derbeko et al. Jan 2014 B1
8683592 Dotan et al. Mar 2014 B1
8694700 Natanzon et al. Apr 2014 B1
8706700 Natanzon et al. Apr 2014 B1
8712962 Natanzon et al. Apr 2014 B1
8719497 Don et al. May 2014 B1
8725691 Natanzon May 2014 B1
8725692 Natanzon et al. May 2014 B1
8726066 Natanzon et al. May 2014 B1
8738813 Natanzon et al. May 2014 B1
8745004 Natanzon et al. Jun 2014 B1
8751828 Raizen et al. Jun 2014 B1
8769336 Natanzon et al. Jul 2014 B1
8805786 Natanzon Aug 2014 B1
8806161 Natanzon Aug 2014 B1
8825848 Dotan et al. Sep 2014 B1
8832399 Natanzon et al. Sep 2014 B1
8850143 Natanzon Sep 2014 B1
8850144 Natanzon Sep 2014 B1
8862546 Natanzon et al. Oct 2014 B1
8892835 Natanzon et al. Nov 2014 B1
8898112 Natanzon et al. Nov 2014 B1
8898409 Natanzon et al. Nov 2014 B1
8898515 Natanzon Nov 2014 B1
8898519 Natanzon et al. Nov 2014 B1
8914595 Natanzon Dec 2014 B1
8924668 Natanzon Dec 2014 B1
8930500 Marco et al. Jan 2015 B2
8930947 Derbeko et al. Jan 2015 B1
8935498 Natanzon Jan 2015 B1
8949180 Natanzon et al. Feb 2015 B1
8954673 Natanzon et al. Feb 2015 B1
8954796 Cohen et al. Feb 2015 B1
8959054 Natanzon Feb 2015 B1
8977593 Natanzon et al. Mar 2015 B1
8977826 Meiri et al. Mar 2015 B1
8996460 Frank et al. Mar 2015 B1
8996461 Natanzon et al. Mar 2015 B1
8996827 Natanzon Mar 2015 B1
9003138 Natanzon et al. Apr 2015 B1
9026696 Natanzon et al. May 2015 B1
9031913 Natanzon May 2015 B1
9032160 Natanzon et al. May 2015 B1
9037818 Natanzon et al. May 2015 B1
9047108 Rajaa Jun 2015 B1
9063994 Natanzon et al. Jun 2015 B1
9069479 Natanzon Jun 2015 B1
9069709 Natanzon et al. Jun 2015 B1
9081754 Natanzon et al. Jul 2015 B1
9081842 Natanzon et al. Jul 2015 B1
9087008 Natanzon Jul 2015 B1
9087112 Natanzon et al. Jul 2015 B1
9104529 Derbeko et al. Aug 2015 B1
9110914 Frank et al. Aug 2015 B1
9116811 Derbeko et al. Aug 2015 B1
9128628 Natanzon et al. Sep 2015 B1
9128855 Natanzon et al. Sep 2015 B1
9134914 Derbeko et al. Sep 2015 B1
9135119 Natanzon et al. Sep 2015 B1
9135120 Natanzon Sep 2015 B1
9146878 Cohen et al. Sep 2015 B1
9152339 Cohen et al. Oct 2015 B1
9152578 Saad et al. Oct 2015 B1
9152814 Natanzon Oct 2015 B1
9158578 Derbeko et al. Oct 2015 B1
9158630 Natanzon Oct 2015 B1
9160526 Raizen et al. Oct 2015 B1
9177670 Derbeko et al. Nov 2015 B1
9189339 Cohen et al. Nov 2015 B1
9189341 Natanzon et al. Nov 2015 B1
9201736 Moore et al. Dec 2015 B1
9223659 Natanzon et al. Dec 2015 B1
9225529 Natanzon et al. Dec 2015 B1
9235481 Natanzon et al. Jan 2016 B1
9235524 Derbeko et al. Jan 2016 B1
9235632 Natanzon Jan 2016 B1
9244997 Natanzon et al. Jan 2016 B1
9256605 Natanzon Feb 2016 B1
9274718 Natanzon et al. Mar 2016 B1
9275063 Natanzon Mar 2016 B1
9286052 Solan et al. Mar 2016 B1
9305009 Bono et al. Apr 2016 B1
9323750 Natanzon et al. Apr 2016 B2
9330155 Bono et al. May 2016 B1
9336094 Wolfson et al. May 2016 B1
9336230 Natanzon May 2016 B1
9367260 Natanzon Jun 2016 B1
9378096 Erel et al. Jun 2016 B1
9378219 Bono et al. Jun 2016 B1
9378261 Bono et al. Jun 2016 B1
9383937 Frank et al. Jul 2016 B1
9389800 Natanzon et al. Jul 2016 B1
9405481 Cohen et al. Aug 2016 B1
9405684 Derbeko et al. Aug 2016 B1
9405765 Natanzon Aug 2016 B1
9411535 Shemer et al. Aug 2016 B1
9459804 Natanzon et al. Oct 2016 B1
9460028 Raizen et al. Oct 2016 B1
9471579 Natanzon Oct 2016 B1
9477407 Marshak et al. Oct 2016 B1
9501542 Natanzon Nov 2016 B1
9507732 Natanzon et al. Nov 2016 B1
9507845 Natanzon et al. Nov 2016 B1
9514138 Natanzon et al. Dec 2016 B1
9524218 Veprinsky et al. Dec 2016 B1
9529885 Natanzon et al. Dec 2016 B1
9535800 Natanzon et al. Jan 2017 B1
9535801 Natanzon et al. Jan 2017 B1
9547459 BenHanokh et al. Jan 2017 B1
9547591 Natanzon et al. Jan 2017 B1
9552405 Moore et al. Jan 2017 B1
9557921 Cohen et al. Jan 2017 B1
9557925 Natanzon Jan 2017 B1
9563517 Natanzon et al. Feb 2017 B1
9563684 Natanzon et al. Feb 2017 B1
9575851 Natanzon et al. Feb 2017 B1
9575857 Natanzon Feb 2017 B1
9575894 Natanzon et al. Feb 2017 B1
9582382 Natanzon et al. Feb 2017 B1
9588703 Natanzon et al. Mar 2017 B1
9588847 Natanzon et al. Mar 2017 B1
9600377 Cohen et al. Mar 2017 B1
9619255 Natanzon Apr 2017 B1
9619256 Natanzon et al. Apr 2017 B1
9619264 Natanzon et al. Apr 2017 B1
9619543 Natanzon et al. Apr 2017 B1
9632881 Natanzon Apr 2017 B1
9639295 Natanzon et al. May 2017 B1
9639383 Natanzon May 2017 B1
9639592 Natanzon et al. May 2017 B1
9652333 Bournival et al. May 2017 B1
9658929 Natanzon et al. May 2017 B1
9659074 Natanzon et al. May 2017 B1
9665305 Natanzon et al. May 2017 B1
9668704 Fuimaono et al. Jun 2017 B2
9672117 Natanzon et al. Jun 2017 B1
9678680 Natanzon et al. Jun 2017 B1
9678728 Shemer et al. Jun 2017 B1
9684576 Natanzon et al. Jun 2017 B1
9690504 Natanzon et al. Jun 2017 B1
9696939 Frank et al. Jul 2017 B1
9710177 Natanzon Jul 2017 B1
9720618 Panidis et al. Aug 2017 B1
9722788 Natanzon et al. Aug 2017 B1
9727429 Moore et al. Aug 2017 B1
9733969 Derbeko et al. Aug 2017 B2
9737111 Lustik Aug 2017 B2
9740572 Natanzon et al. Aug 2017 B1
9740573 Natanzon Aug 2017 B1
9740880 Natanzon et al. Aug 2017 B1
9749300 Cale et al. Aug 2017 B1
9772789 Natanzon et al. Sep 2017 B1
9798472 Natanzon et al. Oct 2017 B1
9798490 Natanzon Oct 2017 B1
9804934 Natanzon et al. Oct 2017 B1
9811431 Natanzon et al. Nov 2017 B1
9823865 Natanzon et al. Nov 2017 B1
9823973 Natanzon Nov 2017 B1
9832261 Don et al. Nov 2017 B2
9846698 Panidis et al. Dec 2017 B1
9875042 Natanzon et al. Jan 2018 B1
9875162 Panidis et al. Jan 2018 B1
9880777 Bono et al. Jan 2018 B1
9881014 Bono et al. Jan 2018 B1
20020129168 Kanai et al. Sep 2002 A1
20030048842 Fourquin et al. Mar 2003 A1
20030061537 Cha et al. Mar 2003 A1
20030110278 Anderson Jun 2003 A1
20030145317 Chamberlain Jul 2003 A1
20030196147 Hirata et al. Oct 2003 A1
20040205092 Longo et al. Oct 2004 A1
20040250032 Ji et al. Dec 2004 A1
20040254964 Kodama et al. Dec 2004 A1
20050015663 Armangau et al. Jan 2005 A1
20050028022 Amano Feb 2005 A1
20050049924 DeBettencourt et al. Mar 2005 A1
20050172092 Lam et al. Aug 2005 A1
20050273655 Chow et al. Dec 2005 A1
20060031647 Hirakawa et al. Feb 2006 A1
20060047996 Anderson et al. Mar 2006 A1
20060064416 Sim-Tang Mar 2006 A1
20060107007 Hirakawa et al. May 2006 A1
20060117211 Matsunami et al. Jun 2006 A1
20060161810 Bao Jul 2006 A1
20060179343 Kitamura Aug 2006 A1
20060195670 Iwamura et al. Aug 2006 A1
20070055833 Vu et al. Mar 2007 A1
20070180304 Kano Aug 2007 A1
20070198602 Ngo et al. Aug 2007 A1
20070198791 Iwamura et al. Aug 2007 A1
20090089781 Shingai Apr 2009 A1
20160204977 Cui Jul 2016 A1
Foreign Referenced Citations (2)
Number Date Country
1154356 Nov 2001 EP
WO 00 45581 Aug 2000 WO
Non-Patent Literature Citations (21)
Entry
Gibson, “Five Point Plan Lies at the Heart of Compression Technology;” Tech Talk; Apr. 29, 1991; 1 Page.
Soules et al., “Metadata Efficiency in Versioning File Systems;”2nd USENIX Conference on File and Storage Technologies; Mar. 31, 2003-Apr. 2, 2003; 16 Pages.
AIX System Management Concepts: Operating Systems and Devices; Bull Electronics Angers; May 2000; 280 Pages.
Soules et al., “Metadata Efficiency in a Comprehensive Versioning File System;” May 2002; CMU-CS-02-145; School of Computer Science, Carnegie Mellon University; 33 Pages.
“Linux Filesystems,” Sams Publishing; 2002; Chapter 1: Introduction to Filesystems pp. 17-22 and Chapter 3: Overview of Journaling Filesystems pp. 67-71; 12 Pages.
Bunyan et al., “Multiplexing in a BrightStor® ARCserve® Backup Release 11;” Mar. 2004; 4 Pages.
Marks, “Network Computing, 33;” Cover Story; Feb. 2, 2006; 8 Pages.
Hill, “Network Computing, NA;” Cover Story; Jun. 8, 2006; 9 Pages.
Microsoft Computer Dictionary, Fifth Edition; 2002; 3 Pages.
Wikipedia; Retrieved on Mar. 29, 2011 from http://en.wikipedia.org/wiki/DEFLATE: DEFLATE; 6 Pages.
Wikipedia; Retrieved on Mar. 29, 2011 from http://en.wikipedia.org/wiki/Huffman_coding: Huffman Coding; 11 Pages.
Wikipedia; Retrieved on Mar. 29, 2011 from http:///en.wikipedia.org/wiki/LZ77: LZ77 and LZ78; 2 Pages.
U.S. Appl. No. 11/609,560.
U.S. Appl. No. 12/057,652.
U.S. Appl. No. 11/609,561.
U.S. Appl. No. 11/356,920.
U.S. Appl. No. 10/512,687.
U.S. Appl. No. 11/536,233.
U.S. Appl. No. 11/536,215.
U.S. Appl. No. 11/536,160.
U.S. Appl. No. 11/964,168.