HIGH SPEED DATA TRANSFER MECHANISM

Abstract: A storage and data management system establishes a data transfer pipeline between an application and a storage media using a source data mover and a destination data mover. The data movers are modular software entities which compartmentalize the differences between operating systems and media types. In addition, they independently interact to perform encryption, compression, etc., based on the content of a file as it is being communicated through the pipeline. Headers and chunking of data occurs when beneficial without the application ever having to be aware. Faster access times and storage mapping offer enhanced user interaction.

Description: HIGH SPEED DATA TRANSFER MECHANISM INVENTORS: RELATED APPLICATIONS This application is a continuation m part of U.S. Patent Application Serial No 09/038,440, filed March 1 1 , 1998, which is based on U S Provisional Application No 60/063,831 , filed on October 30, 1997 FIELD OF THE INVENTION 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. BACKGROUND OF THE INVENTION It is fairly obvious that data, in the process of being archived or transferred from one location lo 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 subtasks, each of which would perform a specific function (e.g. Compression). This would then require copying of data between subtasks, 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 Accordingly, it is highly desirable to obtain a high-speed data transfer mechanism implemented m software and developed for the needs of high speed and reliable data transfer between computeis. It is an object of the invention to disclose the implementation of the Data-Pipe m accordance with Comm Vault 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 m 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 s the data may be transmitted over the network to remote machines or transferred to a locally attached media for archival. 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 m 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 netwoik paths and the full utilization of netwoik 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 m networked systems, but is operable to transfer data m non-networked computers as well. SUMMARY OF THE INVENTION It is an object of the invention to provide m a communications system having an origination storage device and a destination storage device, a data transfer pipeline apparatus for transferring data m a sequence of N stages, where N is a positive integer greater than 1, 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 m the N stage data tiansfer 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 withm 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 m 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 m the pipeline, wherein the monitor means is operative to prevent allocation of further buffers to a particular process when the number of buffers currenth allocated exceeds a predetermined threshold. DESCRIPTION OF THE DRAWINGS The invention will be better understood with reference to the following drawings, in which: FIG. 1 is a block diagram of the DataPipe architecture m accordance with the present invention FIG. 2 A is a schematic of the DataPipe transfer process on a single computer according to an embodiment of the invention. FIG. 2B is a schematic of the DataPipe transfer process on multiple computers accordmg to another embodiment of the invention 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. FIG. 2D is a schematic illustrating the controlling relationship of the master monitor process to the various attached processes according to an embodiment of the invention FIGS. 3A-3C illustrate various messages transferred between application processes and the master monitor process according to an embodiment of the invention. FIGS. 4A - 4B illustrate schematics of the module attachment process to shared memory space m accordance with the present invention. FIGS. 5A-5B depict flow diagrams of the operation of the sequencer and resequencer processes accordmg to the present invention. Fig. 6 depicts an exemplary data transfer flow among various processing stages within the DataPipe according to the present invention. FIG 7 illustrates a data pipe transfer process on multiple computers having processes with multiple instantiations according to an embodiment of the present invention. FIG. 8 depicts a modular data and storage management system that operates according to principles of the piesent invention. FIG. 9 is an exemplary header that is typically placed at the beginning of chuchks of data that are sent across the storage management system of FIG. 8. FIG. 10 is an exemplary modular data and storage management system. FIG. 1 1 is an exemplary embodiment of another modular data and storage management system. FIG 12 is an exemplary embodiment of one operational configuration for a header information storage. FIG. 13 is an exemplary embodiment of another potential operational configuration for moving data between a source data mover and a destination data mover. DETAILED DESCRIPTION Before embarking on a detailed discussion of the data transfer mechanism of the present invention, the following should be understood. 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 withm 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. A DataPipe compπses a named set of tasks executing withm one or more computers that cooperate with each other to transfer and process data m a pipelined manner Withm a DataPipe, a pipeline concept is used to improve performance of data transfer across multiple computers in a network. However, withm a DataPipe, any stage withm the pipeline may have multiple instances, thus greatly increasing the scalability and performance of the basic pipeline concept. 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 m 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. 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. 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. 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 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: 1 Split the whole task of processing on data into logical sub tasks and sequence them according to the order m which they are supposed to act on the data stream. 2 Use dedicated process / threads to perform network transfer 3. Make all the dedicated tasks share a single large shared memory segment. 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. 5 Use semaphores (or other OS specific mutual exclusion or signaling primitives) to transfer control over the data segments between modules. 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. FIG. 1 shows a steady state picture of how the DataPipe architecture 10 is set up according to the present invention. Referring to Figure 1, 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 m backup performance. As a result, the device pool defines the performance capabilities. As shown m Figure 1 , 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 m Figure 1. 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 m 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. From the preceding discussion and Figure 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. A pipeline on a particular machine can be arranged to provide a feed to another different machine. A schematic diagram is illustrated m Figure 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 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. For example, multiple head tasks operating m 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 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. Figure 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. 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 m 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. Referring to Figure 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 withm 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 Buffer Manipulation Primitives Referring now to FIG. 2C, each task or process (15) that wishes to allocate a buffer does it from a buffer pool 75 stored m 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 ReceιveBuf(). 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. Master_Momtor is connected to a predefined port, to enable it to communicate with its peers on other computer systems. Master_Monιtor 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. To accomplish these above tasks, a master manager program called Master_Momtor executes in the preferred embodiment as a daemon on all process machines. The Master_Momtor program "listens" or receives control signal data on a port dedicated to receiving such control data from external processes. In this manner, the Master_Monιtor program can serve the requirements of pipeline operations. Master_Monιtor 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 Figures 2B and 2D, MasterJVlomtor includes control messaging sockets 92 open to all modules through which it can control or change status of execution of each module. Master_Momtor 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_Monιtor unless otherwise requested will initiate all modules of the pipeline either by fork() or thread_create() or a similar OS specific thread of control initiation mechanism. Master_Momtor 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 m 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_Momtor daemon owns and controls the shared storage memory 85 shown m Figure 2C and can thus permit or deny processes accessed to such memory. DataPipe Initiation Referring now to Figure 3A m conjunction with Figures 1 and 2A-D, a DataPipe is created by calling Master_Monιtor and passing it an Imtιate_Pιpe 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_Monιtor. 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. Referring now to Figure 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_Momtor 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_Monιtor 90 initiates a Network Controller Process 60 on the first machine which contacts MasterJVlomtor 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 MasterJVlomtor 90B on the second or remote machine, m response initiates the required processes on the second machine including network control process 60B (see Figure 213) to initiate network agent processes on receiving machine. Identification 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_Pιpe 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 Figure 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 (l e., modules for which control is initiated by the Master_Momtor). Each unbound module (i.e., a module not initiated via MasterJVlomtor, which attaches itself after the pipeline is initiated) must identify itself to its local Master_Monιtor via a SEND_IDENT message shown in Figure 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 MasterJVlomtor uses to monitor status of this particular module. Data Transfer Implementation Allocation. Receive: Send: Free Directing attention to Figure 2C and Figure 4, buffers are allocated using the call AllocBuf(), from a common pool of buffers specified m 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 'req" structure. The 'req" structure illustrated in Figure 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. As shown in Figures 4A and B, the input queue of an ith stage module is the output queue of the (I-I)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 m 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 MasterJVlomtor 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. 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 ReceιveBuf() but are permitted to do AllocBufQ. On the other hand, tail processes are permitted to perform only FreeBuff) 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 withm a given machine's pipeline segment. 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. Referring again to Figure 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 AllocBuff) command, the value of semaphore 50A associated with queue 1 is decremented from an initial value So. 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,. Information indicating the module which performed this allocation is included withm each buffer. The module 15 then sends the buffer to queue 2 where it is received by module 20 via the command ReceιveBuf(), 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 SendBufQ 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 1 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 m 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. Figure 4B illustrates the situation where at least two modules are operable to allocate buffers. Referring now to Figure 4B. which is similar to Figure 4A with the exception that both modules 15 and 20 are operable to allocate buffers, the following process is now described. 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 withm the pipeline are prevented, while maintaining proper and efficient data throughput. Attachments 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. Data Integrity 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. Figures 5A and 5B provide diagrams of the operation of the sequencer and resequencer processes respectively. Referring to Figure 5 A, 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 m the next sequence to the next stage of processing. 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 m 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 Figure 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. Hence, m 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. Fairness 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. 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()s 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_momtor 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. Control Messages All instances of all modules have a control socket to Master_Monιtor 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 MasterJVlomtor. Each module periodically checks its control socket for any messages from Master_Monιtor. Critical information such as a STOP_PIPE message is passed to Master_Momtor via this mechanism. Status Monitoring Each module initiated by MasterJVlomtor on a given machine is monitored by either a parent network process (in the case of network reader or writer), or by Master_Monιtor itself, for states of execution. In case any module is reported as having terminated abnormally, MasterJVlomtor 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 MasterJVlomtor to stop the remote side of this particular pipeline and the entire pipeline is shut down safely by means of control message signaling. Implementation In a preferred embodiment, the DataPipe functions and processes are implemented as software function in the higher level 'C program language on Sun Solans or HP-UX operating systems and incorporated into Release 2.7 of CommVault System's Vault98 storage management product. 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 m three modules named A, B and C. To set up the DataPipe the MasterJVlomtor is called and provided with the name of the DataPipe and the names of the modules that will use the pipe (module 10). MasterJVlomtor (Inιtιate_Pιpe(Sample_pιpe,A,B,C)). Withm 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. The logic of module B calls ReceιveBuf() 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). Module B then repeats if function by again calling ReceιveBuf() to obtain the next buffer from module A. Module C obtains a buffer of data from module B by calling ReceιveBuf(). 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. 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 m the initial call to Master_Monιtor that established the DataPipe. Referring now to FIG. 7, there is shown another embodiment of the Data.Pipe apparatus as it is used withm Nault98 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. Figure 7, which is similar to Figure 2B, depicts a two computer configuration where a header task 15, identified as a collect process, is initiated via Master_Monιtor daemon 90A on the first computer. Collector 15 retrieves data from the disk and allocates the buffer from the shared memory 85 A 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 m Figure 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 MasterJVlomtor 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. Resequencer module 23 is coupled to the output queue of the compression module 20 instantiations to properly reorder and resequence the buffers sent from the instantiations of module 20 to content analysis module 30. Content analysis module 30 then receives the buffers from resequencer 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_Momtor 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 resequencer 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 fall extent. Salient Features 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: 1 Its flexible nature - the modules that are plugged into a pipeline can be easily changed based on the application. 2 It allows for having multiple instances of a given module running m a given stage of the pipeline. This allows for parallelism over and beyond what the pipeline already provides. 3. It provides a well-defined mechanism for startup and shutdown of a pipeline and includes housekeeping and cleanup mechanisms provided via Master_Monιtor. 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. 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 multistage module can keep the other instances from operating. 6. It allows easy integration with a 3rd party software by virtue of the fact that the 5 DataPipe provides for any module to attach itself as an unbound endpomt (head or tail). 7. It allows for easy check pointing by virtue of a tail-head socket connection. 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, 0 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. 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 ^ applιcatιon(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. 0 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 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 foi at, the data could be separated into chunks which should be stored in different storage media and m 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. 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 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 m dashed lines to indicate that they may or may not be present. Fig. 9 is an exemplary header 900 that is typically placed at the beginning, of chunks or 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 m data format versioning of the data that is being transmitted on the storage management system 800. An inline compression module 904 is included to assist m the compression of data in the transit of data from one location to the next, and is an optional feature. Another optional feature is an mime 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 of the data. The block number and offset of the data is useful m determining where to locate data that has been stored. An m-hne CRC (cyclic redundancy check) generator 914 may also be included m the l-tag header 900. If the m-hne CRC 914 is included, a discard duplicate CRC module 916 may be included for discarding duplicate CRC blocks that have been generated by the mime 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. 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 ethernet 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 m 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. 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 m 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. In addition, the computing system 1004 may transmit data to be stored. The computing system 1004 has a second operating system 1040, software applιcatιon(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 m various formats, and various potions of the storage management system may determine which formats to implement for the particular portion of the data transmission. 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. Fig. 11 is an exemplary embodiment of another modular data and storage management system 1 100. The storage and management system 1100 includes a computing system 1 102, a computing system 1104, and a computing system 1106. The computing systems 1102, 1104 and 1 106 interact to store data in either a storage area network 1108 or a network attached storage 1110. A network 1 112 is provided for communications with the network attached storage 11 10, while another network 1 1 14 (typically, a high speed fibre network) is provided for communication with the storage area network 1 108. 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 1 120 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, m making the decisions to send data to the storage area network 1 108, the computing system 1 106 is typically accessed to get information from a manager module 1144 to access a master map 1146 for determination for the location of transmission or 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 1 134. In addition, the media module 1128 tracks migration of data between the various storage media 1 130, 1 132, and 1134. The computing system 1 104 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 1 142, 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 1 110 where a destination data mover 1 148 receives the data, and media module 1 150 determines where the data will be stored a storage media 1 152. As shown in dashed lines, the network 1112 could extend directly to the storage area network 1 108. Also shown m dash lmes. the network 1114 could extend directly to the network attached storage and the computing system 1106. These variations create greater flexibility m 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. 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 "withm 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 source 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 header 1 1241 could begin a data transmission from the source data mover 1231 to the destination data mover 1233. The headerl 1241 would be followed by a chunkl 1243. The chunkl 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 m 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 "withm chunks" 1217 either separately or collectively. Another method for transfer of data is where a single header 1261 begins the transmission of multiple chunks, i.e., chunkl 1263, chunk2 1265, chunk3 1267, ... chunkN 1269. The chunks are followed by a footer 1271 that completes the transmission of the data m this particular embodiment. Still another method which the header information storage 1211 may use to transmit data is shown by headerl 1281, which is followed by chunk 1 1283. Chunk 1 1283 is then followed by a footerl 1285 to complete transmission of that particular chunk. The next chunk is sent m 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. 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 pipe 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 headerl 1318 followed by archive footerl 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. Chunk 1330 is illustrated as including chunkl 1336, chunk2 1338, ... chunkN 1340. Each of these individual chunks of the chunk 1330 is illustrated in greater detail to the night, and is represented by chunk 1350. 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. 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 withm the scope of this invention as defined by the appended claims.

Claims: CLAIMS We claim: 1 A data storage system having at least one storage device for storing a file, the data storage system comprising. a destination data mover; and a source data mover, communicatively coupled to the at least one storage device, that analyzes the file to determine whether to send the file to the destination data mover in chunks. 2 The data storage system of claim 1 wherein the destination data mover receives the file from the source data mover and stores the file in the at least one storage device. 3 The data storage system of claim 1 wherein the file comprises a format selected from the group consisting of a text file, a streaming video file, an audio file, and a combination of text, streaming video, and audio. 4. The data storage system of claim 1 wherein the source data mover sends the file to the destination data mover in chunks along with header information instructing the destination data mover regarding the chunks. 5. The data storage system of claim 4 wherein each of the chunks includes footer information instructing the destination data mover regarding the chunks. 6. The data storage system of claim 4 wherein the header information comprises at least one of the following: version control, m-hne compression, m-hne snooping, header transfer, compression algorithm selection, offset and block tagging, m-hne cyclic redundancy checking, a discard redundant cyclic redundancy check module, a restart from point of failure module, and a group blocking module. 7. The data storage system of claim 4 wherein each of the chunks includes header information instructing the destination data mover regarding the chunks. 8. The data storage system of claim 4 wherein the chunks include a single header and a single footer, each of the single header and the single footer including information instructing the destination data mover regarding the chunks. 9. A data storage system having at least one storage device for storing a file, the data storage system comprising: a destination data mover: and a source data mover, communicatively coupled to the at least one storage device, that sends the file to the destination data mover in chunks along with header information instructing the destination data mover regarding the chunks. 10. The data storage system of claim 9 wherein the destination data mover receives the file from the source data mover and stores the file m the at least one storage device. 1 1. The data storage system of claim 9 wherein the file comprises a format selected from the group consisting of a text file, a streaming video file, an audio file, and a combination of text, streaming video, and audio. 12. The data storage system of claim 9 wherein each of the chunks includes footer information instructing the destination data mover regarding the chunks. 13. The data storage system of claim 9 wherein the header information comprises at least one of the following: version control, m-hne compression, m-hne snooping, header transfer, compression algorithm selection, offset and block tagging, m-hne cyclic redundancy checking, a discard redundant cyclic redundancy check module, a restart from point of failure module, and a group blocking module. 14. The data storage system of claim 9 wherein each of the chunks includes header information instructing the destination data mover regarding the chunks. 15. The data storage system of claim 9 wherein the chunks include a single header and a single footer, each of the single header and the single footer including information instructing the destination data mover regarding the chunks. 16. A high speed data transfer mechanism for storing data comprising: a software application that may be used to generate data that is to be stored; a source data mover that receives, from the software application, the data that is to be stored and configures the data such that instructions for storing the data are contained in at least one header that accompanies the data; a destination data mover that receives the data and the at least one header from the source data mover, the data arriving m chunks; and at least one storage device that is used to store the data that is generated by the software application. 17 The high speed data transfer mechanism for storing data of claim 16 wherein the source data movei configures the data such that instructions for storing the data are contained in both the at least one header and at least one footer.

Inventors: DEVASSEY VARGHESE, IGNATIUS PAUL, IYER SHANKAR I, PRAHLAD ANAND, TYAGARAJAN MAHESH, WU ROBERT, DEVASSEY, VARGHESE, IGNATIUS, PAUL, IYER, SHANKAR, I., PRAHLAD, ANAND, TYAGARAJAN, MAHESH, WU, ROBERT
Applicants: COMMVAULT SYSTEMS INC, COMMVAULT SYSTEMS, INC.
Application year: 2001
Main classification: G06F3
IPC codes: G06F3, H04L29