US 8,326,915 B2Grant
Pipeline systems and method for transferring data in a network environment
Issue Date:2012-12-04
•14 Claims
•12 Drawing Sheets
Abstract
A communications system having a data transfer pipeline apparatus for transferring data in a sequence of N stages from an origination device to a destination device. The apparatus comprises dedicated memory having buffers dedicated for carrying data and a master control for registering and controlling processes associated with the apparatus for participation in the N stage data transfer sequence. The processes include a first stage process for initiating the data transfer and a last Nth stage process for completing data transfer. The first stage process allocates a buffer from a predetermined number of buffers available within the memory for collection, processing, and sending of the data from the origination device to a next stage process. The Nth stage process receives a buffer allocated to the first stage process from the (N−1)th stage and to free the buffer upon processing completion to permit reallocation of the buffer.
Metadata
Assignee
- CommVault Systems, Inc.
Inventors
- Paul Ignatius
- Anand Prahlad
- Mahesh Tyagarajan
Application Information
Application Number:US 13/158,222
Filing Date:2011-06-10
Priority Date:1997-10-30
Art Unit:2448
Classifications
IPC:
G06F15/16G06F15/167
Patent Drawings (12 sheets)
Description
Related Applications
[0001] This application is a continuation of U.S. patent application Ser. No. 12/147,066 filed Jun. 26, 2008, which is a continuation of U.S. patent application Ser. No. 10/144,683, filed May 13, 2002, now U.S. Pat. No. 7,401,154, issued Jul. 15, 2008, which is a continuation 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 claims priority to U.S. Provisional Patent Application No. 60/063,831, entitled “HIGH SPEED DATA TRANSFER MECHANISM”, filed Oct. 30, 1997, each of which is hereby incorporated herein by reference in its entirety.
Background of the Invention
[0002] 1. Field of the Invention
[0003] The invention relates to data transfer mechanisms, and in particular, to a software-based, high speed data pipe 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 the 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.
Summary of the Invention
[0009] It is an object of the invention to provide 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 1, from said origination to said destination device, comprising: dedicated memory means having a predetermined number of buffers dedicated for carrying data associated with the transfer of data from said origination storage device to said destination device; and master control means for registering and controlling processes associated with said data transfer apparatus for participation in the N stage data transfer sequence, wherein said processes include at least a first stage process for initiating said data transfer and Nth stage process for completing data transfer, wherein said first stage process is operative to allocate a buffer from said predetermined number of buffers available within said dedicated memory means for collection, processing, and sending of said data from said origination device to a next stage process; and wherein said last Nth stage process is operative to receive a buffer allocated to said first stage process from the (N−1)th stage process in the data transfer sequence and to free said buffer upon processing completion and storage in the destination device to permit reallocation of said buffer, said master control means further including monitor means for monitoring the number of buffers from said pool of buffers allocated or assigned to particular processes in said pipeline, wherein said monitor means is operative to prevent allocation of further buffers to a particular process when said number of buffers currently allocated exceeds a predetermined threshold.
Brief Description of the Drawings
[0010] The invention will be better understood with reference to the following drawings, in which:
[0011] FIG. 1 is a block diagram of the data pipe architecture in accordance with the present invention.
[0012] FIG. 2A is a schematic of the data pipe transfer process on a single computer according to an embodiment of the invention.
[0013] FIG. 2B is a schematic of the data pipe transfer process on multiple computers according to another embodiment of the invention.
[0014] FIG. 2C is a schematic of the data pipe transfer buffer allocation process from a buffer pool stored in the shared memory according to an embodiment of the invention.
[0015] 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.
[0016] FIGS. 3A-3C illustrate various messages transferred between application processes and the master monitor process according to an embodiment of the invention.
[0017] FIGS. 4A and 4B illustrate schematics of the module attachment process to shared memory space in accordance with the present invention.
[0018] FIGS. 5A and 5B depict flow diagrams of the operation of the sequencer and resequencer processes according to the present invention.
[0019] FIG. 6 depicts an exemplary data transfer flow among various processing stages within the pipeline according to the present invention.
[0020] FIG. 7 illustrates a data pipe transfer process on multiple computers having processes with multiple instantiations according to an embodiment of the present invention.
Detailed Description of the Preferred Embodiment
[0021] 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 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.
[0022] 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 scaleability and performance of the basic pipeline concept.
[0023] 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.
[0024] 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.
[0025] 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.
[0026] 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.
[0027] 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:
-
- [0028] 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.
- [0029] 2. Use dedicated process/threads to perform network transfer.
- [0030] 3. Make all the dedicated tasks share a single large shared memory segment.
- [0031] 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.
- [0032] 5. Use semaphores (or other OS specific mutual exclusion or signaling primitives) to transfer control over the data segments between modules.
[0033] 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.
[0034] Referring to FIG. 1 , there is shown a disk 20 residing on a computer machine 30 which houses information or data to be backed up or archived to server computer 40 via DLT device drivers 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 resides 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.
[0035] As shown in FIG. 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 and 50. Similarly, a second DataPipe 80 is shown comprised of modules 82, 84, 76, 78 and 60. Note that if additional DLT 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. 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 in buffers residing in dedicated shared 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. Preferably, each network path runs at a rate equal to approximately 10 base T or the number of network paths utilized for each stream as determined by the bandwidth of the network. 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 driver 50 for storage at server 40. Thus, the final task of storing or archiving the data is accomplished at DLT device module 50.
[0036] From the preceding discussion, 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 as shown in FIG. 2A . One or more middle modules 20, 30 may exist, which processes the data by performing actions such as compression, encryption, content analysis, etc., or by allocating or not allocating new buffers while doing the processing.
[0037] 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., comprise middle processes, but the tail of this pipeline on this machine is a cluster of dedicated network agents 50A which send data across to the remote machine 12B via standard network protocols. On the remote machine, a cluster of dedicated network reader agents 50B act as the head, and along with other modules such as middle (not shown) and tail 70, constitute the pipeline on that machine.
[0038] 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 scaleability of a DataPipe is achieved by using multiple instances of each task in the pipeline.
[0039] 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.
[0040] 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.
[0041] 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.
[0042] 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.
[0043] Buffer Manipulation Primitives
[0044] 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.
[0045] 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.
[0046] To accomplish these above tasks, a master manager program called Master_Monitor executes in the preferred embodiment as a daemon on all process machines, listening on a well-known port, to serve 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_create( ) or a similar OS specific thread of control initiation mechanism. Master_Monitor will permit 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 the head or tail of any pipeline.)
[0047] DataPipe Initiation
[0048] Referring now to FIG. 3A in conjunction with FIGS. 1 and 2A-2D, 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.
[0049] 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 is passed along with this call so that the DataPipe is completely established across both machines.
[0050] Identification
[0051] 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.
[0052] Data Transfer Implementation
[0053] Allocation: Receive: Send: Free
[0054] Directing attention to FIG. 2C and FIGS. 4A and 4B , buffers are allocated using the call AllocBuf( ), from a common pool of buffers specified 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. 4A , 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.
[0055] As shown in FIGS. 4A and 4B , 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. Allocation is always performed done from the input queue of the first module or process. However, to ensure that no allocation task can unfairly consume buffers, allocation of buffers to each module is limited to a threshold value of Max—Buffers/NA, where NA is the number of allocators in the pipeline on this particular machine. These parameters are stored under control of the Master_Monitor program, which 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.
[0056] All FreeBuf( ) calls free their buffers into the input queue of 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 do a SendBuf( ). All other modules can Receive, Allocate, Send, and Free buffers. First stage modules always perform SendBuf( ) after they execute each AllocBuf( ).
[0057] Each queue 95 is associated with a semaphore to guarantee orderly access to shared memory and which gets triggered upon actions such as AllocBuf( ), ReceiveBuf( ), SendBuf( ) and FreeBuf( ). 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.
[0058] Referring again to FIG. 4A , upon allocation of a buffer by AllocBuf( ) or receipt of a buffer by ReceiveBuf( ), the buffer is taken off from the input queue and assigned to the module which performed the call. Upon completion of processing on this buffer, it is passed forward by mean of SendBuf( ) or FreeBuf( ) and the buffer is forwarded to its destination queue or it is freed for reuse by FreeBuf( ). AllocBuf( ) decrements the input queue semaphore of the first module and also decrements the semaphore which is the allocator Index for this particular module. Each FreeBuf( ) increments the allocator Index of the module who allocated this particular buffer. Information relevant to this operation is always available along with the buffer with which we are performing the free operation.
[0059] Attachments
[0060] 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.
[0061] Data Integrity
[0062] 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, 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.
[0063] Referring now to FIG. 5B , the resequencer receives a buffer (module 10) of data and determines the sequence number associated with that buffer (module 20). The buffer is then stored in internal memory (module 30) and a determination is made as to whether all preceding sequence numbers associated with buffers have been received and stored (module 40). Until then, the re-sequencer waits for the required predecessor buffers to show up at the input queue. When all predecessor buffers are available, these buffers are sent (module 50) to the next processor stage. The sequencer/re-sequencer process pairs thus ensure proper data sequencing across a set of network reader/writer modules having multiple instantiations of a particular process. 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.
[0064] 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.
[0065] Fairness
[0066] 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.
[0067] 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_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.
[0068] Control Messages
[0069] 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.
[0070] Status Monitoring
[0071] 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 entire pipeline is shut down safely by means of control message signaling.
[0072] Implementation
[0073] In a preferred embodiment, DataPipe is implemented on Sun Solaris or HP-UX operating systems and incorporated into Release 2.7 of CommVault System's Vault98 storage management product.
[0074] 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.
[0075] To set up the DataPipe the Master_Monitor for this is called giving it the name of the DataPipe and the names of the modules that will use the pipe (module 10).
[0076] Master_Monitor (Initiate_Pipe(Sample_pipe,A,B,C)). 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.
[0077] 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).
[0078] Module B then repeats if function by again calling ReceiveBuf( ) to obtain the next buffer from module A.
[0079] 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.
[0080] 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.
[0081] 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 is 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.
[0082] 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 show 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 send buff 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.
[0083] Salient Features
[0084] 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:
-
- [0085] 1. Its flexible nature—the modules that are plugged into a pipeline can be easily changed based on the application.
- [0086] 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.
- [0087] 3. It provides a well-defined mechanism for startup and shutdown of a pipeline and includes housekeeping and cleanup mechanisms provided via Master_Monitor.
- [0088] 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.
- [0089] 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.
- [0090] 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).
- [0091] 7. It allows for easy check pointing by virtue of a tail-head socket connection.
[0092] 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.
[0093] 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 or 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 pipeline system for providing data transfer between multiple computing devices, the pipeline system comprising:
a datapipe that spans multiple computing devices, the datapipe comprising a sequence of stages for transferring data from an origination computing device to a destination computing device, wherein the datapipe is identified on the origination computing device and the destination computing device with a data pipeline identifier;
one or more control modules configured to control at least a first stage of the sequence of stages on the origination computing device;
a first dedicated memory comprising a first pool of buffers, wherein the one or more control modules allocate at least a first buffer from the first pool of buffers to the first stage, and wherein the first buffer is associated with the data pipeline identifier until freed by the one or more control modules;
one or more of the control modules further configured to control at least a second stage of the sequence of stages on the destination computing device; and
a second dedicated memory comprising a second pool of buffers, wherein the one or more control modules allocate at least a second buffer from the second pool of buffers to the second stage, and wherein the second buffer is associated with the data pipeline identifier until freed by the one or more control modules.
2. The pipeline system of claim 1, wherein one of the stages in the sequence of stages comprises data compression.
3. The pipeline system of claim 1, wherein the first stage comprises: an input queue for receiving or allocating at least the first buffer of the first pool of buffers; and an output queue for sending or freeing the first buffer.
4. The pipeline system of claim 3, comprising an intermediate stage coupled to the first stage for stamping each buffer received from the first stage process with a sequence number prior to sending to a next stage.
5. The pipeline system of claim 4, wherein a subsequent stage includes a re-sequence processor reordering a buffer sequence received according to the sequence number.
6. The pipeline system of claim 1, wherein each of the first dedicated memory and the second dedicated memory further includes a plurality of semaphores each associated with a particular input/output queue for controlling access to the associated dedicated memory.
7. The pipeline system of claim 1, wherein the pool of buffers in each of the first dedicated memory and the second dedicated memory comprises buffers of equal size.
8. The pipeline system of claim 1, wherein a first control module is initiated via a request message from a requesting application process, the request message including a process identification and a timestamp.
9. A method for transferring data in a pipeline system, the method comprising:
registering and initiating a plurality of pipeline stages associated with a data transfer pipeline that spans multiple computing devices, wherein the data transfer pipeline is identified on an origination computing device and a destination computing device with a data pipeline identifier;
controlling at least a first stage of the sequence of stages on the origination computing device;
allocating at least a first buffer from a first pool of buffers in a first dedicated memory to the first stage of the plurality of pipeline stages, wherein the first buffer is associated with the data pipeline identifier until freed;
controlling at least a second stage of the sequence of stages on the destination computing device; and
allocating at least a second buffer from a second pool of buffers in a second dedicated memory to the second stage of the plurality of pipeline stages, wherein the second buffer is associated with the data pipeline identifier until freed.
10. The method of claim 9, additionally comprising transferring control of multiple ones of the buffers through the use of semaphores.
11. The method of claim 9, wherein the plurality of pipeline stages comprises a compression process and an encryption process.
12. The method of claim 9, additionally comprising storing data from the pool of second buffers to a storage device.
13. The method of claim 9, additionally comprising determining a number of buffers in the first pool of buffers to be allocated to the first stage.
14. The method of claim 13, additionally comprising terminating the first stage when the number of buffers allocated to the first stage exceeds a threshold amount.
Patent Citations (315)
| 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. | Examiner |
| 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. | Examiner |
| 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 | Examiner |
| US5448724(A) | 1995-09-01 | Hayashi | 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 | Examiner |
| 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. | Examiner |
| 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. | Examiner |
| 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. | Examiner |
| 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 | Rikieta 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 et al. | 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/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. | Examiner |
| 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 | Dairymple, 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 et al. | 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/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 (32)
- Jason Gait, The Optical File Cabinet: A Random-Access File System for Write-Once Optical Disks, Institute of Electrical and Electronics Engineers (IEEE) Computer, 1988, vol. 21, Issue 6, pp. 11-22.Applicant
- Szor, The Art of Virus Research and Defense, Symantec Press (2005) ISBN 0-321-30454-3.Applicant
- 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” IEEE, 1998, pp. 45-50.Applicant
- Cabrera et al., ADSM: A Multi-Platform, Scalable, Backup and Archive Mass Storage System, Digest of Papers of the Computer Society Conference, IEEE Comp. Soc. Press, Mar. 5, 1995, vol. Conf., pp. 420-427.Applicant
- Canadian Office Action, Application No. CA/2499073, dated Dec. 24, 2010.Applicant
- Canadian Office Action, Application No. CA/2499073, dated Oct. 7, 2009.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 Britian Office Action, Application No. GB/06116685, dated Nov. 14, 2006.Applicant
- http://en.wikipedia.org/wiki/Naive—Bayes—classifier, printed on Jun. 1, 2010, in 7 pages.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/75036, 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
- Written Opinion; International Application No. PCT/US05/40606; mailed Mar. 1, 2007; 5 pages.Applicant