US 8,239,654 B2Grant
Systems and methods for transferring data in a block-level storage operation
Issue Date:2012-08-07
•20 Claims
•23 Drawing Sheets
Abstract
The invention provides a system and method for storing a copy of data stored in an information store. In one embodiment, a data agent reads one or more blocks containing the data from the information store. The data agent maps the one or more blocks to provide a mapping of the blocks, and transmits the one or more blocks and mapping to a media agent for a storage device. The media agent stores the one or more blocks in the storage device according to the mapping.
Metadata
Assignee
- CommVault Systems, Inc.
Inventors
- Paul Ignatius
- Anand Prahlad
- Mahesh Tyagarajan
- Avinash Kumar
Application Information
Application Number:US 13/212,534
Filing Date:2011-08-18
Priority Date:1997-10-30
Art Unit:2185
Classifications
IPC:
G06F12/00G06F12/16
Patent Drawings (23 sheets)
Description
Related Applications
[0001] This application is a continuation of U.S. patent application Ser. No. 12/546,087, filed Aug. 24, 2009, which is a continuation of U.S. patent application Ser. No. 11/029,211, filed Jan. 3, 2005, now U.S. Pat. No. 7,581,077, issued Aug. 25, 2009, which claims the benefit of priority under 35 U.S.C. §119(e) of U.S. Provisional Application No. 60/714,507, filed Mar. 18, 2004, and which is a continuation-in-part application U.S. patent application Ser. No. 09/495,751, filed Feb. 1, 2000, now U.S. Pat. No. 7,209,972, issued Apr. 24, 2007, which is a continuation-in-part application of U.S. patent application Ser. No. 09/038,440, filed Mar. 11, 1998, now U.S. Pat. No. 6,418,478, issued Jul. 9, 2002, which is based on U.S. Provisional Application No. 60/063,831, filed on Oct. 30, 1997, each of which is hereby incorporated herein by reference in its entirety.
Background
[0002] 1. Field
[0003] The invention relates to data transfer mechanisms, and in particular, to a software-based, high speed DataPipe for providing high speed and reliable data transfer between computers.
[0004] 2. Description of the Related Art
[0005] It is fairly obvious that data, in the process of being archived or transferred from one location to another, will pass through various phases where different operations such as compression, network transfer, storage, etc. will take place on it. There are essentially two approaches that can be taken when implementing such a transfer mechanism. One would be to split the archival process into sub-tasks, each of which would perform a specific function (e.g. Compression). This would then require copying of data between sub-tasks, which could prove processor intensive. The other method would be to minimize copies, and have a monolithic program performing all of the archival functions. The downside to this would be loss of parallelism. A third alternative would of course be to use threads to do these tasks and use thread-signaling protocols, however, it is realized that this would not be entirely practical since threads are not fully supported on many computing platforms.
[0006] Accordingly, it is highly desirable to obtain a high-speed data transfer mechanism implemented in software and developed for the needs of high speed and reliable data transfer between computers.
[0007] It is an object of the invention to disclose the implementation of the DataPipe in accordance with CommVault System's Vault98 backup and recovery product. While developing the DataPipe, it is assumed that data, as it moves from archiving source (backup client) to archiving destination (backup server as opposed to media), may undergo transformation or examination at various stages in between. This may be to accommodate various actions such as data compression, indexing, object wrapping etc. that need to be performed on data being archived. Another assumption is the data may be transmitted over the network to remote machines or transferred to a locally attached media for archival.
[0008] Both the sending and the receiving computers execute software referred to herein as the DataPipe. Although the DataPipe transfer mechanism to be described herein is operative as a key component of backup and recovery software product schemes, the DataPipe is not restricted to that use. It is a general purpose data transfer mechanism implemented in software that is capable of moving data over a network between a sending and a receiving computer at very high speeds and in a manner that allows full utilization of one or more network paths and the full utilization of network bandwidth. A DataPipe can also be used to move data from one storage device to another within a single computer without the use of a network. Thus, the DataPipe concept is not confined to implementation only in networked systems, but is operable to transfer data in non-networked computers as well.
[0009] Further, in the case of a networked system, the DataPipe, and variations thereof, can be used to perform storage operations such as backups, snapshots, incremental backups, incremental snapshots, archiving and migration of data over the network, whether the network comprises a local area network, storage area network or a wide area network. The data is read and transferred from a source information store. The blocks in which the data is stored are mapped to create a block mapping. The data and block mapping are transmitted to a storage device where the data is stored in the same block order as it was stored in the information store according to the block mapping, as opposed to the blocks being stored out of order at a logical level. Individual blocks that are changed or added to the information store may be copied out, transmitted and stored as they change. These individual blocks are stored in the same order as they were stored in the information store, wherein each changed block replaces its older version, rather than by adding an additional logical block to represent the changes in the data.
Summary
[0010] The invention provides, in a communications system having an origination storage device and a destination storage device, a data transfer pipeline apparatus for transferring data in a sequence of N stages, where N is a positive integer greater than one, from the origination to the destination storage device. The apparatus comprises dedicated memory having a predetermined number of buffers dedicated for carrying data associated with the transfer of data from the origination device or process to the destination device or process; and master control module for registering and controlling processes associated with the data transfer apparatus for participation in the N stage data transfer sequence. The processes include at least a first stage process for initiating the data transfer and a last Nth stage process for completing data transfer. The first stage process is operative to allocate a buffer from the predetermined number of buffers available within the dedicated memory for collection, processing, and sending of the data from the origination device to a next stage process. The last Nth stage process is operative to receive a buffer allocated to the first stage process from the (N-1)th stage process in the data transfer sequence and to free the buffer upon processing completion and storage in the destination device to permit reallocation of the buffer. The master control process further includes a means for monitoring the number of buffers from the pool of buffers allocated or assigned to particular processes in the pipeline, wherein the monitor means is operative to prevent allocation of further buffers to a particular process when the number of buffers currently allocated exceeds a predetermined threshold.
[0011] The invention further provides a system and method for storing a copy of data stored in an information store. In one embodiment, a data agent maps one or more blocks that are read from the information store to provide a mapping of the blocks. The one or more blocks and mapping are transmitted to a storage device. A media agent for the storage device receives the one or more blocks. The media agent for the storage device stores the one or more blocks in the storage device according to the mapping.
Brief Description of the Drawings
[0012] The invention will be better understood with reference to the following drawings, in which:
[0013] FIG. 1A is a block diagram of a network architecture for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention;
[0014] FIG. 1B is a block diagram of a DataPipe architecture in accordance with an embodiment of the present invention;
[0015] FIG. 2A is a schematic of the DataPipe transfer process on a single computer according to an embodiment of the invention;
[0016] FIG. 2B is a schematic of the DataPipe transfer process on multiple computers according to another embodiment of the invention;
[0017] FIG. 2C is a schematic of the DataPipe transfer buffer allocation process from a buffer pool stored in the shared memory according to an embodiment of the invention;
[0018] FIG. 2D is a schematic illustrating a controlling relationship of a master monitor process to various attached processes according to an embodiment of the invention;
[0019] FIGS. 3A-3C illustrate various messages transferred between application processes and the master monitor process according to an embodiment of the invention;
[0020] FIGS. 4A-4B illustrate schematics of a module attachment process to shared memory space in accordance with the present invention;
[0021] FIGS. 5A-5B depict flow diagrams of the operation of sequencer and resequencer processes according to the present invention;
[0022] FIG. 6 depicts an exemplary data transfer flow among various processing stages within the DataPipe according to the present invention;
[0023] FIG. 7 illustrates a data pipeline transfer process on multiple computers having processes with multiple instantiations according to an embodiment of the present invention;
[0024] FIG. 8 is a diagram illustrating a modular data and storage management system that operates according to principles of the present invention;
[0025] FIG. 9 is diagram illustrating an exemplary header that is typically placed at the beginning of chunks of data that are sent across the storage management system;
[0026] FIG. 10 is an exemplary modular data and storage management system;
[0027] FIG. 11 is a diagram illustrating an exemplary embodiment of another modular data and storage management system;
[0028] FIG. 12 is a diagram illustrating an exemplary embodiment of one operational configuration for a header information storage;
[0029] FIG. 13 is a diagram illustrating an exemplary embodiment of another operational configuration for moving data between a source data mover and a destination data mover;
[0030] FIG. 14 is a block diagram of an exemplary embodiment of one operational configuration for performing storage operations with respect to data stored in information stores;
[0031] FIG. 15 illustrates a flow diagram illustrating steps to perform storage operations to copy data from an information store to a storage device;
[0032] FIG. 16 is a block diagram that illustrates sample configurations that a chunk of blocks takes as it is read from the information store and copied to the storage device over the data pipeline; and
[0033] FIG. 17 illustrates a sample mapping of the blocks contained in a header for the chunk of blocks after processing by a data agent and a media agent.
Detailed Description of the Preferred Embodiments
[0034] General Component Architecture
[0035] FIG. 1A presents a block diagram of a network architecture for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention. As shown, the system includes a storage manager 100 and one or more of the following: a client 85, an information store 90, a data agent 95, a media agent 105, an index cache 110, and a storage device 115. The system and elements thereof are exemplary of a three-tier backup system such as the CommVault Galaxy backup system, available from CommVault Systems, Inc. of Oceanport, N.J., and further described in application Ser. No. 09/610,738 which is incorporated herein by reference in its entirety.
[0036] A data agent 95 is generally a software module that is generally responsible for archiving, migrating, and recovering data of a client computer 85 stored in an information store 90 or other memory location. Each client computer 85 has at least one data agent 95 and the system can support many client computers 85. The system provides a plurality of data agents 95 each of which is intended to backup, migrate, and recover data associated with a different application. For example, different individual data agents 95 may be designed to handle Microsoft Exchange data, Lotus Notes data, Microsoft Windows 2000 file system data, Microsoft Active Directory Objects data, and other types of data known in the art.
[0037] Further, at least one or more of the data agents may be implemented with, or contain, or be contained in, one or more procedures which are executed by the data pipe described with respect to FIGS. 1B-13 below. These procedures perform tasks such as compression, encryption, and content analysis of data for transmission in a shared memory as described in detail below with respect to FIGS. 1B-13 .
[0038] If a client computer 85 has two or more types of data, one data agent 95 is generally required for each data type to archive, migrate, and restore the client computer 85 data. For example, to backup, migrate, and restore all of the data on a Microsoft Exchange 2000 server, the client computer 85 would use one Microsoft Exchange 2000 Mailbox data agent 95 to backup the Exchange 2000 mailboxes, one Microsoft Exchange 2000 Database data agent 95 to backup the Exchange 2000 databases, one Microsoft Exchange 2000 Public Folder data agent 95 to backup the Exchange 2000 Public Folders, and one Microsoft Windows 2000 File System data agent 95 to backup the client computer's 85 file system. These data agents 95 would be treated as four separate data agents 95 by the system even though they reside on the same client computer 85.
[0039] The storage manager 100 is generally a software module or application that coordinates and controls the system. The storage manager 100 communicates with all elements of the system including client computers 85, data agents 95, media agents 105, and storage devices 115, to initiate and manage system backups, migrations, and recoveries.
[0040] A media agent 105 is generally a software module that conducts data, as directed by the storage manager 100, between the client computer 85 and one or more storage devices 115 such as a tape library, a magnetic media storage device, an optical media storage device, or other storage device. The media agent 105 is communicatively coupled with and controls the storage device 115. The media agent 105 generally communicates with the storage device 115 via a local bus such as a SCSI adaptor. In some embodiments, the storage device 115 is communicatively coupled to the data agent 105 via a Storage Area Network (“SAN”).
[0041] Each media agent 105 maintains an index cache 110 which stores index data the system generates during copy and transmission operations as further described herein. For example, storage operations for Microsoft Exchange data generate index data. Index data provides the system with an efficient mechanism for locating user files for recovery operations. This index data is generally stored with the data backed up to the storage device 115, and the media agent 105 that controls the storage operation also writes an additional copy of the index data to its index cache 110. The data in the media agent 105 index cache 110 is thus readily available to the system for use in storage operations and other activities without having to be first retrieved from the storage device 115.
[0042] The storage manager 100 also maintains an index cache 110. Index data is also used to indicate logical associations between components of the system, user preferences, management tasks, and other useful data. For example, the storage manager 100 might use its index cache 110 to track logical associations between media agents 105 and storage devices 115.
[0043] In some embodiments, components of the system may reside and execute on the same computer. In some embodiments, a client computer 85 component such as a data agent 95, a media agent 105, or a storage manager 100 coordinates and directs local archiving, migration, and retrieval application functions as further described in application Ser. No. 09/610,738. This client computer 85 component can function independently or together with other similar client computer 85 components.
[0044] DataPipe
[0045] The objective of the DataPipe according to the present invention is to move data as quickly as possible from point A to point B (which may be on the same or different computers within a network) while performing a variety of operations (compression, encryption, content analysis, etc.) on the data. In order to meet this objective, parallel processing must be fully exploited, network bandwidth must be fully utilized, and CPU cycles must be minimized. The DataPipe must be efficiently implemented on a wide variety of computer systems such that heterogeneous systems on a network can use a DataPipe to transfer data to each other.
[0046] A DataPipe comprises a named set of tasks executing within one or more computers that cooperate with each other to transfer and process data in a pipelined manner. Within a DataPipe, a pipeline concept is used to improve performance of data transfer across multiple computers in a network. However, within a DataPipe, any stage within the pipeline may have multiple instances, thus greatly increasing the scalability and performance of the basic pipeline concept.
[0047] The DataPipe mechanism processes data by dividing its processing into logical tasks that can be performed in parallel. It then sequences those tasks in the order in which they are to act on the data. For example, a head task may extract data from a database, a second task may encrypt it, a third may compress it, a fourth may send it out over the network, a fifth may receive it from the network, and a sixth may write it to a tape. The latter two tasks may reside on a different computer than the others, for example.
[0048] All of the tasks that comprise a single DataPipe on a given computer have access to a segment of shared memory that is divided into a number of buffers. A small set of buffer manipulation primitives is used to allocate, free, and transfer buffers between tasks.
[0049] Semaphores (or other OS specific mutual exclusion or signaling primitives) are used to coordinate access to buffers between tasks on a given computer. Special tasks, called network agents, send and receive data across network connections using standard network protocols. These agents enable a DataPipe to connect across multiple computer systems. A single DataPipe can therefore reside on more than one computer and could reside on computers of different types.
[0050] Each task may be implemented as a separate thread, process, or as a procedure depending on the capabilities of the computing system on which the DataPipe is implemented.
[0051] The data exchange paradigm called the DataPipe has been fashioned to provide solutions to the problems associated and encountered in prior art data transfer systems. The salient features of this method are as follows:
[0052] 1. Split the whole task of processing on data into logical sub tasks and sequence them according to the order in which they are supposed to act on the data stream.
[0053] 2. Use dedicated process/threads to perform network transfer.
[0054] 3. Make all the dedicated tasks share a single large shared memory segment.
[0055] 4. Split the shared memory segment into small buffers so that this single buffer space can be shared among various execution threads at various stages of tasks.
[0056] 5. Use semaphores (or other OS specific mutual exclusion or signaling primitives) to transfer control over the data segments between modules.
[0057] As mentioned previously, each task may be implemented as a separate thread, or process, or as a procedure in a monolithic process (in cases where native platforms don't support any forms of parallel execution or multi processing). For data transfer across network, dedicated network readers and writers ensure communication across the net.
[0058] FIG. 1B shows a steady state picture of how the DataPipe architecture 10 is set up according to the present invention. There is shown a disk 20 residing on a computer machine 30 such as a SUN MICROSYSTEMS INC., SPARCSTATION 2, which houses information or data to be backed up or archived to server computer 40 (which may be for instance a SPARC 10) via optical or DLT devices 50 and 60 respectively. As one can ascertain, the DataPipe represents the end-to-end architecture which may be utilized during database backup from the disk drive 20 where the database will be archived to the tape or optical devices 50 and 60 at server 40. The DataPipe thus removes the network as the limiting factor in backup performance. As a result, the device pool defines the performance capabilities.
[0059] As shown in FIG. 1B , the DataPipe or stream 70 is created for the transfer of data for each device in the device pool to be used simultaneously, which comprises modules 72, 74, 76, 78, 79 and 50. Similarly, a second DataPipe 80 is shown comprised of modules 82, 84, 76, 78, 89 and 60. Note that if additional archive devices are used to backup data and parallel further DataPipes would be provided. Since one can ascertain the concept of the DataPipe through explanation of one path or thread by which data is transferred, further description will focus on processing through a single DataPipe or stream 70, as shown in FIG. 1B . At the head of the DataPipe is the collector component 72 which is responsible for obtaining the database information from disk 20. The data is passed down in buffers residing in dedicated shared memory (e.g. RAM memory) through the pipeline 70, through an optional compression module 74, to the network interface modules 76. At the network interface, data is multiplexed and parallel network paths 77 obtain maximum throughput across the network. The network may be, for example, the well-known Ethernet, or any network capable of supporting TCP/IP protocols including FDDI or ATM networks. The number of network paths utilized for each stream is a configurable parameter determined by the bandwidth of the network and configurable via a user interface. Note that as higher performance levels are necessary, additional devices may be used simultaneously with additional network interfaces added and utilized to further increase network throughput. On the receiving side, from the database server 40, the device pull appears local to the machine and the DataPipe architecture appears as a cloud with no constraints to performance. Network interface module 78 operates to transfer the data received across the network to device 50 for storage at server 40. Thus, the final task of storing or archiving the data is accomplished at archive device module 50.
[0060] From the preceding discussion and FIG. 2A , one can ascertain that a pipeline or DataPipe 10 comprises a head task 15 that generates the data to be archived or transferred from store 50, and a tail task 40 which accomplishes the final task of storing or writing the data to store 60, including archiving or restoring on the data. One or more middle modules 20, 30 may exist, which processes the data by performing actions such as compression, encryption, content analysis, etc. by allocating or not allocating new buffers while doing the processing.
[0061] A pipeline on a particular machine can be arranged to provide a feed to another different machine. A schematic diagram is illustrated in FIG. 2B . In this case, the DataPipe resides on more than one computer. This is done with the aid of network agents and control processors 50A, 50B, 60A and 60B. In such cases, the first machine 12A has a head 15 and other modules 20, 30, etc. which comprise middle processes. A cluster of dedicated network agents 50A which send data across to the remote machine 12B via standard network protocols and act as a pseudotail on the first machine. On the remote machine, a cluster of dedicated network reader agents 50B act as a pseudo head, and along with other modules such as middle (not shown) and tail 70, constitute the pipeline segment on that machine.
[0062] In addition to the transferring of data from one computer to another, a unique capability of the DataPipe invention is the ability to scale to enable full utilization of the bandwidth of a network, and to fully utilize the number of peripheral devices such as tape drives, or fully utilize other hardware components such as CPUs. The scalability of a DataPipe is achieved by using multiple instances of each task in the pipeline.
[0063] For example, multiple head tasks operating in parallel may gather data from a database and deposit it into buffers. Those buffers may then be processed by several parallel tasks that perform a function such as encryption. The encryption tasks in turn may feed several parallel tasks to perform compression, and several parallel tasks may perform network send operations to fully exploit network bandwidth. On the target computer, several network reader tasks may receive data, which is written to multiple tape units by several tasks. All of these tasks on both computers are part of the same DataPipe and collectively perform the job of moving data from the database to tape units. They do this job extremely efficiently by fully utilizing all available bandwidth and hardware allocated to the DataPipe while also minimizing CPU cycles by avoiding unnecessary copying of the data as it moves from one stage of the DataPipe to the next.
[0064] FIG. 2B shows the multiple computer case where a single head task (collect process) gathers data from the disk 40 and deposits it into buffers. The buffers are then processed by several parallel instantiations of compression process 20 which upon completion of processing of each buffer for each instantiation sends the process buffer to process 30 which performs content analysis, and sends the processed buffer data to several network agent tasks 50A or instantiations, which perform the network operations to send the data over the physical network 55 where it is received and processed by corresponding network agents 50B on the remote computer 12B and sent to tail backup/restore process 70 for storage or writing to DLT drive 80.
[0065] In general, there could be N stages in a given DataPipe pipeline. At each stage of the pipeline, there could be p instances of a given module task. These N stages could all be on the local machine or could be split across two different machines in which case there are network writers and network readers (i.e. pseudo tail and head network agents) which work together to ensure continuity in the pipeline.
[0066] Referring to FIG. 2B , each DataPipe has a dedicated memory segment 85 on each machine on which the DataPipe resides. For example, a DataPipe that sends data from machine 12A to machine 12B has two dedicated memory segments, one on machine A and one on machine B. Tasks that are part of this DataPipe may allocate and free buffers within these memory segments. Of course, tasks operating on machine 12A may only allocate or free buffers within the memory segment 85 on machine A and likewise for tasks on machine B. Thus, any of these modules may allocate or free segments of a single large shared memory on each machine dedicated for the use of this particular pipeline.
[0067] Buffer Manipulation Primitives
[0068] Referring now to FIG. 2C , each task or process (15) that wishes to allocate a buffer does it from a buffer pool 75 stored in the shared memory segment 85 owned by the DataPipe using AllocBuf( ). Each task that wishes to process incoming data from the previous task executes a receive call using ReceiveBuf( ). Each task that wishes to relinquish control of a particular buffer so that the next task can operate on it, performs a SendBuf( ) on that buffer to send it to the next task. Each task that wishes to destroy a buffer and return it into the buffer pool, does so by executing a FreeBuf( ) on that buffer.
[0069] Master_Monitor is connected to a predefined port, to enable it to communicate with its peers on other computer systems. Master_Monitor monitors the status of all DataPipes under its control at all times and is able to provide status of the DataPipe to the application software that uses the DataPipe.
[0070] To accomplish these above tasks, a master manager program called Master_Monitor executes in the preferred embodiment as a daemon on all process machines. The Master_Monitor program “listens” or receives control signal data on a port dedicated to receiving such control data from external processes. In this manner, the Master_Monitor program can serve the requirements of pipeline operations. Master_Monitor functions to monitor status of all pipelines under its control at all times and reports status of the pipeline to all its sub-modules. As shown in FIGS. 2B and 2D , Master_Monitor includes control messaging sockets 92 open to all modules through which it can control or change status of execution of each module. Master_Monitor 90 further includes functions which monitor status and listings of all centrally shared resources (among various modules of the same pipeline) such as shared memory or semaphores or any similar resource. Master_Monitor unless otherwise requested will initiate all modules of the pipeline either by fork( ) or thread_created( ) or a similar OS specific thread of control initiation mechanism. Master_Monitor also permits initiation of a pipeline with proper authentication. This initiator process can identify itself as either a head process or a tail process, which will later attach itself to the pipeline. (Exception is made in the case of a networking module, for this facility. A network process will not be allowed to attach itself as a the head or tail of any pipeline.) The Master_Monitor daemon owns and controls the shared storage memory 85 shown in FIG. 2C and can thus permit or deny processes accessed to such memory.
[0071] DataPipe Initiation
[0072] Referring now to FIG. 3A in conjunction with FIGS. 1 and 2A-D, a DataPipe is created by calling Master_Monitor and passing it an Initiate_Pipe message. In this message, parameters such as the DataPipe name, DataPipe component module names, the number of parallel instances for each component, properties of each component (e.g. whether they allocate buffers or not), local and remote machines involved in the DataPipe, direction of flow, nature of the invocation program etc. are passed to Master_Monitor. Note that the term “module” refers to a program that is executed as a task as part of an instance of a DataPipe. Each module may have more than one instance (e.g. execute as more than one task) within a DataPipe.
[0073] Referring now to FIG. 3B , depending upon the nature of the invocation program, it may be required that the process invoking the DataPipe needs to identify itself to the local Master_Monitor 90A and attach itself to the DataPipe as a head or tail task. In order to operate over a network on two computers, the Master_Monitor 90 initiates a Network Controller Process 60 on the first machine which contacts Master_Monitor 90B on the second machine where this DataPipe is to be completed using an Extend Pipe message. All information required for establishing the second side of the DataPipe, (including DataPipe name, number of processes, local machine name and number of parallel instantiations of particular processes) is passed along with this call so that the DataPipe is completely established across both machines. The Master_Monitor 90B on the second or remote machine, in response initiates the required processes on the second machine including network control process 60B (see FIG. 2B ) to initiate network agent processes on receiving machine.
[0074] Identification
[0075] The process responsible for initiation of the pipeline constructs a name for the pipeline using its own process Id, a time stamp, and the name of the machine where the initiator process is running. This pipeline name is passed along with both the Initiate-Pipe as well as the EXTEND_Pipe message so that the pipeline is identified with the same name on all computers on which it is operating (i.e. both the remote as well as the local machine). All shared memory segments and semaphores (reference numeral 85 of FIG. 2C ) attached to a particular pipeline are name referenced with this pipeline name and definite offsets. Hence the process of identification of a specific semaphore or shared memory associated with this pipeline is easy and accessible for all processes, and bound modules (i.e., modules for which control is initiated by the Master_Monitor). Each unbound module (i.e., a module not initiated via Master_Monitor, which attaches itself after the pipeline is initiated) must identify itself to its local Master_Monitor via a SEND_IDENT message shown in FIG. 3C . This message contains the name of the pipeline the unbound module wants to attach itself to, a control socket, and a process/thread id, which Master_Monitor uses to monitor status of this particular module.
[0076] Data Transfer Implementation (Allocation: Receive: Send: Free)
[0077] Directing attention to FIG. 2C and FIG. 4 , buffers are allocated using the call AllocBuf( ) from a common pool of buffers specified in the dedicated shared memory for the particular pipeline. The pool consists of a single large shared memory space 75 with Max Buffers number of equally sized buffers and an ‘rcq’ structure. The ‘rcq’ structure illustrated in FIG. 4 , contains input and output queues for each stage of the pipeline on that particular machine. Access to shared memory is controlled using a reader writer semaphore.
[0078] As shown in FIGS. 4A and B, the input queue of an ith stage module is the output queue of the (I-1)th stage module. The input queue of the first module is the output queue of the last module of the pipeline on that machine. Buffer allocation is always performed from the input queue associated with the first stage of the first module or process and a first set of semaphores 50A-D are each uniquely associated with a particular queue in order to track the number of buffers allocated by that queue/module. However, to ensure that no allocation task can unfairly consume buffers, a second set of semaphores 80 A-D is each uniquely associated with a particular module to limit allocation of buffers by each module to a threshold value of Max_Buffers/NA, where NA is the number of allocator modules in the pipeline on this particular machine. These parameters are stored in memory 75 under control of the Master_Monitor program and determines whether any process has exceeded its allocation. This means there could be K unfreed buffers in the system allocated by a single instance of a module H, where K is Max_Buffers/NA. Further allocation by module H will be possible when a buffer allocated by H gets freed.
[0079] All FreeBuf( ) calls free their buffers into the input queue of the first module. By the same rule, first stage modules are never permitted to do a ReceiveBuf( ) but are permitted to do AllocBuf( ). On the other hand, tail processes are permitted to perform only FreeBuf( ) and never permitted to perform a SendBuf( ). All other modules can Receive, Allocate, Send, and Free buffers. First stage modules always perform SendBuf( ) after they execute each AllocBuf( ). Note: Any module in the pipeline can allocate an available buffer if it requires to copy data during processing. Normally, however, data is not recopied within a given machine's pipeline segment.
[0080] As previously mentioned, each queue 95 is associated with a semaphore 50 to guarantee orderly access to shared memory and which gets triggered upon actions such as AllocBuf( ) ReceiveBuf( ) SendBuf( ) and FreeBuf( ). A second set of semaphores 80, each associated with a particular module in the pipeline, provide a mechanism to ensure that no bottlenecks occur. Dedicated network agents thus map themselves across any network interface on the system, as long as data propagation is ensured. The number of network agents per pipeline is a configurable parameter, which helps this mechanism exploit maximum data transfer bandwidth available on the network over which it is operating. A single dedicated parent network thread/process monitors performance and status of all network agents on that particular machine for a particular pipeline.
[0081] Referring again to FIG. 4A , the process flow of buffer allocation, sending, receiving, and freeing of buffers by processes in the pipeline and their associated semaphore indices is now described. Upon allocation of a buffer by first stage module 15 via the AllocBuf( ) command, the value of semaphore 50A associated with queue 1 is decremented from an initial value S.sub.0. Furthermore, second semaphore 80A which represents the allocator index for this particular module (module 15) which performs the allocation is also decremented from an initial value S.sub.1. Information indicating the module which performed this allocation is included within each buffer. The module 15 then sends the buffer to queue 2 where it is received by module 20 via the command ReceiveBuf( ), taken off of input queue 2 and assigned to the module which performed the call (i.e. module 20). Upon completion of processing on this buffer, module 20 passes forward the buffer by means of the SendBuf( ) which forwards the buffer to the destination queue (queue 3). Module 30 then performs a ReceiveBuf( ) of the buffer on its input queue (i.e. queue 3) and upon processing of the data, performs a FreeBuf( ) operation. As part of the FreeBuf( ) operation, semaphore 50A associated with queue I is incremented. Similarly, semaphore 80A which is the allocator index of module 15 (i.e. the module who allocated this particular buffer) is also incremented. Information relevant to this operation is always available with the buffer with which one is performing the free operation by virtue of shared memory area 85. In the preferred embodiment, the first set of semaphores (50A-50C) associated with the input/output queues of a particular stage may have a threshold value of up to max_buffers which is indicative of the maximum number of buffers which can be allocated in the pipeline. However, the semaphores 80A-C each uniquely associated with a particular module of a particular stage has an associated value of only max_buffers/NA, where NA (number of allocators) is greater than or equal to 1. Accordingly, since the semaphore value for either semaphores 50A-C and 80A-C can not be less than 0, this insures that all allocator modules may obtain a fair share of the available total number of input buffer.
[0082] FIG. 4B illustrates the situation where at least two modules are operable to allocate buffers. FIG. 4B is similar to FIG. 4A , with the exception that both modules 15 and 20 are operable to allocate buffers. Module 15 allocates the first buffer and decrements semaphore 50A. Similarly, semaphore 80A is also decremented. The buffer is then sent via the send command from module 15 from queue 1 to queue 2 where module 20 receives the buffer and begins processing. In this instance however, such as during compression, where a compression module may require allocation of additional buffers to perform its processing, module 20 performs an Alloc( ) to allocate a new buffer from the pool of available buffers in shared memory 85. Performance of the Alloc by module 20, thus causes semaphore 50A associated with queue 1, to be further decremented. Furthermore, the semaphore 80B associated with module 20 is also decremented, since module 20 is the allocator of the new buffer. Upon processing, the original buffer allocated by module 15 is freed via the FreeBuf( ) operation of module 20 at stage 2 and semaphore 50A value is correspondingly incremented. In addition, module 20 increments semaphore 80A associated with module 15 as a result of performance of the FreeBuf( ) operation, as indicated by arrow 84. Module 20 then performs the SendBuf( ) to send the new buffer to module 30 at queue 3, where module 30 then receives the new buffer, performs its processing, and subsequently frees the buffer which increments semaphore 50A, as shown by arrow 86. As part of the FreeBuf( ) operation, module 30 also increments semaphore 80B associated with module 20 as shown by arrow 88. In this manner, bottlenecks occurring within the pipeline are prevented, while maintaining proper and efficient data throughput.
[0083] Attachments
[0084] As the identification process is completed, all modules attach themselves to a specific shared memory space segment that is shared among modules on that machine for this particular pipeline. This shared memory segment has many data buffers, input queues for all stages on the pipeline, and their initial values. Each module identifies its own input queues and output queues depending on the stage that module is supposed to run at, and initial queue (first stage) is populated with number of data segments for sharing on this particular pipeline. Also all modules attach themselves to an allocator semaphore array, which controls the number of buffers allocated by a specific module that can be active in the pipeline.
[0085] Data Integrity
[0086] Integrity of the data passed along and the sequencing of data are maintained in part by a pair of special purpose modules termed sequencer and resequencer processes. FIGS. 5A and 5B provide diagrams of the operation of the sequencer and resequencer processes respectively. Referring to FIG. 5A , the sequencer process receives each buffer (module 10), reads the current sequence number stored in memory (module 20), and then stamps the buffer with the current sequence number (module 30) and sends the stamped buffer to the next stage for processing (module 40). The current sequence number is then incremented (module 50) and the process is repeated for each buffer received by the sequencer. The resequencer is operative to receive all input buffers and store them internally and wait for the required predecessor buffers to show up at the input queue before forwarding them all in the next sequence to the next stage of processing.
[0087] The purpose of the resequencer is to enforce the proper ordering of buffers. It insures this by making sure that it sends buffers to the next pipeline module in sequence number order. If a buffer is received out of order, it is held by the resequencer until all processor buffers are received and send to the next module. In this way, buffer ordering is guaranteed and buffers are never held longer than necessary. These steps are depicted in FIG. 5B . Note however, that when there is only one instance of a module present at any particular stage, by virtue of the queuing mechanism available with all input queues, data sequence in the right order is insured.
[0088] Hence, in the preferred embodiment, all data pipe transfers employing multi-instance stages via the sequencer/resequencer processes ensure that the input sequence of sequence numbers are not violated for each instance of the module. Further, the restriction that all modules of a specific multi-instance stage should be of the same type eliminates the chances for preferential behavior.
[0089] Fairness
[0090] The concept of fairness means that each task will be assured of getting the input buffers it needs to operate on without waiting longer than necessary. Fairness among the modules in a given DataPipe where no stage of the pipeline has more than one instance is automatic. As the tail task frees a buffer it enters the free buffer pool where it may enable the head task to allocate it and begin processing. All tasks in the DataPipe operate a maximum speed overlapping the processing done by other tasks in the preceding or following stage of the pipeline.
[0091] If a DataPipe has stages consisting of parallel instances of a task, fairness among those tasks is assured by using an allocator semaphore which counts from Max_Buffers/NA (where NA is the number of allocators for this DataPipe on this particular machine) downward to zero. All FreeBuf( ) increment this semaphore back, however, there could be only Max_Buffers NA buffers allocated by any allocator module in this DataPipe. This ensures that all allocators get a fair share of the available total number of input buffers. If a particular process attempts to allocate more buffers than it is allowed, the master_monitor process prevents such allocation, causing the process to either terminate or wait until a buffer currently allocated to the process becomes freed thereby incrementing the semaphore back up to allow the process to allocate another buffer.
[0092] Control Messages
[0093] All instances of all modules have a control socket to Master_Monitor over which control messages are exchanged. All network readers/writers have an analogous control socket to their parent network agent. The parent network agent itself has a control socket to Master_Monitor. Each module periodically checks its control socket for any messages from Master_Monitor. Critical information such as a STOP_PIPE message is passed to Master_Monitor via this mechanism.
[0094] Status Monitories
[0095] Each module initiated by Master_Monitor on a given machine is monitored by either a parent network process (in the case of network reader or writer), or by Master_Monitor itself, for states of execution. In case any module is reported as having terminated abnormally, Master_Monitor identifies this exception, and signals all the modules on that particular pipeline to stop. This is done by means of control messages through control sockets as described previously. Upon safely stopping all modules pertaining to this particular pipeline, it signals the remote machine's Master_Monitor to stop the remote side of this particular pipeline and the entire pipeline is shut down safely by means of control message signaling.
[0096] Implementation
[0097] In a preferred embodiment, the DataPipe functions and processes are implemented as software function in the higher level ‘C’ program language on Sun Solaris or HP-UX operating systems and incorporated into Release 2.7 of CommVault System's Vault98 storage management product.
[0098] FIG. 6 is an illustrative example of the sequence of primitive commands used to set up a DataPipe. The DataPipe is then used to process data in three modules named A, B and C.
[0099] To set up the DataPipe the Master_Monitor is called and provided with the name of the DataPipe and the names of the modules that will use the pipe (module 10).
[0100] Master_Monitor (Initiate_Pipe(Sample_pipe, A, B, C)).
[0101] Within the logic of module A, Alloc_Buf( ) function is then called to obtain a buffer (20). The logic of module A may perform any actions it wants to fill the buffer with useful data. When it has completed its processing of the buffer (30), it calls SendBuf( ) to send the buffer to module B for processing (40). Module A then repeats its function by again calling Alloc_Buf( ) to obtain the next buffer.
[0102] The logic of module B calls ReceiveBuf( ) to obtain a buffer of data from module A (50). It then operates on the buffer by performing processing as required (60). When it is finished with the buffer it calls SendBuf( ) to send that buffer to module C (70).
[0103] Module B then repeats if function by again calling ReceiveBuf( ) to obtain the next buffer from module A.
[0104] Module C obtains a buffer of data from module B by calling ReceiveBuf( ). When it has completed its processing of the data in that buffer (90), it calls FreeBuf( ) to release the buffer (100). Like the other two modules, it loops back to receive the next buffer form module B.
[0105] The primitives used to allocate, free, send, and receive buffers are synchronized by the use of semaphores. This ensures coordination between the modules so that the receiving module does not start processing data before the sending module has finished with it. If no buffer is available, the AllocBuf or ReceiveBuf primitives will wait until one is available. All three modules operate in parallel as separate tasks. The order of processing from A to B to C is established in the initial call to Master_Monitor that established the DataPipe.
[0106] Referring now to FIG. 7 , there is shown another embodiment of the DataPipe apparatus as it is used within Vault98 to provide a high speed path between a “client” system containing a large database that is being backed up to the “CommServ” server and stored as archive files on a DLT drive. Everything on the collect side, of the physical network are part of the client software configuration, whereas everything on the DLT drive side of the physical network are part of the server software configuration. The “collect” activities on the client prepare data to be sent over the DataPipe to the CommServ.
[0107] FIG. 7 , which is similar to FIG. 2B , depicts a two computer configuration where a header task 15, identified as a collect process, is initiated via Master_Monitor daemon 90A on the first computer. Collector 15 retrieves data from the disk and allocates the buffer from the shared memory 85A for processing the data to be transferred. Collector 15 then sends the data to the compression process 20 which functions to compress the data as it moves over the pipe. As shown in FIG. 7 , multiple instantiations of compression module 20 are provided at this stage for effectively processing the data as it flows across the system. Accordingly, sequencer 17 initiated by Master_Monitor 90A is coupled directly between collect module 15 and compressor module 20 to stamp each of the buffers with the sequence number as described previously. Re-sequencer module 23 is coupled to the output queue of the compression module 20 instantiations to properly reorder and re-sequence the buffers sent from the instantiations of module 20 to content analysis module 30. Content analysis module 30 then receives the buffers from re-sequencer 23, processes the data, and sends the buffers to sequencer 33, which again stamps the buffers and sends them to multiple instantiations of network agents 50A for processing across the physical network via standard network protocol such as TCP IP, FTP, ICMP etc. Network agents 50B are instantiated by network control processor 60B in communication with remote Master_Monitor 90B to provide multiple network agent instantiations, where each agent on the remote side uniquely corresponds and communicates with corresponding agent on the local side. In the preferred embodiment, each network agent 50A on the local side performs a copy of the data in the buffer for transfer over the physical network to its corresponding network agent 50B on the remote side and then performs a free buffer function call to free the buffers associated with shared memory 85A for reallocation. On the remote side, the network agent 50B receives the data transferred over the network and acts as a header on the remote side to allocate each of the buffers in shared memory 85B. These buffers are then sent to re-sequencer 53 which stores buffers received in internal memory until each of the predecessor buffers are received, and then forwards them to the backup restore process 70 via the SendBuf( ) function. The backup/restore process then functions to write the contents of each of the buffers received to DLT drive 80, and upon completion, frees each of those buffers to permit further reallocation in the buffer pool and shared memory 85B. As one can see, this pipeline could be set up over any high speed network, such as ATM, FDDI, etc. The pipeline is capable of utilizing entire practical bandwidth available on the physical network by means of multiple network agents. In cases where real high speed networks are available (networks which have transfer rates higher than DLT drives), multiple pipelines are set up, to utilize resources available to the full extent.
[0108] Salient Features
[0109] From the foregoing discussion, numerous advantages of the data pipe pipeline data transfer system using semaphore signaled shared memory to produce a general purpose, flexible data transfer mechanism are apparent. Included among these advantages are:
[0110] 1. Its flexible nature—the modules that are plugged into a pipeline can be easily changed based on the application.
[0111] 2. It allows for having multiple instances of a given module running in a given stage of the pipeline. This allows for parallelism over and beyond what the pipeline already provides.
[0112] 3. It provides a well-defined mechanism for startup and shutdown of a pipeline and includes housekeeping and cleanup mechanisms provided via Master_Monitor.
[0113] 4. It allows the application control over the amount of network bandwidth it wants to take advantage of. It is easily possible to take complete advantage of a wide-band transport mechanism simply by increasing the number of network agents.
[0114] 5. It provides built-in scheme for fairness among modules. In other words, no single module can retain all the input buffers, or no single instance of a multi-stage module can keep the other instances from operating.
[0115] 6. It allows easy integration with a 3rd party software by virtue of the fact that the DataPipe provides for any module to attach itself as an unbound end-point (head or tail).
[0116] 7. It allows for easy check pointing by virtue of a tail-head socket connection.
[0117] However, it should be remembered that shared memory on a particular machine is not shared among various other machines. Thus, we are not exploiting implicit results of a distributed shared memory, but doing data transfer, only on a demand basis, discarding all weed buffers, with selective copy, for best performance on a data transfer paradigm. Thus, the invention described herein represents a real data transfer system rather than a commonly seen distributed shared memory paradigm.
[0118] FIG. 8 is a modular data and storage management system 800 that operates according to principles of the present invention. A first operating system 802 is illustrated that supports a software application(s) 804 that is used for storing and/or retrieving data. For ease in understanding the principles of the present invention, FIG. 8 is illustrated with data being stored. Initially, data is moved from the software application 804 to a data mover 806 where a storage mapping module 808 is used to determine where the data is to be sent and in what format. The data is then sent to a data mover 810 before it is stored in storage media 812.
[0119] The data mover 806 includes an operating system interface module 814 that interacts with an encryption module 816, a compression module 818 and a chunking manager 820. A header/footer support module 821 is used to record information that indicates what format the data has been placed into before moving to the data mover 810. The storage mapping 808 examines the data to determine where it will be sent. In the example of FIG. 8 , the data is sent to the data mover 810 where a media interface module 822 interacts with new data that is received at the data mover. The data mover 810 includes a decryption module 824, a decompression module 826, a chunking manager 828, and header/footer module 830. Any one or more of these components may be activated to alter the format of data that has been received at the data mover 810. The data mover 810 then moves the data to the storage media 812, such as a first storage media 832, a second storage media 834, or an nth storage media 836.
[0120] As data is moved from the first operating system 802 to the storage media 812, a data pipe is created for passage of the data. For example, the data mover 806 may be considered to create a data pipe between the data mover 806 and the data mover 810. Although the data that is being transmitted could be parsed into multiple chunks by the chunking manager 820, and sent to different types of storage media 812, the data pipe may be considered to be the same data pipe for the data that is being sent. For example, if the data that is to be sent from the first operating system 802 to the storage media 812 is data that begins in a text format, changes to streaming video format, and then to audio format, the data could be separated into chunks which should be stored in different storage media and in different formats. However, the data will be considered to have traveled through a single data pipe. Each chunk of the data that is sent to the storage media 812 causes the storage management system 800 to identify the characteristics of the chunk that has been sent as well as characteristics of the next chunk that is to be sent, thereby allowing the storage management system 800 to keep the data pipe that has been established.
[0121] Any portion of the storage management system 800 may select the format for the data. For example, the software application 804 may select whether to encrypt, to compress, or to chunk data that is to be sent. The storage mapping 808 may also be the component that determines whether to encrypt, to compress, or to chunk the data. Also, the data mover 806 may make the decision of whether to encrypt, to compress, or to chunk the data. Numerous other decisions may be made by any one of these three components, such as the type of header, the transmission protocol, or other information necessary to transmit data from the first operating system 802 to the storage media 812.
[0122] The data movers 806 and 810 are illustrated having other support modules 838 and 840, respectively. These other support modules 838 and 840 are illustrated in dashed lines to indicate that they may or may not be present.
[0123] FIG. 9 is an exemplary header 900 that is typically placed at the beginning of chunks of data that are sent across the storage management system 800. The header 900 includes various pieces of information, such as a version control 902. The version control 902 is on the structure and helps in data format versioning of the data that is being transmitted on the storage management system 800. An in-line compression module 904 is included to assist in the compression of data in the transit of data from one location to the next, and is an optional feature.
[0124] Another optional feature is an in-line snooping module 906 that is used for such purposes as anti-virus checking, as well as other security purposes. A header transfer module 908 is included to transfer special headers with the portions of data that include the header 900. A compression algorithm selector 910 is included to select the appropriate compression algorithm for the data that is about to be sent or has just been received. An offset and block tagging module 912 is included for purposes of tagging the offset block number, or identifier, of the data. The block number and offset of the data is useful in determining where to locate data that has been stored. An in-line CRC (cyclic redundancy check) generator 914 may also be included in the i-tag header 900. If the in-line CRC 914 is included, a discard duplicate CRC module 916 may be included for discarding duplicate CRC blocks that have been generated by the in-line CRC 914 generator. Also included is a restart from point of failure (POF) module 918 that is able to continue transmission of data regardless of failures in the transmission. Also, group blocks module 920 can be included to group multiple blocks of data together for more efficient data transfer.
[0125] FIG. 10 is an exemplary modular data and storage management system 1000. The storage management system 1000 includes computing systems 1002, 1004, 1006, and 1008 that interact across a network 1010, such as an ether net network. The computing system 1002 includes a first operating system 1012 that interacts with software application 1014. The software application 1014 may be a single or multiple applications which interact with an installed file system 1016. When data is to be moved from the computing system 1002, the installed file system 1016 interacts with a data mover 1018 which formats the data into a plurality of modules 1020. The data mover 1018 interfaces with the computing system 1008 to get information from a storage manager 1022 concerning storage location. This information is contained in a master storage and backup map 1024. Upon receipt of the appropriate information from the computing system 1008, the data mover 1018 may transmit the data to the computing system 1006 where it is received at a data mover 1026.
[0126] The data mover 1026 includes a plurality of modules 1028, a media module 1030, and a data index 1032. The plurality of modules 1028 allows the data mover 1026 to store the data in a first storage media 1034, a second storage media 1036, down to an nth storage media 1038. The data that is sent from the computing system 1002 to the computing system 1006 may be compressed multiple times before being stored in one of the storage media 1034, 1036, 1038.
[0127] In addition, the computing system 1004 may transmit data to be stored. The computing system 1004 has a second operating system 1040, software application(s) 1042, an installed file system 1044, and a data mover 1046, having a plurality of modules 1048. As described in relation to the header 900, data is transmitted in various formats, and various portions of the storage management system may determine which formats to implement for the particular portion of the data transmission.
[0128] Of note, the computing systems 1002, 1004, and 1006 may include, as shown in dashed lines, respective storage managers 1050, 1052, and 1054. In this embodiment, the computing system 1008 may no longer be required.
[0129] FIG. 11 is an exemplary embodiment of another modular data and storage management system 1100. The storage and management system 1100 includes a computing system 1102, a computing system 1104, and a computing system 1106. The computing systems 1102, 1104 and 1106 interact to store data in either a storage area network 1108 or a network attached storage 1110. A network 1112 is provided for communications with the network attached storage 1110, while another network 1114 (typically, a high speed fibre network) is provided for communication with the storage area network 1108. For example, the computing system 1102 may transmit data by using a first operating system 1116 that supports software applications 1118 which interact with an installed file system 1120 to transmit data to a data mover 1122. The data mover 1122 may interact with a storage media 1124 to store data from the computing system 1102. The data mover 1122 may also transmit data to a data mover 1126 of the storage area network 1108. However, in making the decisions to send data to the storage area network 1108, the computing system 1106 is typically accessed to get information from a manager module 1144 to access a master map 1146 for determination for the location of transmission of the data. A media module 1128 of the storage area network 1108 determines whether the data will be saved to a magnetic disk media 1130, an optical media 1132 or a magnetic tape media 1134. In addition, the media module 1128 tracks migration of data between the various storage media 1130, 1132, and 1134.
[0130] The computing system 1104 is illustrated as including a second operating system 1136, and software applications 1138 that interact with an installed file system 1140. The installed file system 1140 may receive data from the software applications 1138 and transmit the data to a data mover 1142, where detailed information concerning transmission of the data is found in the computing system 1106 and its manager module 1144 and master map 1146. The data is then transmitted to the network attached storage 1110 where a destination data mover 1148 receives the data, and media module 1150 determines where the data will be stored in a storage media 1152.
[0131] As shown in dashed lines, the network 1112 could extend directly to the storage area network 1108. Also shown in dash lines, the network 1114 could extend directly to the network attached storage and the computing system 1106. These variations create greater flexibility in the storage management system 1100 and provide numerous variations to the system. Upon viewing the present disclosure, those skilled in the art will understand that numerous variations are desirable in certain circumstances.
[0132] FIG. 12 is an exemplary embodiment of one operational configuration for a header information storage 1211. The header information storage 1211 includes a storage map 1213, a data index 1215, and “within chunks” 1217. Each of these portions of the header information storage 1211 may contain different or all of the instructions to move data from a storage data mover 1231 to a destination data mover 1233. Some exemplary methods for transmitting data from the source data mover 1231 to the destination data mover 1233 are illustrated. For example, a header1 1241 could begin a data transmission from the source data mover 1231 to the destination data mover 1233. The header1 1241 would be followed by a chunk1 1243. The chunk1 1243 would then be followed by a header2 1245. The header2 1245 would be followed by a chunk2 1247, which in turn is followed by a header3 1249, which is followed by a chunk3 1251, etc. In this manner, data is transferred to the destination data mover 1233 in chunks until the complete data is received at the destination data mover 1233. The configuration of the headers and chunks is controlled by the header information storage 1211. The detailed information for the data transmission may be found in the storage map 1213, the data index 1215, and the “within chunks” 1217 either separately or collectively.
[0133] Another method for transfer of data is where a single header 1261 begins the transmission of multiple chunks, i.e., chunk1 1263, chunk2 1265, chunk3 1267, . . . chunkN 1269. The chunks are followed by a footer 1271 that completes the transmission of the data in this particular embodiment.
[0134] Still another method which the header information storage 1211 may use to transmit data is shown by header1 1281, which is followed by chunk1 1283. Chunk1 1283 is then followed by a footer1 1285 to complete transmission of that particular chunk. The next chunk is sent in the same manner, i.e., a header2 1287 is followed by chunk2 1289, which is followed by a footer2 1291 to complete the transmission of a second chunk. This process continues until all chunks have been transmitted to the destination data mover 1233. Of course, the above three methods for transmission of data are exemplary only, and other alternatives could be used for transferring data between the source data mover 1231 and the destination data mover 1233.
[0135] FIG. 13 is an exemplary embodiment of another potential operational configuration for moving data between a source data mover 1310 and a destination data mover 1312. In this embodiment, a data pipeline is established, and a session header 1314 is sent from the source data mover 1310 to the destination data mover 1312 to indicate that a pipe should be established between the two. When the pipe is completed, a session footer 1316 is sent from the source data mover 1310 to the destination data mover 1312. In between the session header 1314 and the session footer 1316 are archives, i.e., archive header1 1318 followed by archive footer1 1320, which is followed by archive header2 1322, which is closed when archive footer2 1324 is received, which process continues until archive headerN 1326 is received and archive footerN 1328 is received to establish the completion of the particular archive. Each of the archives is comprised of chunks, as illustrated by chunks 1330, chunks 1332, and chunks 1334.
[0136] Chunk 1330 is illustrated as including chunk1 1336, chunk2 1338, . . . chunkN 1340. Each of these individual chunks of the chunk 1330 is illustrated in greater detail to the right, and is represented by chunk 1350.
[0137] The chunk 1350 includes a chunk header 1352 and a chunk footer 1354. The chunk header 1352 is followed by a tag header 1356, which is then followed by data 1358. Another tag header 1360 follows the data 1358, and is followed by data 1362 and another tag header 1364. The tag header 1364 is followed by an options header 1366, which includes processing information, such as information indicating that the data should be stored on a different type storage media. The options header 1366 may be the only information following the tag header 1364, but data 1368 is illustrated in the event that other data is to be included after the data header 1364. A tag header 1370 is then illustrated and is followed by data 1372. This process continues until the chunk footer 1354 is sent from the source data mover 1310 to the destination data mover 1312.
[0138] Block Level Transmission and Storage Operations
[0139] In one embodiment of the system of the present invention, storage operations may be performed to copy information from an information store for storage in a storage device, which may be located remotely from the information store. The storage operation is generally a two step process. First, a full copy of the information store, or a source volume contained therein, is sent across the above described pipeline to the storage device. Second, storage operations continue for incremental changes to the information store to update changed blocks, or to add blocks to the storage device when they are added to the information store. The changed and added blocks are transmitted to the storage device in chunks, which can be as little as one block at a time, or several blocks at a time.
[0140] FIG. 14 is a block diagram of an exemplary embodiment of one operational configuration for the system of the present invention for processing storage operations for data stored in information stores 90. The storage operations generally copy data from the information stores 90 to storage devices 115. The configuration of the components of FIG. 14 may be viewed as an embodiment of the components and methods described with respect to FIGS. 1A-13 . Block level data copy and transfer operations are performed from information stores 90 of one or more client computers 85 over one or more of a variety of networks and through the above described data pipeline. The data storage operations of each of one or more client computers 85 may be controlled by one or more data agents 95, which may perform many of the functions of the data mover described and illustrated above as 800 with respect to FIG. 8 , as well as other processes of the data pipeline described above.
[0141] In this embodiment, at least one data agent 95 controls storage operations for each client computer 85. The data agent 95 performs at least one initial full storage operation with respect to its information store 90, or at least one volume therein. This initial storage operation may comprise a full backup, snapshot or archive of the information store or volume. However, this initial storage operation uses the method described below so that the resultant copy of the data in the storage device 115 has the same block configuration as the source information store 90.
[0142] After the initial full storage operation, each data agent 95 detects block level data changes or additions in the information store 90. Depending on configuration, each data agent 95 may either check periodically for changes or additions, or detect changes or additions as they occur in the respective information store 90.
[0143] For each information store 90, or volume therein for which storage operations are to occur, there is designated data storage space on a storage device 115 for performing storage operations from the information store 90. After each incremental update, a resulting copy of an information store or volume is stored with blocks of data that are stored in the same order as they are stored on the information store 90. In other words, the blocks are not stored out of order as they would if logical block copying was performed using only high level file copy and storage commands.
[0144] Once blocks of data are detected as being changed, added, or otherwise ready to be copied, the data agent 95 uses a read operation (which may be separate or a part of the data agent) to read the data blocks. The data agent may provide a signal to the storage manager 100 to alert the storage manager 100 a storage operation is beginning. The storage manager 100 may send a signal through the network 60 or 80 to alert the media agent 105 that the storage operation is beginning so that the media agent 105 may prepare to receive and process the data to be stored. For example, the media agent 105 may set aside resources, such as memory or multiplexed processor time, in preparation of receiving the data from the data agent 95.
[0145] In typical storage operations, such as file backup operations, the operating system of the client 85 uses file system calls to read files from the data store 90. In response to an operating system call, a controller, such as a disk controller of a hard disk, reads the data blocks containing the data of the files that are to be backed up or copied. The data of the files are read into the client computer's memory by the application perform the backup, from which the files are stored to the backup storage device in logical file format. If storage occurs across a network, the files are sent through the network interface to the storage device or computer where they are stored using the operating system controlling the storage device.
[0146] In contrast, the data agent 95 of the present invention preserves the block mapping from the information store 90 for the files. The data agent 95 packages the blocks in one or more chunks (such as those illustrated in FIGS. 12-13 ), and adds storage mapping to a header of each chunk to map the blocks according to the block numbers or identifiers received from the data agent 95.
[0147] The data agent 95 transmits the chunks, with the headers, to the media agent 105 for the storage device 115 that is allocated for the particular information store 90 from which the blocks of the chunks were read. Transmission may occur through the data pipe described above, which may include transmission over a network 60 or 80, which may use a virtual private network for security.
[0148] When the media agent 105 receives the chunks of blocks, it strips the header from the blocks in the chunk, reads the mapping, and stores the blocks in the designated storage area for the source information store according to the mapping. In other words, instead of storing the blocks as files using logical blocks on the storage device, the blocks which represent changed blocks from the information store replace the blocks of like number in the designated space of the information store 115. Added blocks are added to the designated space according to the block number or identifier. The storage by the media agent 105 may occur over a storage area network 70 to provide a pool of storage devices 115 that can be accessed by each of any number of media agents.
[0149] FIG. 15 illustrates a flow diagram illustrating steps to perform storage operations from an information store 90 to a storage device 115. Changed or added blocks are detected and read, step 1500. The blocks are stored in a shared memory (e.g., such as that shown as 85A in FIG. 7 ), step 1502, where dedicated processes or threads are performed to prepare the blocks for transfer through a data pipeline as described above (which may be performed by the data agent 95, or by processes external to the data agent 95a). In the embodiment of FIGS. 14 and 15 , the data pipeline includes network transfer operations through one or more of networks 60 and 80. As an example in FIG. 15 , one of the dedicated processes may include performing encryption operations, step 1504.
[0150] After the dedicated processes are completed, a copy/data transfer process is initiated, step 1506, by the data agent 95. The copy process 1506 may include arranging the blocks into chunks, and adding the header 900 to map the blocks with each chunk, as well as preparation of the chunks for transfer though the data pipe.
[0151] The media agent 105 for the storage device receives the chunks, step 1506. As part of the receiving step 1506, the various parts of the header for each chunk that were used in transmission may be stripped. However, the block mapping is kept and stored with each of the chunks. The media agent 105 may then read the block mapping, separate each of the blocks, and store each block according to the block mapping such that each changed block replaces the block of the same number stored on the storage device 115 in the storage space designated for the information store 90, and the new blocks are added to the designated space in order according to the added block numbers or identifiers, step 1508.
[0152] Referring to FIG. 16 , a block diagram illustrates sample configurations that a chunk of blocks takes as it is read from the information store 90 and copied to the storage device 115 over the data pipeline. The chunk of blocks 91 is stored, with the blocks in order, in the information store 90 of the client 85. The data agent 95 for the client 85 performs the process for the data pipe described with respect to FIG. 15 above. When storage operations for the information store are first initiated, all of the data of the information store, or volume of interest, may be copied to the storage device 115. After the initial storage operation, the data agent 95 may then run a detection process that periodically checks for block changes and additions of blocks to the source information store or source volume of the information store. If blocks are detected as being changed or added, then the storage operation described herein is performed with respect to those changed or added blocks.
[0153] Reading of the blocks from the information store 90 may be accomplished at a low level by either using resources of the operating system 86a of the client 85, or by bypassing the operating system 86a (e.g. using low-level assembly language calls to the controller of the information store 90) if the particular operating system 86a does not have facilities to perform block level reading. In FIG. 16 , the blocks that are being read are shown in contiguous order for ease of illustration. However, the blocks that are read may comprise blocks that are not contiguous, depending on what blocks were changed or added.
[0154] As shown in the configuration of the chunk 92 after processing by the data agent 95, the blocks are not necessary transmitted in order (e.g., the illustrated block numbers or identifiers occur in the order 2, 1, 3, 5, 6 and 4 in the transmitted chunk 92). This may occur especially in the case where operating system calls are used to read and process the blocks 91 from the information store 90. For example, most operating system read commands perform read operations at a logical block level, leaving low level block mapping to retrieve the desired data to a disk operating system or controller. In this case, the data agent 95 may need to map the resultant read data to specific data blocks by consulting a file allocation table used by the client computer to determine the block numbers or identifiers that match the read data.
[0155] The resulting header 900 of the chunk 92 resulting from processing by the data agent 95 contains includes mapping of the blocks, which may be in the form of offset and block tagging (e.g., 912 in FIG. 9 ), or other types of indexing such as hash tables, binary indexes, or the like, or as known to those skilled in the art. Thus, the header 900 keeps track of each block number, or identifier, and where each block occurs in the chunk 92.
[0156] In the embodiment of FIG. 16 , the media agent 105 for the storage device 115 receives the chunk for processing as described with respect to FIG. 15 . Many storage devices, or the media agents, have their own operating system 85b, which may or may not provide for processing block level storage commands. Thus, the media agent 105 may either use such operating system block level commands if provided, or the media agent 105 may bypass the operating system 85b (e.g. using assembly language commands) to provide control commands to the storage device 115 to write the blocks. The media agent 105 uses the mapping from the header 900 to store the blocks 94, according to the mapping, in their proper place and order in the space on the storage device 115 designated for the information store 90.
[0157] FIG. 17 illustrates a sample mapping (mapping index 912) of the blocks contained in the header 900 for the chunk 92 after processing by the data agent for transmission to the media agent. The mapping for the blocks in the header is stored as an offset table 912 to keep track of the block number, or identifier, and location of the blocks in the chunk 92. Each of the records of the offset table 912 contains two fields, a block number field and a byte offset field. The example in FIG. 17 assumes that each of the blocks are 32 bytes in length. The byte offset field in each record of the offset table 912 provides where each block identified in the block number field starts relative to the beginning of the blocks in the chunk 92. The media agent for the storage device may strip the header 900 and re-order the blocks according to the block number during processing. Each of the blocks may then be written in its proper location within the designated space on the storage device.
[0158] After all of the changed and added blocks of the information store have been processed through the data pipeline, and stored on the storage device, the result on the storage devices is an exact duplicate (in terms of blocks and block order) of the source information store or volume on the information store.
[0159] If the copy of the data stored on the storage device needs to be restored, or individual blocks or groups of blocks, then the storage operations described above with respect to FIGS. 14-17 may simply be reversed. In other words, the media agent performs the read operations from the storage device, packages chunks containing blocks of data and block mapping, and sends the chunks to the client computer that requires the data to be restored. The data agent at the client computer strips the header from the blocks, and uses the block mapping to restore or write the blocks back to the information store or volume of the information store. In the case where partial or individual blocks need to be restored, the data agent may send a signal to the storage manager regarding which blocks are damaged or need to be restored, and the storage manager may then send a signal to the media agent instructing the media agent to read and transmit the stored replacement blocks accordingly.
[0160] While there has been shown preferred embodiments of the present invention, those skilled in the art will further appreciate that the present invention may be embodied in other specific forms without departing from the spirit of central attributes thereof. All such variations and modifications are intended to be within the scope of this invention as defined by the appended claims.
Claims
What is claimed is:
1. A system for copying data stored in an information store, the system comprising:
one or more computing devices configured to generate a first mapping of a plurality of first blocks of data stored in an information store;
one or more computing devices configured to transmit a copy of the plurality of first blocks and the first mapping to a storage device;
one or more computing devices configured to store the copy of the plurality of first blocks in the storage device according to the first mapping;
one or more computing devices configured to identify block level data changes in the information store; and
one or more computing devices configured to generate a second mapping comprising a block identifier for each of a plurality of second blocks that represent changed blocks and added blocks of the block level data changes.
2. The system of claim 1 further comprising one or more computing devices configured to replace a corresponding one of the copy of the plurality of first blocks on the storage device that has the block identifier of one of the plurality of second blocks for each second block that represents one of the changed blocks.
3. The system of claim 2 further comprising one or more computing devices configured to add the second block to the storage device according to the block identifier of the second block for each second block that represents one of the added blocks.
4. The system of claim 1, wherein the copy of the plurality of first blocks is arranged into one or more chunks, each chunk associated with a header including at least a portion of the first mapping, the transmission comprising the one or more chunks and headers such that each chunk preceded by its associated header.
5. The system of claim 1, wherein the copy of the plurality of first blocks is arranged into one or more chunks, the one or more chunks associated with a header and a footer, the header including at least a portion of the first mapping and the footer indicating completion of the transmission, the transmission comprising the header, the one or more chunks, and the footer, the header followed by the one or more chunks, the one or more chunks followed by the footer.
6. The system of claim 1, wherein the copy of the plurality of first blocks is arranged into one or more chunks, each chunk of the one or more chunks associated with a header including at least a portion of the first mapping and a footer indicating completion of the associated chunk, the transmission comprising each chunk of the one or more chunks preceded by its associated header and followed by its associated footer.
7. The system of claim 1, wherein the first mapping comprises a block identifier for each of a plurality of first blocks.
8. The system of claim 1, wherein the copy of the plurality of first blocks includes at least one header, the at least one header comprising at least one of a version control, an in-line compression module, an in-line snooping module, a header transfer module, a compression algorithm selector, an offset and block tagging module, an in-line cyclic redundancy check (CRC) generator, a discard duplicate CRC module, a restart from point of failure module, and a group blocks module.
9. The system of claim 8, wherein the offset and block tagging module tags the block identifier.
10. A method for copying data stored in an information store, the method comprising:
generating a first mapping of a plurality of first blocks of data stored in an information store;
transmitting a copy of the plurality of first blocks and the first mapping to a storage device;
storing the copy of the plurality of first blocks in the storage device according to the first mapping;
identifying block level data changes in the information store; and
generating a second mapping comprising a block identifier for each of a plurality of second blocks that represent changed blocks and added blocks of the block level data changes.
11. The method of claim 10 further comprising replacing a corresponding one of the copy of the plurality of first blocks on the storage device that has the block identifier of one of the plurality of second blocks for each second block that represents one of the changed blocks.
12. The method of claim 11 further comprising adding the second block to the storage device according to the block identifier of the second block for each second block that represents one of the added blocks.
13. The method of claim 10, further comprising arranging the copy of the plurality of first blocks into one or more chunks, each chunk associated with a header including at least a portion of the first mapping, the transmission comprising the one or more chunks and the associated headers such that each chunk is preceded by its associated header.
14. The method of claim 10, further comprising arranging the copy of the plurality of first blocks into one or more chunks, the one or more chunks associated with a header and a footer, the header including at least a portion of the first mapping and the footer indicating completion of the transmission, the transmission comprising the one or more chunks preceded by the header and followed by the footer.
15. The method of claim 10, further comprising arranging the copy of the plurality of first blocks into one or more chunks, each chunk of the one or more chunks associated with a header including at least a portion of the first mapping and a footer indicating completion of the associated chunk, the transmission comprising each chunk of the one or more chunks preceded by its associated header and followed by its associated footer.
16. The method of claim 10, wherein the copy of the plurality of first blocks includes at least one header, the at least one header comprising at least one of a version control, an in-line compression module, an in-line snooping module, a header transfer module, a compression algorithm selector, an offset and block tagging module, an in-line cyclic redundancy check (CRC) generator, a discard duplicate CRC module, a restart from point of failure module, and a group blocks module.
17. The method of claim 16, wherein the offset and block tagging module tags the block identifier.
18. A system for copying data stored in an information store, the system comprising:
means for generating a first mapping of a plurality of first blocks of data stored in an information store;
means for transmitting a copy of the plurality of first blocks and the first mapping to a storage device;
means for storing the copy of the plurality of first blocks in the storage device according to the first mapping;
means for identifying block level data changes in the information store; and
means for generating a second mapping comprising a block identifier for each of a plurality of second blocks that represent changed blocks and added blocks of the block level data changes.
19. The system of claim 18 further comprising means for replacing a corresponding one of the copy of the plurality of first blocks on the storage device that has the block identifier of one of the plurality of second blocks for each second block that represents one of the changed blocks.
20. The system of claim 19 further comprising means for adding the second block to the storage device according to the block identifier of the second block for each second block that represents one of the added blocks.
Patent Citations (317)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4296465(A) | 1981-10-01 | Lemak | Applicant |
| US4686620(A) | 1987-08-01 | Ng | Applicant |
| US4695943(A) | 1987-09-01 | Keeley et al. | Applicant |
| US4888689(A) | 1989-12-01 | Taylor et al. | Applicant |
| US4995035(A) | 1991-02-01 | Cole et al. | Applicant |
| US5005122(A) | 1991-04-01 | Griffin et al. | Applicant |
| US5062104(A) | 1991-10-01 | Lubarsky et al. | Applicant |
| US5093912(A) | 1992-03-01 | Dong et al. | Applicant |
| US5133065(A) | 1992-07-01 | Cheffetz et al. | Applicant |
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5193154(A) | 1993-03-01 | Kitajima et al. | Applicant |
| US5212772(A) | 1993-05-01 | Masters | Applicant |
| US5226157(A) | 1993-07-01 | Nakano et al. | Applicant |
| US5239647(A) | 1993-08-01 | Anglin et al. | Applicant |
| US5241668(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5241670(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5247616(A) | 1993-09-01 | Berggren et al. | Applicant |
| US5276860(A) | 1994-01-01 | Fortier et al. | Applicant |
| US5276867(A) | 1994-01-01 | Kenley et al. | Applicant |
| US5287500(A) | 1994-02-01 | Stoppani, Jr. | Applicant |
| US5301351(A) | 1994-04-01 | Jippo | Applicant |
| US5311509(A) | 1994-05-01 | Heddes et al. | Applicant |
| US5321816(A) | 1994-06-01 | Rogan et al. | Applicant |
| US5333315(A) | 1994-07-01 | Saether et al. | Applicant |
| US5347653(A) | 1994-09-01 | Flynn et al. | Applicant |
| US5377341(A) | 1994-12-01 | Kaneko et al. | Applicant |
| US5388243(A) | 1995-02-01 | Glider et al. | Applicant |
| US5410700(A) | 1995-04-01 | Fecteau et al. | Applicant |
| US5428783(A) | 1995-06-01 | Lake | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi et al. | Applicant |
| US5465359(A) | 1995-11-01 | Allen et al. | Applicant |
| US5487160(A) | 1996-01-01 | Bemis | Applicant |
| US5491810(A) | 1996-02-01 | Allen | Applicant |
| US5495607(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5504873(A) | 1996-04-01 | Martin et al. | Applicant |
| US5515502(A) | 1996-05-01 | Wood | Applicant |
| US5544345(A) | 1996-08-01 | Carpenter et al. | Applicant |
| US5544347(A) | 1996-08-01 | Yanai et al. | Applicant |
| US5555404(A) | 1996-09-01 | Torbjornsen et al. | Applicant |
| US5559957(A) | 1996-09-01 | Balk | Applicant |
| US5559991(A) | 1996-09-01 | Kanfi | Applicant |
| US5588117(A) | 1996-12-01 | Karp et al. | Applicant |
| US5592618(A) | 1997-01-01 | Micka et al. | Applicant |
| US5598546(A) | 1997-01-01 | Blomgren | Applicant |
| US5606359(A) | 1997-02-01 | Youden et al. | Applicant |
| US5615392(A) | 1997-03-01 | Harrison et al. | Applicant |
| US5619644(A) | 1997-04-01 | Crockett et al. | Applicant |
| US5638509(A) | 1997-06-01 | Dunphy et al. | Applicant |
| US5642496(A) | 1997-06-01 | Kanfi | Applicant |
| US5644779(A) | 1997-07-01 | Song | Applicant |
| US5651002(A) | 1997-07-01 | Van Seters et al. | Applicant |
| US5673381(A) | 1997-09-01 | Huai et al. | Applicant |
| US5675511(A) | 1997-10-01 | Prasad et al. | Applicant |
| US5680550(A) | 1997-10-01 | Kuszmaul et al. | Applicant |
| US5682513(A) | 1997-10-01 | Candelaria et al. | Applicant |
| US5687343(A) | 1997-11-01 | Fecteau et al. | Applicant |
| US5692152(A) | 1997-11-01 | Cohen et al. | Applicant |
| US5699361(A) | 1997-12-01 | Ding et al. | Applicant |
| US5719786(A) | 1998-02-01 | Nelson et al. | Applicant |
| US5729743(A) | 1998-03-01 | Squibb | Applicant |
| US5737747(A) | 1998-04-01 | Vishlitzky et al. | Applicant |
| US5751997(A) | 1998-05-01 | Kullick et al. | Applicant |
| US5758359(A) | 1998-05-01 | Saxon | Applicant |
| US5761104(A) | 1998-06-01 | Lloyd et al. | Applicant |
| US5761677(A) | 1998-06-01 | Senator et al. | Applicant |
| US5761734(A) | 1998-06-01 | Pfeffer et al. | Applicant |
| US5764972(A) | 1998-06-01 | Crouse et al. | Applicant |
| US5778395(A) | 1998-07-01 | Whiting et al. | Applicant |
| US5790828(A) | 1998-08-01 | Jost | Applicant |
| US5805920(A) | 1998-09-01 | Sprenkle et al. | Applicant |
| US5812398(A) | 1998-09-01 | Nielsen | Applicant |
| US5813008(A) | 1998-09-01 | Benson et al. | Applicant |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5813017(A) | 1998-09-01 | Morris | Applicant |
| US5815462(A) | 1998-09-01 | Konishi et al. | Applicant |
| US5829023(A) | 1998-10-01 | Bishop | Applicant |
| US5829046(A) | 1998-10-01 | Tzelnic et al. | Applicant |
| US5860104(A) | 1999-01-01 | Witt et al. | Applicant |
| US5875478(A) | 1999-02-01 | Blumenau | Applicant |
| US5875481(A) | 1999-02-01 | Ashton et al. | Applicant |
| US5878056(A) | 1999-03-01 | Black et al. | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5890159(A) | 1999-03-01 | Sealby et al. | Applicant |
| US5897643(A) | 1999-04-01 | Matsumoto | Applicant |
| US5901327(A) | 1999-05-01 | Ofek | Applicant |
| US5924102(A) | 1999-07-01 | Perks | Applicant |
| US5926836(A) | 1999-07-01 | Blumenau | Applicant |
| US5933104(A) | 1999-08-01 | Kimura | Applicant |
| US5936871(A) | 1999-08-01 | Pan et al. | Applicant |
| US5950205(A) | 1999-09-01 | Aviani, Jr. | Applicant |
| US5956519(A) | 1999-09-01 | Wise et al. | Applicant |
| US5958005(A) | 1999-09-01 | Thorne et al. | Applicant |
| US5970233(A) | 1999-10-01 | Liu et al. | Applicant |
| US5970255(A) | 1999-10-01 | Tran et al. | Applicant |
| US5974563(A) | 1999-10-01 | Beeler, Jr. | Applicant |
| US5987478(A) | 1999-11-01 | See et al. | Applicant |
| US5995091(A) | 1999-11-01 | Near et al. | Applicant |
| US5999629(A) | 1999-12-01 | Heer et al. | Applicant |
| US6003089(A) | 1999-12-01 | Shaffer et al. | Applicant |
| US6009274(A) | 1999-12-01 | Fletcher et al. | Applicant |
| US6012090(A) | 2000-01-01 | Chung et al. | Applicant |
| US6021415(A) | 2000-02-01 | Cannon et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6041334(A) | 2000-03-01 | Cannon | Applicant |
| US6052735(A) | 2000-04-01 | Ulrich et al. | Applicant |
| US6058494(A) | 2000-05-01 | Gold et al. | Applicant |
| US6076148(A) | 2000-06-01 | Kedem et al. | Applicant |
| US6094416(A) | 2000-07-01 | Ying | Applicant |
| US6094684(A) | 2000-07-01 | Pallmann | Applicant |
| US6101255(A) | 2000-08-01 | Harrison et al. | Applicant |
| US6105129(A) | 2000-08-01 | Meier et al. | Applicant |
| US6105150(A) | 2000-08-01 | Noguchi et al. | Applicant |
| US6112239(A) | 2000-08-01 | Kenner et al. | Applicant |
| US6122668(A) | 2000-09-01 | Teng et al. | Applicant |
| US6131095(A) | 2000-10-01 | Low et al. | Applicant |
| US6131190(A) | 2000-10-01 | Sidwell | Applicant |
| US6137864(A) | 2000-10-01 | Yaker | Applicant |
| US6148412(A) | 2000-11-01 | Cannon et al. | Applicant |
| US6154787(A) | 2000-11-01 | Urevig et al. | Applicant |
| US6154852(A) | 2000-11-01 | Amundson et al. | Applicant |
| US6161111(A) | 2000-12-01 | Mutalik et al. | Applicant |
| US6167402(A) | 2000-12-01 | Yeager | Applicant |
| US6175829(B1) | 2001-01-01 | Li et al. | Applicant |
| US6212512(B1) | 2001-04-01 | Barney et al. | Applicant |
| US6230164(B1) | 2001-05-01 | Rekieta et al. | Applicant |
| US6260069(B1) | 2001-07-01 | Anglin | Applicant |
| US6269431(B1) | 2001-07-01 | Dunham | Applicant |
| US6275953(B1) | 2001-08-01 | Vahalia et al. | Applicant |
| US6292783(B1) | 2001-09-01 | Rohler | Applicant |
| US6295541(B1) | 2001-09-01 | Bodnar et al. | Applicant |
| US6301592(B1) | 2001-10-01 | Aoyama et al. | Applicant |
| US6304880(B1) | 2001-10-01 | Kishi | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Applicant |
| US6328766(B1) | 2001-12-01 | Long | Applicant |
| US6330570(B1) | 2001-12-01 | Crighton | Applicant |
| US6330572(B1) | 2001-12-01 | Sitka | Applicant |
| US6330642(B1) | 2001-12-01 | Carteau | Applicant |
| US6343324(B1) | 2002-01-01 | Hubis et al. | Applicant |
| US6350199(B1) | 2002-02-01 | Williams et al. | Applicant |
| USRE37601(E) | 2002-03-01 | Eastridge et al. | Applicant |
| US6353878(B1) | 2002-03-01 | Dunham | Applicant |
| US6356801(B1) | 2002-03-01 | Goodman et al. | Applicant |
| US6374266(B1) | 2002-04-01 | Shnelvar | Applicant |
| US6374336(B1) | 2002-04-01 | Peters et al. | Applicant |
| US6381331(B1) | 2002-04-01 | Kato | Applicant |
| US6385673(B1) | 2002-05-01 | DeMoney | Applicant |
| US6389432(B1) | 2002-05-01 | Pothapragada et al. | Applicant |
| US6418478(B1) | 2002-07-01 | Ignatius et al. | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6438586(B1) | 2002-08-01 | Hass et al. | Applicant |
| US6487561(B1) | 2002-11-01 | Ofek et al. | Applicant |
| US6487644(B1) | 2002-11-01 | Huebsch et al. | Applicant |
| US6505307(B1) | 2003-01-01 | Stell et al. | Applicant |
| US6519679(B2) | 2003-02-01 | Devireddy et al. | Applicant |
| US6538669(B1) | 2003-03-01 | Lagueux, Jr. et al. | Applicant |
| US6542909(B1) | 2003-04-01 | Tamer et al. | Applicant |
| US6542972(B2) | 2003-04-01 | Ignatius et al. | Applicant |
| US6564228(B1) | 2003-05-01 | O'Connor | Applicant |
| US6571310(B1) | 2003-05-01 | Ottesen | Applicant |
| US6577734(B1) | 2003-06-01 | Etzel et al. | Applicant |
| US6581143(B2) | 2003-06-01 | Gagne et al. | Applicant |
| US6604149(B1) | 2003-08-01 | Deo et al. | Applicant |
| US6631442(B1) | 2003-10-01 | Blumenau | Applicant |
| US6631493(B2) | 2003-10-01 | Ottesen et al. | Applicant |
| US6647396(B2) | 2003-11-01 | Parnell et al. | Applicant |
| US6654825(B2) | 2003-11-01 | Clapp et al. | Applicant |
| US6658436(B2) | 2003-12-01 | Oshinsky et al. | Applicant |
| US6658526(B2) | 2003-12-01 | Nguyen et al. | Applicant |
| US6675177(B1) | 2004-01-01 | Webb | Applicant |
| US6732124(B1) | 2004-05-01 | Koseki | Applicant |
| US6742092(B1) | 2004-05-01 | Huebsch et al. | Applicant |
| US6757794(B2) | 2004-06-01 | Cabrera et al. | Applicant |
| US6763351(B1) | 2004-07-01 | Subramaniam et al. | Applicant |
| US6772332(B1) | 2004-08-01 | Boebert et al. | Applicant |
| US6785786(B1) | 2004-08-01 | Gold et al. | Applicant |
| US6789161(B1) | 2004-09-01 | Blendermann et al. | Applicant |
| US6791910(B1) | 2004-09-01 | James et al. | Applicant |
| US6859758(B1) | 2005-02-01 | Prabhakaran et al. | Applicant |
| US6871163(B2) | 2005-03-01 | Hiller et al. | Applicant |
| US6880052(B2) | 2005-04-01 | Lubbers et al. | Applicant |
| US6886020(B1) | 2005-04-01 | Zahavi et al. | Applicant |
| US6909722(B1) | 2005-06-01 | Li | Applicant |
| US6928513(B2) | 2005-08-01 | Lubbers et al. | Applicant |
| US6952758(B2) | 2005-10-01 | Chron et al. | Applicant |
| US6965968(B1) | 2005-11-01 | Touboul et al. | Applicant |
| US6968351(B2) | 2005-11-01 | Butterworth | Applicant |
| US6973553(B1) | 2005-12-01 | Archibald, Jr. et al. | Applicant |
| US6983351(B2) | 2006-01-01 | Gibble et al. | Applicant |
| US7003519(B1) | 2006-02-01 | Biettron et al. | Applicant |
| US7003641(B2) | 2006-02-01 | Prahlad et al. | Applicant |
| US7035880(B1) | 2006-04-01 | Crescenti et al. | Applicant |
| US7062761(B2) | 2006-06-01 | Slavin et al. | Applicant |
| US7069380(B2) | 2006-06-01 | Ogawa et al. | Applicant |
| US7085904(B2) | 2006-08-01 | Mizuno et al. | Applicant |
| US7103731(B2) | 2006-09-01 | Gibble et al. | Applicant |
| US7103740(B1) | 2006-09-01 | Colgrove et al. | Applicant |
| US7107298(B2) | 2006-09-01 | Prahlad et al. | Applicant |
| US7107395(B1) | 2006-09-01 | Ofek et al. | Applicant |
| US7117246(B2) | 2006-10-01 | Christenson et al. | Applicant |
| US7120757(B2) | 2006-10-01 | Tsuge | Applicant |
| US7130970(B2) | 2006-10-01 | Devassy et al. | Applicant |
| US7155465(B2) | 2006-12-01 | Lee et al. | Applicant |
| US7155633(B2) | 2006-12-01 | Tuma et al. | Applicant |
| US7159110(B2) | 2007-01-01 | Douceur et al. | Applicant |
| US7174433(B2) | 2007-02-01 | Kottomtharayil et al. | Applicant |
| US7209972(B1) | 2007-04-01 | Ignatius et al. | Applicant |
| US7246140(B2) | 2007-07-01 | Therrien et al. | Applicant |
| US7246207(B2) | 2007-07-01 | Kottomtharayil et al. | Applicant |
| US7246272(B2) | 2007-07-01 | Cabezas et al. | Applicant |
| US7269612(B2) | 2007-09-01 | Devarakonda et al. | Applicant |
| US7272606(B2) | 2007-09-01 | Borthakur et al. | Applicant |
| US7277941(B2) | 2007-10-01 | Ignatius et al. | Applicant |
| US7278142(B2) | 2007-10-01 | Bandhole et al. | Applicant |
| US7287047(B2) | 2007-10-01 | Kavuri | Applicant |
| US7287252(B2) | 2007-10-01 | Bussiere et al. | Applicant |
| US7293133(B1) | 2007-11-01 | Colgrove et al. | Applicant |
| US7298846(B2) | 2007-11-01 | Bacon et al. | Applicant |
| US7315923(B2) | 2008-01-01 | Retnamma et al. | Applicant |
| US7346623(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7359917(B2) | 2008-04-01 | Winter et al. | Applicant |
| US7380072(B2) | 2008-05-01 | Kottomtharayil et al. | Applicant |
| US7398429(B2) | 2008-07-01 | Shaffer et al. | Applicant |
| US7401154(B2) | 2008-07-01 | Ignatius et al. | Applicant |
| US7409509(B2) | 2008-08-01 | Devassy et al. | Applicant |
| US7448079(B2) | 2008-11-01 | Tremain | Applicant |
| US7454569(B2) | 2008-11-01 | Kavuri et al. | Applicant |
| US7457933(B2) | 2008-11-01 | Pferdekaemper et al. | Applicant |
| US7467167(B2) | 2008-12-01 | Patterson | Applicant |
| US7472238(B1) | 2008-12-01 | Gokhale | Applicant |
| US7484054(B2) | 2009-01-01 | Kottomtharayil et al. | Applicant |
| US7490207(B2) | 2009-02-01 | Amarendran | Applicant |
| US7500053(B1) | 2009-03-01 | Kavuri et al. | Applicant |
| US7500150(B2) | 2009-03-01 | Sharma et al. | Applicant |
| US7509019(B2) | 2009-03-01 | Kaku | Applicant |
| US7519726(B2) | 2009-04-01 | Palliyll et al. | Applicant |
| US7523483(B2) | 2009-04-01 | Dogan | Applicant |
| US7529748(B2) | 2009-05-01 | Wen et al. | Applicant |
| US7536291(B1) | 2009-05-01 | Retnamma et al. | Applicant |
| US7546324(B2) | 2009-06-01 | Prahlad et al. | Applicant |
| US7546482(B2) | 2009-06-01 | Blumenau et al. | Applicant |
| US7581077(B2) | 2009-08-01 | Ignatius et al. | Applicant |
| US7596586(B2) | 2009-09-01 | Gokhale et al. | Applicant |
| US7613748(B2) | 2009-11-01 | Brockway et al. | Applicant |
| US7627598(B1) | 2009-12-01 | Burke | Applicant |
| US7627617(B2) | 2009-12-01 | Kavuri et al. | Applicant |
| US7631194(B2) | 2009-12-01 | Wahlert et al. | Applicant |
| US7685126(B2) | 2010-03-01 | Patel et al. | Applicant |
| US7765369(B1) | 2010-07-01 | Prahlad et al. | Applicant |
| US7809914(B2) | 2010-10-01 | Kottomtharayil et al. | Applicant |
| US7831553(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7840537(B2) | 2010-11-01 | Gokhale et al. | Applicant |
| US7861050(B2) | 2010-12-01 | Retnamma et al. | Applicant |
| US8019963(B2) | 2011-09-01 | Ignatius et al. | Applicant |
| US2002/0029281(A1) | 2002-03-01 | Zeidner et al. | Applicant |
| US2002/0040405(A1) | 2002-04-01 | Gold | Applicant |
| US2002/0042869(A1) | 2002-04-01 | Tate et al. | Applicant |
| US2002/0042882(A1) | 2002-04-01 | Dervan et al. | Applicant |
| US2002/0049778(A1) | 2002-04-01 | Bell et al. | Applicant |
| US2002/0065967(A1) | 2002-05-01 | MacWilliams et al. | Applicant |
| US2002/0107877(A1) | 2002-08-01 | Whiting et al. | Applicant |
| US2002/0194340(A1) | 2002-12-01 | Ebstyne et al. | Applicant |
| US2002/0198983(A1) | 2002-12-01 | Ullmann et al. | Applicant |
| US2003/0014433(A1) | 2003-01-01 | Teloh et al. | Applicant |
| US2003/0016609(A1) | 2003-01-01 | Rushton et al. | Applicant |
| US2003/0061491(A1) | 2003-03-01 | Jaskiewicz et al. | Applicant |
| US2003/0066070(A1) | 2003-04-01 | Houston | Applicant |
| US2003/0079112(A1) | 2003-04-01 | Sachs et al. | Applicant |
| US2003/0169733(A1) | 2003-09-01 | Gurkowski et al. | Applicant |
| US2004/0073716(A1) | 2004-04-01 | Boom et al. | Applicant |
| US2004/0088432(A1) | 2004-05-01 | Hubbard et al. | Applicant |
| US2004/0107199(A1) | 2004-06-01 | Dalrymple et al. | Applicant |
| US2004/0193953(A1) | 2004-09-01 | Callahan et al. | Applicant |
| US2004/0210796(A1) | 2004-10-01 | Largman et al. | Applicant |
| US2005/0033756(A1) | 2005-02-01 | Kottomtharayil et al. | Applicant |
| US2005/0114477(A1) | 2005-05-01 | Willging et al. | Applicant |
| US2005/0166011(A1) | 2005-07-01 | Burnett et al. | Applicant |
| US2005/0172093(A1) | 2005-08-01 | Jain | Applicant |
| US2005/0246568(A1) | 2005-11-01 | Davies | Applicant |
| US2005/0256972(A1) | 2005-11-01 | Cochran et al. | Applicant |
| US2005/0262296(A1) | 2005-11-01 | Peake | Applicant |
| US2006/0005048(A1) | 2006-01-01 | Osaki et al. | Applicant |
| US2006/0010154(A1) | 2006-01-01 | Prahlad et al. | Applicant |
| US2006/0010227(A1) | 2006-01-01 | Atluri | Applicant |
| US2006/0044674(A1) | 2006-03-01 | Martin et al. | Applicant |
| US2006/0149889(A1) | 2006-07-01 | Sikha | Applicant |
| US2006/0224846(A1) | 2006-10-01 | Amarendran et al. | Applicant |
| US2007/0288536(A1) | 2007-12-01 | Sen et al. | Applicant |
| US2008/0059515(A1) | 2008-03-01 | Fulton | Applicant |
| US2008/0229037(A1) | 2008-09-01 | Bunte et al. | Applicant |
| US2008/0243914(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0243957(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0243958(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0256173(A1) | 2008-10-01 | Ignatius et al. | Applicant |
| US2009/0319534(A1) | 2009-12-01 | Gokhale | Applicant |
| US2009/0319585(A1) | 2009-12-01 | Gokhale | Applicant |
| US2010/0005259(A1) | 2010-01-01 | Prahlad | Applicant |
| US2010/0131461(A1) | 2010-05-01 | Prahlad | Applicant |
| EP259912 | 1988-03-01 | Applicant | |
| EP405926 | 1991-01-01 | Applicant | |
| EP467546 | 1992-01-01 | Applicant | |
| EP774715 | 1997-05-01 | Applicant | |
| EP809184 | 1997-11-01 | Applicant | |
| EP862304 | 1998-09-01 | Applicant | |
| EP899662 | 1999-03-01 | Applicant | |
| EP981090 | 2000-02-01 | Applicant | |
| EP1174795 | 2002-01-01 | Applicant | |
| EP1115064 | 2004-12-01 | Applicant | |
| GB2366048 | 2002-02-01 | Applicant | |
| WO95/13580 | 1995-05-01 | Applicant | |
| WO98/39707 | 1998-09-01 | Applicant | |
| WO98/39709 | 1998-09-01 | Applicant | |
| WO99/12098 | 1999-03-01 | Applicant | |
| WO99/14692 | 1999-03-01 | Applicant | |
| WO99/17204 | 1999-04-01 | Applicant | |
| WO2/05466 | 2002-01-01 | Applicant | |
| WO2004/090788 | 2004-10-01 | Applicant | |
| WO2005/055093 | 2005-06-01 | Applicant |
Non-Patent Literature (33)
- U.S. Appl. No. 10/803,542, filed Mar. 18, 2004, Ignatius, Paul et al.Applicant
- U.S. Appl. No. 11/269,513, filed Nov. 7, 2005, Prahlad, et al.Applicant
- U.S. Appl. No. 11/269,520, filed Nov. 7, 2005, Gokhale, et al.Applicant
- U.S. Appl. No. 11/738,914, filed Apr. 23, 2007, Ignatius, Paul et al.Applicant
- Armstead et al., “Implementation of a Campus-Wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199.Applicant
- Arneson, “Development of Omniserver; Mass Storage Systems,” Control Data Corporation, 1990, pp. 88-93.Applicant
- Arneson, Mass Storage Archiving in Network Environments, Institute of Electrical and Electronics Engineers (IEEE), 1998, pp. 45-50.Applicant
- Ashton, et al., “Two Decades of policy-based storage management for the IBM mainframe computer”, www.research.ibm.com, 19 pages, published Apr. 10, 2003, printed Jan. 3, 2009., www.research.ibm.com, Apr. 10, 2003, pp. 19.Applicant
- Cabrera, et al. “ADSM: A Multi-Platform, Scalable, Back-up and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5, 1995-Mar. 9, 1995, pp. 420-427, San Francisco, CA.Applicant
- Canadian Office Action, Application No. CA/2544063, dated Dec. 10, 2009.Applicant
- Commvault Systems, Inc., Continuous Data Replicator 7.0, Product Data Sheet, 2007.Applicant
- Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.Applicant
- European Office Action, Application No. EP/019067693, dated Aug. 12, 2009.Applicant
- European Office Action, Application No. EP/019067693, dated Sep. 24, 2007.Applicant
- Farley, “Building Storage Networks,” pp. 328-331, Osborne/McGraw-Hill, 2000.Applicant
- Gait, “The Optical File Cabinet: A Random-Access File system for Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (1988).Applicant
- Gibson, “Network Attached Storage Architecture,” pp. 37-45, ACM, Nov. 2000.Applicant
- Great Britain Office Action, Application No. GB/06116685, dated Nov. 14, 2006.Applicant
- http://en.wikipedia.org/wiki/Naive—Bayes—classifier.Applicant
- Indian Office Action, Application No. IN/1625/KOLNP/2006, dated May 10, 2010.Applicant
- Indian Office Action, Application No. IN/656/CHENP/2005, dated Jun. 29, 2006.Applicant
- International Search Report and International Preliminary Report on Patentability, PCT/US2003/029105, dated Dec. 4, 2005.Applicant
- International Search Report and Written Opinion dated Nov. 13, 2009, PCT/US2007/081681.Applicant
- International Search Report, PCT/US2001/002931, dated Jun. 3, 2002.Applicant
- Israeli Office Action, Application No. IL/175036, dated Jul. 6, 2010.Applicant
- Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72.Applicant
- Recycle Bin (Windows), Aug. 2007, Wikipedia, pp. 1-3.Applicant
- Rosenblum et al., “The Design and Implementation of a Log-Structure File System,” Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991).Applicant
- Szor, The Art of Virus Research and Defense, Symantec Press (2005) ISBN 0-321-30454-3.Applicant
- Witten et al., Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten & Eibe Frank, Elsevier (2005) ISBN 0-12-088407-0.Applicant
- Written Opinion; International Application No. PCT/US05/40606; mailed Mar. 1, 2007; 5 pages.Applicant
- Canadian Office Action, Application No. CA/2499073, dated Oct. 7, 2009.Applicant
- Canadian Office Action, Application No. CA/2499073, dated Dec. 24, 2010.Applicant