US 8,370,542 B2Grant
Combined stream auxiliary copy system and method
Issue Date:2013-02-05
•8 Claims
•4 Drawing Sheets
Abstract
A system and method for transferring data in a library storage system. The library storage system comprises a management server including a storage policy. A media agent is connected to the management server. A plurality of storage media and a data source are connected to the media agent. The data source is divided into at least a first and a second portion of data. The portions of data are transferred from the data source to a first and second primary storage medium using a first and a second data stream respectively. The media agent then causes the first and second portion of data to be transferred from the first and second storage medium to a third auxiliary storage medium using a third combined data stream. Auxiliary copying is performed in chunks and multiple streams are copied in parallel.
Metadata
Assignee
- CommVault Systems, Inc.
Inventors
- Jun Lu
- Parag Gokhale
Application Information
Application Number:US 10/663,384
Filing Date:2003-09-16
Priority Date:2002-09-16
Art Unit:2184
Classifications
IPC:
G06F13/00
Patent Drawings (4 sheets)
Description
RELATED APPLICATIONS
[0001] This application claims priority to provisional application No. 60/411,202 filed Sep. 16, 2002, the entirety of which is hereby incorporated by reference.
[0002] This application is related to the following pending applications, each of which is hereby incorporated herein by reference in its entirety:
-
- [0003] application Ser. No. 09/610,738, titled MODULAR BACKUP AND RETRIEVAL SYSTEM USED IN CONJUNCTION WITH A STORAGE AREA NETWORK, filed Jul. 6, 2000;
- [0004] application Ser. No. 09/609,977, titled MODULAR BACKUP AND RETRIEVAL SYSTEM WITH AN INTEGRATED STORAGE AREA FILING SYSTEM, filed Jul. 5, 2000;
- [0005] application Ser. No. 09/354,058, titled HIERARCHICAL BACKUP AND RETRIEVAL SYSTEM, filed Jul. 15, 1999;
- [0006] application Ser. No. 09/774,268 titled LOGICAL VIEW AND ACCESS TO PHYSICAL STORAGE IN MODULAR DATA AND STORAGE MANAGEMENT SYSTEM, filed, Jan. 30, 2001; application Ser. No. 09/038,440, titled HIGH-SPEED DATA TRANSFER MECHANISM, filed Mar. 11, 1998; and
- [0007] application Ser. No. 10/303,640 titled SELECTIVE DATA REPLICATION SYSTEM AND METHOD, filed Nov. 25, 2002.
COPYRIGHT NOTICE
[0008] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosures, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
BACKGROUND OF THE INVENTION
[0009] 1. Field of the Invention
[0010] The invention relates to data storage in a computer network and, more particularly, to a system and method for optimizing storage operations.
[0011] 2. Description of Related Art
[0012] The GALAXY data storage management system software manufactured by COMMVAULT SYSTEMS, INC. of Oceanport, N.J., uses storage policies to direct how data is to be stored. Referring to FIG. 1 , there is shown a library storage system 100 in accordance with the prior art. Storage policies 20 in a management server 21 may be used to map copy data from a source 24, through a media agent 26 to a physical media location 28, 30, 32, 34, 36, 38 using e.g., tapes, drives, etc., where data is to be stored. Storage policies 20 are generally created at the time of installation of each media library, and/or stand alone drive. Numerous storage policies may be created and modified to meet storage management needs. A storage policy allows the user to define how, where, and the duration for which data should be stored without requiring intimate knowledge or understanding of the underlying storage architecture and technology. The management details of the storage operations are transparent to the user.
[0013] Storage policies 20 can be viewed as a logical concept that direct the creation of one or more copies of stored data with each copy being a self-contained unit of information. Each copy may contain data from multiple applications and from multiple clients or data sources. Within each copy are one or more archives, relating to a particular application. For example, one archive might contain log files related to a data store and another archive in the same copy might contain the data store itself.
[0014] Storage systems often have various levels of storage. A primary copy or data set, for example, indicates the default destination of storage operations for a particular set of data that the storage policy relates to and is tied to a particular set of drives. These drives are addressed independently of the library or media agent to which they are attached. In FIG. 1 , the primary drives are media 28, 30, 32, 34, 36 and 38. Clearly other forms of storage media could be used such as tapes or optical media. The primary data set might, for example, contain data that is frequently accessed for a period of one to two weeks after it is stored. A storage administrator might find storing such data on a set of drives with fast access times preferable. On the other hand, such fast drives are expensive and once the data is no longer accessed as frequently, the storage administrator might find it desirable to move and copy this data to an auxiliary or secondary copy data set on a less expensive tape library or other device with slower access times. Once the data from the primary data set is moved to the auxiliary data set, the data can be pruned from the primary data set freeing up drive space for new data. It is thus often desirable to perform an auxiliary storage operation after a primary data set has been created. In FIG. 1 , the auxiliary data set is copied to drives or tapes 40, 42 and 44.
[0015] Storage policies generally include a copy name, a data stream, and a media group. A primary copy name may be established by default whenever a storage policy for a particular client is created and contains the data directed to the storage policy. A data stream is a channel between the source of the data, such as data streams 50 and 52 in FIG. 1 and the storage media such as data streams 50 and 52 in FIG. 1 . Such a data stream is discussed in HIGH-SPEED DATA TRANSFER MECHANISM, Ser. No. 09/038,440 referenced above. To increase the speed of a copy, data to be backed-up is frequently divided into a plurality of smaller pieces of data and these pieces are sent to a plurality of storage media using their own respective data streams. In FIG. 1 , data from source 24 is broken into two portions and sent using streams 50,52 to media 28, 36.
[0016] A client's data is thereby broken down into a plurality of sub-clients. In FIG. 1 , media 28, 30, 32 and 34 may comprise a single media group and media 36 and 38 a second media group. A media group generally refers to a collection of one or more physical pieces of storage media. Only a single piece of media within the group is typically active at one time and data streams are sent to that media until it achieves full capacity. For example, data stream 50 will feed source data to medium 28 until it is full and then feed data to media 30. Multiple copies may be performed using multiple streams each directed to a respective media group using multiple storage policies.
[0017] Auxiliary copying, discussed in more detail in commonly owned application Ser. No. 10/303,640, denotes the creation of secondary copies, such as medium 40 or medium 42, of the primary copy. Since auxiliary copying involves multiple storage policies and data streams which each point to a particular media group, data is likely scattered over several pieces of media. Even data related to single stream copy operations might also be scattered over several media. Auxiliary copying is generally performed on a stream-by-stream basis and one stream at a time, in an attempt to minimize the number of times the primary media are mounted/unmounted. For example, for a copy of 10 pieces of primary media where four streams are used, auxiliary copying first entails copying all archive files of the first stream to a first set of auxiliary media, then the second stream to a second set of auxiliary media, etc. In FIG. 1 , an auxiliary copy of stream 50 is made using auxiliary stream 50a to medium 40 and, if needed, medium 42. Thereafter, an auxiliary copy of stream 52 is made using auxiliary stream 52a to medium 44.
[0018] An archive file, at least with respect to auxiliary copying, is generally copied from a first chunk of data to a last chunk. When an auxiliary copy operation is cancelled or suspended before all chunks of an archive file are successfully copied to the destination copy, the chunks successfully copied are generally discarded or overwritten later when the archive file is again copied to the same copy or medium. This is undesirable because it wastes time and resources to copy the same chunks repeatedly; it wastes media because useless data occupies the media until the media is reusable; and if the network is not stable, a large archive file may never be successfully copied.
[0019] Although the GALAXY data storage management system software provides numerous advantages over other data storage management systems, the process for restoring copied data may require access to several media, which involves multiple mounting/unmounting of media, thereby increasing the time necessary for a restoration. Additionally, although an effort is made to minimize the number of times media are mounted and unmounted, the stream-by-stream basis used in auxiliary copying does not minimize the number of mount/unmount times necessary for the auxiliary copy and does not minimize tape usage. For example, in FIG. 1 , media 40 and 44 may both be less then half full but both are needed to copy data through streams 50a, 52a using conventional techniques and both must be remounted for a restore. Performing auxiliary copying on a stream-by-stream basis is also generally a lengthy process. Finally, restarting a copy of an archive file that has been cancelled or suspended by always copying the first to the last chunk is inefficient with respect to media usage and the time necessary to complete a copy.
[0020] There is therefore a need in the art for a system and method for increasing the efficiency of storage management systems.
SUMMARY OF THE INVENTION
[0021] A system and method for transferring data in a library storage system. The library storage system comprises a media server including a storage policy. A media agent is connected to the media server. A plurality of storage media and a data source are connected to the media agent. The media agent divides the data source into at least a first and a second portion of data. The portions of data are transferred from the data source to a first and second primary storage medium using a first and a second data stream respectively. The media agent then causes the first and second portion of data to be transferred from the first and second storage medium to a third auxiliary storage medium using a third combined data stream. Auxiliary copying is performed in chunks and multiple streams are copied in parallel.
[0022] One aspect of the invention is a method for transferring data in a library storage system. The library storage system comprises a management server. A media agent is connected to the management server. A plurality of storage media are connected to the media agent and a data source is connected to the media agent. The method comprises dividing the data source into at least a first and a second portion of data. The method further comprises transferring the first and second portion of data from the data source to a first and second storage medium using a first and a second data stream respectively. The method still further comprises transferring the first and second portion of data from the first and second storage medium to a third storage medium using a third combined data stream.
[0023] Another aspect of the invention is a system for transferring data. The system comprises a data source, a media agent connected to the data source and a management server connected to the media agent. The system further comprises at least a first, second, and third storage medium connected to the media agent. The data source is divided into at least a first and a second portion of data. The media agent transfers the first and the second portion of data from the data source to the first and second storage medium using a first and second data stream respectively. The media agent transfers the first and second portion of data from the first and second storage medium to the third medium using a third combined data stream.
[0024] Still another aspect of the invention is a recording medium in a storage system with data stored thereon. The storage system comprises a management server, a media agent connected to the management server, a plurality of storage media connected to the media agent, and a data source connected to the media agent. The data is produced by splitting data source into at least a first and a second portion; transferring the first portion to a first storage medium using a first stream; transferring the second portion to a second storage medium using a second stream; and transferring the first and second portion of data from the first and second storage medium to a third storage medium using a third data stream.
[0025] Yet still another aspect of the invention is a method for transferring data in a storage system. The storage system comprises a management server, a media agent connected to the management server, a plurality of storage media connected to the media agent, and a data source connected to the media agent. The method comprises dividing the data source into at least a first and a second portion of data. The method further comprises transferring the first and second portion of data from the data source to a first number of pieces of storage media. The method further comprises transferring the first and second portion of data from the first number of pieces of storage media to a second number of pieces of storage media, the second number being less than the first number.
BRIEF DESCRIPTION OF THE DRAWINGS
[0026] FIG. 1 is a block diagram showing the operation of a library storage system in accordance with the prior art.
[0027] FIG. 2 is a block diagram showing the operation of a library storage system in accordance with the invention.
[0028] FIG. 3 is a flow chart detailing some of the operations of an embodiment of the invention.
DETAILED DESCRIPTION OF THE INVENTION
[0029] The efficiency of data storage management systems is increased in the invention by providing a system and method that combines data streams of one or more storage policies during an auxiliary copying operation. Combining data streams generally denotes copying or backing-up archive files associated with different streams, onto a single or a fewer number of streams, thereby minimizing the number of media required for an auxiliary copy operation and consequently reducing the number of mount/unmount times necessary.
[0030] Combining streams may be enabled by allowing a plurality of applications in a source to be copied to point to a single storage policy. Referring to FIG. 2 , there is shown a library storage system 200 in accordance with the invention. Data from a plurality of applications (e.g. EXCHANGE, WORD, EXCEL, etc.) from a source 25 is controlled via media agent 27 according to storage characteristics specified by a storage policy 19 in a management server 23. The data are each copied to a respective medium, such as a hard drive, tape, etc through streams 54, 56, and 57. For example, for a primary copy or storage of three applications, the data from each of the applications will be saved to tapes 58, 60, 62, 64, 66 and 68, respectively, through streams 54, 56, and 57 respectively, thereby requiring at least three tapes for the copy operation, i.e., tapes 58, 62, and 66. During the auxiliary copy operation which combines streams, the data on tapes 58, 62 and 66 are combined into fewer media—i.e., tape 70 and, only if needed, tape 72. This may be accomplished, for example, by a storage policy pointing to either the same or another media library for storing the auxiliary copies. Thus, the primary copy operation requires three tapes, but the auxiliary copy is reduced to one tape, assuming the capacity of one tape is sufficient to hold the data from the three applications.
[0031] The archive files may be given an application identification, e.g., appId (sub-client), and the files are copied by default in ascending order according to the appId in order to minimize the impact on restore speeds. Alternately, combining streams can be done stream-by-stream for the fastest copying times as discussed below.
[0032] In addition to combining data streams, data is copied to the auxiliary media 70, 72 in a logical order, such as in the order of the primary copy according to the date the primary archive files were created. In this way, the archive files of a copy may be copied together in a single medium, allowing users to more easily determine which medium contains a particular copy.
[0033] Combining streams helps in media recycling. For instance, assume that there are several primary copies on four media that correspond to four streams and archive pruning has pruned all but one copy. The remaining copy may still hold up the four media. If the primary copy is copied, job-by-job, into one stream to an auxiliary copy, the primary copy will be copied onto one medium and the other three primary media are then recyclable.
[0034] The option of combining data streams may be selected or specified as an optional copy method at the time a particular storage policy is created or defined. The combined data stream copy method may be applied to either synchronous data replication or selective data replication. Primary copies requiring multiple streams will generally not be copied to a medium with copies using combined streams. A copy made pursuant to a storage policy that combines streams generally cannot be changed into a copy that doesn't combine streams and vice versa.
[0035] A storage policy that combines streams includes a property, which may be selected or defined, that may be used for specifying the order for which data will be copied to media, e.g., a copy order. By default the copy order is in the order of application and job (explained below). This enhances efficiency with respect to restoring data from the copy. Alternately, the user may specify that the data be copied in the order of the stream number which is more efficient but yields a high penalty for restores.
[0036] The “order of application and job” technique works as follows. All copy jobs within a given instance/copySet are copied together, e.g., all jobs selected for each client, appType, and instance/copySet. The jobs, e.g., the archive files, are then copied in the ascending order of their archive file Identification (“Ids”). Once a job copy is started, all the job's archive files are copied together, even if those numbers are higher than other archive file Ids.
[0037] For example, if a copy set has two sub-clients with following archive files: (1) Sub-client 1: Job 1, archive file1 (“AF1”) created 2:00 pm, (2) Sub-client 2: Job 2, archive file 2 (“AF2”) created 3:00 pm, (3) Sub-client 1: Job 1, archive file 3 (“AF3”) created 4:00 pm (resumed and finished or a multi-archive file job like exchange database), and (4) Sub-client 1: Job 3, archive file 4 (“AF4”) created 5:00 pm. The copy order is AF1, AF3 (to finish Archive files of the job being copied), AF2, and AF4.
[0038] When a property or feature of the primary copy is changed or modified, the copy order of each auxiliary copy that combines streams may also be changed. For example, if the primary copy was copied on a non-magnetic medium and now will be copied on a magnetic medium, the copy order will automatically be set to in order of application and job for all secondary copies.
[0039] Otherwise, there will be generally no change in the copy order for the secondary copies. After the primary copy has been changed, the former primary copy by default will not combine data streams.
[0040] During the creation of a storage policy for a nonmagnetic media group or drive, the graphic user interface (“GUI”) includes a form element, e.g., check box, that allows the user to select the combine data stream option. The option is preferably checked OFF by default. Users can select the option by selecting or turning the feature ON in the Copy Policy interface screen in order to enable the combine data stream option.
[0041] If the combine data stream option is selected, the copy order property will be enabled which allows the user to select from one of two choices: in order of stream number and in order of application and job. For a storage policy or policies for auxiliary copies whose primary copy is saved or to be saved on magnetic media or drives, where the combine data stream option is selected, the copy order is preferably in order of application and job by default. Otherwise, the default copy order is in order of application and job. The copy order can be changed from one to the other at any time.
[0042] The GUI may display a message, such as a popup message, in the following situations:
-
- [0043] Where the primary copy is stored or to be stored on non-magnetic media or drives, if the user selects the combine data stream option or changes the copy order, the GUI warns the user about a higher amount of mount/unmount and tape seek activity during restores that will occur if the combine stream option is in order of stream number or during auxiliary copies if the option is in order of application and job.
- [0044] If the user tries to point a SQL or DB2 sub-client to a storage policy that has a copy with the combine data stream option selected, the GUI warns the user that the multi-stream SQL or DB2 copies will not be copied using combined streams.
- [0045] If a storage policy is pointed to by a SQL or DB2 sub-client and the user tries to create a new copy with the combine data stream option selected or tries to select the combine data stream option for an existing copy, the GUI warns the user that the multi-stream SQL or DB2 copies will not be copied to an existing copy using combined streams.
[0046] An archive manager is a computer program or instruction that manages archive operations, such as creating and updating a storage policy, and retrieving data related to a storage policy. The archive manager may be implemented as an application or module and resides on a reference storage manager or media agent. An archive manager is preferably embodied in an ArchiveManagerCS class that is implemented as an Application Program Interface (API). The class further interfaces with at least one database or table which preferably includes the details of storage policies, such as the copy name, data stream, media group, combine data stream properties, etc. The database or table includes values such as streamNum and flags, which indicate the selection of the combine data stream option. Additionally, the database or table may be accessed by other object classes, which may use the relevant data contained therein.
[0047] The stream number of an archive file copy is passed to a createCopy( ) method included in CVArchive. Additionally, an AuxCopyMgr process sends the stream number of an archive file copy to a remote auxCopy process in a CVA_COPYAFILE_REQ message.
[0048] All copies associated with a storage policy have the same number of streams, e.g., the maximum number of streams, of the storage policy. This does not mean that a library for each copy has to have the same number of drives. A primary copy needs enough drives to support multi-stream copy. An auxiliary copy that combines data streams actually needs only one drive for auxiliary copying and for data restoration. Consequently, the associated library can be a stand-alone drive. In order to take advantage of stream consolidation, users that select the combine stream option are allowed to create a storage policy pointing to a storage library with fewer auxiliary drives than copies.
[0049] Backup and synthetic full backups are allowed, which include a backup process writing the streamNum related to a storage policy into the archFileCopy table rather than archFile table when each archive file is created. The archive manager preferably handles this process.
[0050] A file system-like restore (involving indexing) includes one or more sub-clients. The sub-client restorations, may be performed serially, one at a time, in an arbitrary order or based on archive file location. For example, for each sub-client restore, archive files may be restored chronologically, such as in the order that the files were created. Alternatively or in addition, files may be restored, according to their offsets, such as restoring in order of offsets ascending within each archive file. Offset refers to the distance from a starting point, e.g., the start of a file. Movement within an archive file typically corresponds with higher physical offsets from the beginning of the archive file.
[0051] The archive files in a secondary or auxiliary copy that are created by combining data streams are by default ordered as required for restoration. Restore efficiency could therefore be better with the auxiliary copy than with the primary copy. With respect to combining data stream-by-stream, the order of the archive files on media holding an auxiliary copy, may not agree with the order the primary copies were created, which may require backwards tape movement during the restore. Backwards tape movement, the need to rewind, may be correctly handled by programming, such as by DATAMOVER software by GALAXY, during data restoration. Backward movement, however, has a negative impact on performance. A multi-stream ORACLE or INFORMIX copy can be restored from a single stream. However, backwards tape movement during the restore may occur.
[0052] It is preferred that a copy involving multiple streams will not be copied to a copy medium that combines streams. Single stream copies may be copied to a copy medium that combines streams.
[0053] Referring to FIG. 3 , there is shown a summary of the operations of the invention with respect to combining streams. At step S102, the storage policy is queried or the user is asked whether the combine streams option should be enabled in his copy. If the user answers no or the storage policy indicates no, control branches to step S112 and copying is performed as in the prior art. Otherwise, control branches to step S106, and the system determines whether the streams can be combined. For example, auxiliary copy of SQL data should be the same number of streams as the primary copy. If the streams cannot be combined, control branches to step S104, the user is informed that the streams cannot be combined, and copying is performed as in the prior art in step S12.
[0054] If the streams can be combined, control branches to step S108 and the data is backed up to the primary storage media using a desired number of streams. Thereafter, control branches to step S110 where the auxiliary copy is performed combining data streams.
Copy Restartable at Chunk
[0055] As stated above, in prior art auxiliary copying systems, auxiliary file copying restarts from a first chunk if the auxiliary copying was interrupted. This means if the copying operation is stopped in the middle, all copied chunks need to be copied again.
[0056] In the invention, auxiliary copying is performed such that data chunks of an archive file that have been successfully copied to a copy medium are not discarded and the copy operation resumes copying where the previous copying left off; auxiliary copy operations are restartable by a chunk, as opposed to restartable at archive file. Copying that is restartable at a chunk may be achieved with an API which calls a class that includes methods that do not delete the copied chunks. For example, the createArchFileCopy( ) method in the ArchiveManagerCS class may include an instruction so that the successfully copied chunks are not deleted. A method may further be included to retrieve the last chunk copied for each archive file to be copied, such as a getToBeCopiedAfilesByCopy( ) method in the ArchiveManagerCS class. Additionally, new fields may be added into the CVA_COPYAFILE_REQ, such as messagearchFileSeqNum, startChunkNum, startLogicalOffset and startPhysicalOffset fields.
[0057] The process for restarting a copy at chunks includes the AuxCopyMgr process checking if the archive file to be copied has chunks that were successfully copied to the copy media. If chunks have been copied successfully, the AuxCopyMgr process retrieves variables archFileSeqNum, startChunkNum, startLogicalOffset and startPhysicalOffset for the archive file and sends them to the AuxCopy process in the CVA_COPYAFILE_REQ message. For each stream of the destination copy, the AuxCopyMgr process starts copying from the archive file that has chunks that were successfully copied. The AuxCopy process calls CVArchive::createCopy( ) using the parameters archFileSeqNum, startChunkNum, startLogicalOffset and startPhysicalOffset. This allows AuxCopy to start writing or copying from the correct chunk and offset. The AuxCopy process may also call DataMover::Seek( ) with startPhysicalOffset as one of the input parameters to find the starting chunk and offset before the first DataMover::Read( ) call.
[0058] Additionally, the CVArchive::createCopy( ) API, which is used by AuxCopy, includes input parameters archFileSeqNum, startChunkNum, startLogicalOffset and startPhysicalOffset. When startChunkNum>1, the API does not send a CVA_CREATEAFILECOPY_REQ message to commServer for creating an archFileopy entry since there is one already. The API also uses the parameters passed in to it to call Pipelayer::create( ).
Multi-Stream Auxiliary Copy
[0059] In another aspect of the invention, methods and systems are provided which allow multi-stream auxiliary copying. In the prior art, auxiliary copying is performed one stream at a time no matter how many streams are used during a copy. The amount of time for copying a copy job is therefore proportional to the number of streams used during a copy. This is referred to as single-stream Auxiliary Copying.
[0060] In the invention, multi-stream Auxiliary Copying refers to performing auxiliary copies for a plurality of streams in parallel. This may be accomplished by providing a sufficient number of drives so that each stream may copy to at least one drive, thereby reducing the time necessary for auxiliary copies involving multiple streams. For example, in an instance where two drives are required for each stream (e.g., one source and one destination), the number of streams that can be copied at the same time is half of the number of available drives. If six streams were used for copy jobs, an auxiliary copy job can copy archive files for three streams at a time if there are six drives available, and can copy archive files for six streams at a time if there are twelve drives available, etc.
[0061] The process for multi-stream auxiliary copying includes the AuxCopyMgr process reserving more than one stream for the same destination copy or for multiple destination copies at same time. One stream is assigned to one destination copy at a time. If the AuxCopyMgr process has not reserved enough streams, the process will keep trying if some streams are temporarily not available. When a copy is done with a stream for a destination copy, the AuxCopyMgr first releases the stream then tries to reserve the next stream (the copy can be different). The AuxCopy process is able to run more than one worker thread that copies an archive file for a stream and each thread uses its own pipeline. When an Auxiliary Copy job is interrupted, stopped, or cancelled, the AuxCopy process stops all the worker threads and exits, and the AuxCopyMgr process releases all the streams and exits. If an AuxCopy process fails to copy for one stream, the worker thread reports the failure to AuxCopyMgr process and exits. The AuxCopy process continues to run until no work thread is running or is stopped by AuxCopyMgr. Depending on the nature of the failure, the AuxCopyMgr process decides whether it is necessary to stop copying archive files for all streams of a copy or stop copying archive files for all copies.
[0062] Thus, by combining streams in auxiliary copying, auxiliary copy operations are optimized. By allowing auxiliary copies to be performed by chunk, auxiliary copying may be performed more efficiently even if the copying is interrupted. By allowing for multiple stream auxiliary copies, auxiliary copying may be performed even more quickly than that available in the prior art.
[0063] Although the invention has been described in connection with the GALAXY data management system by way of example, it is understood that the disclosure may be applied to other data management systems, and references to the GALAXY system should therefore not be viewed as limitations.
[0064] While the invention has been described and illustrated in connection with preferred embodiments, many variations and modifications as will be evident to those skilled in this art may be made without departing from the spirit and scope of the invention, and the invention is thus not to be limited to the precise details of methodology or construction set forth above as such variations and modification are intended to be included within the scope of the invention.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method for transferring data in a multi-tiered storage system, the method comprising:
performing a first backup copy of data stored in a data source, wherein said performing of the first backup copy further comprises:
dividing the data in the data source into at least a first portion of data and a second portion of data, the data comprising multiple file types, and
transferring the first and second portions of data from the data source to a first storage medium and a second storage medium using a first data stream and a second data stream respectively to create the first backup copy of the data;
identifying the multiple file types of data in the first and second portions of data;
determining based at least upon the file types if the first portion of data and the second portion of data in the first backup copy can be combined;
if the first portion of data and the second portion of data can be combined, performing a second backup copy of the first and second portions of data, wherein the second backup copy saves the first and second portions of data in a combined format, wherein the performing of the second backup copy comprises:
transferring the first and second portions of the first backup copy of the data from the first and second storage mediums to a third storage medium by combining data streams from the first and second storage mediums, and
storing on the third storage medium, the additional copies of the data by storing in a combined format, the first and second portions of the first backup copy to create the second backup copy; and
restoring the first portion of data to the data source by retrieving the first portion of data from the combined format of the second backup copy.
2. The method as recited in claim 1, wherein the transfer from the first and second storage medium to the third storage medium is performed in chunks.
3. The method as recited in claim 1, wherein the transfer using the third data stream is performed based on a client identification of the first and second portion of data.
4. The method as recited in claim 1, wherein the transfer using the third data stream is performed based on respective stream numbers of the first and second streams.
5. A recording medium in a storage system with data stored thereon, the data produced by:
copying data from a data source to a plurality of storage media, wherein said copying comprises
splitting the data source data into at least a first and a second portion,
transferring the first portion to a first storage medium using a first stream,
transferring the second portion to a second storage medium using a second stream;
identifying file types of data in the first and second portions of data;
determining, based upon the file types, whether or not the first portion and the second portion are combinable into one or more data streams; and
transferring the first and second portion of data from the first and second storage medium to a third storage medium using a third combined data stream to create additional copies of the first and second portions of data wherein the additional copies store the first and second portions of data in a combined format; and
restoring the first portion of data by retrieving the first portion of data from the combined format of the additional copies stored in the third storage medium.
6. A method for transferring data in a storage system, the method comprising:
dividing a data source into at least a first and a second portion of data;
transferring the first and second portion of data from the data source to a first number of pieces of storage media;
accessing user input regarding whether the first and second portions of data should be combined;
determining if the first portion of data and the second portion of data are combinable based upon files types contained in the first and second portions of data; and
transferring the first and second portion of data from the first number of pieces of storage media to a second number of pieces of storage media, the second number being less than the first number to create additional copies of the first and second portions of data wherein the additional copies store the first and second portions of data in a combined format; and
restoring the first portion of data by retrieving the first portion of data from the combined format of the additional copies stored in the second number of pieces of storage media.
7. The method of claim 1, additionally comprising providing a user notification if the first portion of data and the second portion of data cannot be combined.
8. The method of claim 1, wherein the first portion of data is associated with a first application and the second portion of data is associated with a second application.
Patent Citations (324)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4296465(A) | 1981-10-01 | Lemak | Applicant |
| US4686620(A) | 1987-08-01 | Ng | Applicant |
| US4695943(A) | 1987-09-01 | Keeley et al. | Applicant |
| US4888689(A) | 1989-12-01 | Taylor et al. | Applicant |
| US4995035(A) | 1991-02-01 | Cole et al. | Applicant |
| US5005122(A) | 1991-04-01 | Griffin et al. | Applicant |
| US5062104(A) | 1991-10-01 | Lubarsky et al. | Applicant |
| US5093912(A) | 1992-03-01 | Dong et al. | Applicant |
| US5133065(A) | 1992-07-01 | Cheffetz et al. | Applicant |
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5193154(A) | 1993-03-01 | Kitajima et al. | Applicant |
| US5212772(A) | 1993-05-01 | Masters | Applicant |
| US5226157(A) | 1993-07-01 | Nakano et al. | Applicant |
| US5239647(A) | 1993-08-01 | Anglin et al. | Applicant |
| US5241668(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5241670(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5247616(A) | 1993-09-01 | Berggren et al. | Applicant |
| US5276860(A) | 1994-01-01 | Fortier et al. | Applicant |
| US5276867(A) | 1994-01-01 | Kenley et al. | Applicant |
| US5287500(A) | 1994-02-01 | Stoppani, Jr. | Applicant |
| US5301351(A) | 1994-04-01 | Jippo | Applicant |
| US5311509(A) | 1994-05-01 | Heddes et al. | Applicant |
| US5321816(A) | 1994-06-01 | Rogan et al. | Applicant |
| US5333315(A) | 1994-07-01 | Saether et al. | Applicant |
| US5347653(A) | 1994-09-01 | Flynn et al. | Applicant |
| US5377341(A) | 1994-12-01 | Kaneko et al. | Applicant |
| US5388243(A) | 1995-02-01 | Glider et al. | Applicant |
| US5410700(A) | 1995-04-01 | Fecteau et al. | Applicant |
| US5428783(A) | 1995-06-01 | Lake | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi et al. | Applicant |
| US5465359(A) | 1995-11-01 | Allen et al. | Applicant |
| US5487160(A) | 1996-01-01 | Bemis | Applicant |
| US5491810(A) | 1996-02-01 | Allen | Applicant |
| US5495607(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5504873(A) | 1996-04-01 | Martin et al. | Applicant |
| US5515502(A) | 1996-05-01 | Wood | Examiner |
| 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. | Examiner |
| US5615392(A) | 1997-03-01 | Harrison et al. | Applicant |
| US5619644(A) | 1997-04-01 | Crockett et al. | Applicant |
| US5638509(A) | 1997-06-01 | Dunphy et al. | Applicant |
| US5642496(A) | 1997-06-01 | Kanfi | Applicant |
| US5644779(A) | 1997-07-01 | Song | Applicant |
| US5651002(A) | 1997-07-01 | Van Seters et al. | Applicant |
| US5673381(A) | 1997-09-01 | Huai et al. | Examiner |
| US5675511(A) | 1997-10-01 | Prasad et al. | Applicant |
| US5680550(A) | 1997-10-01 | Kuszmaul et al. | Applicant |
| US5682513(A) | 1997-10-01 | Candelaria et al. | Applicant |
| US5687343(A) | 1997-11-01 | Fecteau et al. | Applicant |
| US5692152(A) | 1997-11-01 | Cohen et al. | Applicant |
| US5699361(A) | 1997-12-01 | Ding et al. | Applicant |
| US5719786(A) | 1998-02-01 | Nelson et al. | Applicant |
| US5729743(A) | 1998-03-01 | Squibb | Applicant |
| US5737747(A) | 1998-04-01 | Vishlitzky et al. | Applicant |
| US5751997(A) | 1998-05-01 | Kullick et al. | Applicant |
| US5758359(A) | 1998-05-01 | Saxon | Applicant |
| US5761104(A) | 1998-06-01 | Lloyd et al. | Applicant |
| US5761677(A) | 1998-06-01 | Senator et al. | Applicant |
| US5761734(A) | 1998-06-01 | Pfeffer et al. | Applicant |
| US5764972(A) | 1998-06-01 | Crouse et al. | Applicant |
| US5778395(A) | 1998-07-01 | Whiting et al. | Applicant |
| US5790828(A) | 1998-08-01 | Jost | Applicant |
| US5805920(A) | 1998-09-01 | Sprenkle et al. | Applicant |
| US5812398(A) | 1998-09-01 | Nielsen | Applicant |
| US5813008(A) | 1998-09-01 | Benson et al. | Applicant |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5813017(A) | 1998-09-01 | Morris | Applicant |
| US5815462(A) | 1998-09-01 | Konishi et al. | Applicant |
| US5829023(A) | 1998-10-01 | Bishop | Applicant |
| US5829046(A) | 1998-10-01 | Tzelnic et al. | Applicant |
| US5860104(A) | 1999-01-01 | Witt et al. | Applicant |
| US5875478(A) | 1999-02-01 | Blumenau | Applicant |
| US5875481(A) | 1999-02-01 | Ashton et al. | Applicant |
| US5878056(A) | 1999-03-01 | Black et al. | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5890159(A) | 1999-03-01 | Sealby et al. | Applicant |
| US5897643(A) | 1999-04-01 | Matsumoto | Applicant |
| US5901327(A) | 1999-05-01 | Ofek | Applicant |
| US5924102(A) | 1999-07-01 | Perks | Applicant |
| US5926836(A) | 1999-07-01 | Blumenau | Applicant |
| US5933104(A) | 1999-08-01 | Kimura | Applicant |
| US5936871(A) | 1999-08-01 | Pan et al. | Applicant |
| US5950205(A) | 1999-09-01 | Aviani, Jr. | Applicant |
| US5956519(A) | 1999-09-01 | Wise et al. | Applicant |
| US5958005(A) | 1999-09-01 | Thorne et al. | Applicant |
| US5970233(A) | 1999-10-01 | Liu et al. | Applicant |
| US5970255(A) | 1999-10-01 | Tran et al. | Applicant |
| US5974563(A) | 1999-10-01 | Beeler, Jr. | Applicant |
| US5987478(A) | 1999-11-01 | See et al. | Applicant |
| US5995091(A) | 1999-11-01 | Near et al. | Applicant |
| US5999629(A) | 1999-12-01 | Heer et al. | Applicant |
| US6003089(A) | 1999-12-01 | Shaffer et al. | Applicant |
| US6009274(A) | 1999-12-01 | Fletcher et al. | Applicant |
| US6012090(A) | 2000-01-01 | Chung et al. | Applicant |
| US6021415(A) | 2000-02-01 | Cannon et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6041334(A) | 2000-03-01 | Cannon | Applicant |
| US6052735(A) | 2000-04-01 | Ulrich et al. | Applicant |
| US6058494(A) | 2000-05-01 | Gold et al. | Applicant |
| US6076148(A) | 2000-06-01 | Kedem | 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 | Koseki 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. | Examiner |
| 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 |
| 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 |
| 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 | Palliyil 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/0004883(A1) | 2002-01-01 | Nguyen et al. | Applicant |
| US2002/0029281(A1) | 2002-03-01 | Zeidner et al. | Applicant |
| US2002/0040405(A1) | 2002-04-01 | Gold | Applicant |
| US2002/0042869(A1) | 2002-04-01 | Tate et al. | Applicant |
| US2002/0042882(A1) | 2002-04-01 | Dervan et al. | Applicant |
| US2002/0049778(A1) | 2002-04-01 | Bell et al. | Applicant |
| US2002/0065967(A1) | 2002-05-01 | MacWilliams et al. | Applicant |
| US2002/0107877(A1) | 2002-08-01 | Whiting et al. | Applicant |
| US2002/0129203(A1) | 2002-09-01 | Gagne et al. | Applicant |
| US2002/0194340(A1) | 2002-12-01 | Ebstyne et al. | Applicant |
| US2002/0198983(A1) | 2002-12-01 | Ullmann et al. | Applicant |
| US2003/0014433(A1) | 2003-01-01 | Teloh et al. | Applicant |
| US2003/0016609(A1) | 2003-01-01 | Rushton et al. | Applicant |
| US2003/0061491(A1) | 2003-03-01 | Jaskiewicz et al. | Applicant |
| US2003/0066070(A1) | 2003-04-01 | Houston | Applicant |
| US2003/0079112(A1) | 2003-04-01 | Sachs et al. | Applicant |
| US2003/0169733(A1) | 2003-09-01 | Gurkowski et al. | Applicant |
| US2004/0073716(A1) | 2004-04-01 | Boom et al. | Applicant |
| US2004/0088432(A1) | 2004-05-01 | Hubbard et al. | Applicant |
| US2004/0107199(A1) | 2004-06-01 | Dairymple et al. | Applicant |
| US2004/0193953(A1) | 2004-09-01 | Callahan et al. | Applicant |
| US2004/0210796(A1) | 2004-10-01 | Largman et al. | Examiner |
| 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 | Examiner |
| 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 | |
| EP259912 | 1988-03-01 | Applicant | |
| EP405926 | 1991-01-01 | Applicant | |
| EP405926 | 1991-01-01 | Applicant | |
| EP467546 | 1992-01-01 | Applicant | |
| EP467546 | 1992-01-01 | Applicant | |
| EP774715 | 1997-05-01 | Applicant | |
| EP809184 | 1997-11-01 | Applicant | |
| EP809184 | 1997-11-01 | Applicant | |
| EP862304 | 1998-09-01 | Applicant | |
| EP899662 | 1999-03-01 | Applicant | |
| EP899662 | 1999-03-01 | Applicant | |
| EP981090 | 2000-02-01 | Applicant | |
| EP981090 | 2000-02-01 | Applicant | |
| EP1174795 | 2002-01-01 | Applicant | |
| EP1115064 | 2004-12-01 | Applicant | |
| GB2366048 | 2002-02-01 | Applicant | |
| WO95/13580 | 1995-05-01 | Applicant | |
| WO98/39707 | 1998-09-01 | Applicant | |
| WO98/39709 | 1998-09-01 | Applicant | |
| WO99/12098 | 1999-03-01 | Applicant | |
| WO99/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 (36)
- Armstead et al., “Implementation of a Campus-wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199.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, vol. Conf. (Mar. 5, 1995), pp. 420-427.Applicant
- Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72.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
- Jason 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) (see in particular figure 5 in p. 15 4nd the recitation in claim 5).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
- Arneson, “Development of Omniserver; Mass Storage Systems,” Control Data Corporation, 1990, pp. 88-93.Applicant
- Ashton, et al., “Two Decades of policy-based storage management for the IBM mainframe computer”, www.research.ibm.com, 19 pages, published Apr. 10, 2003, printed Jan. 3, 2009., www.research.ibm.com, Apr. 10, 2003, pp. 19.Applicant
- 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 Apr. 12, 2005.Applicant
- International Search Report and Written Opinion dated Nov. 13, 2009, PCT/US2007/081681.Applicant
- International Search Report, PCT/US2001/002931, dated Jun. 3, 2002.Applicant
- Israeli Office Action, Application No. IL/175036, dated Jul. 6, 2010.Applicant
- Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72.Applicant
- Recycle Bin (Windows), Aug. 2007, Wikipedia, pp. 1-3.Applicant
- Szor, The Art of Virus Research and Defense, Symantec Press (2005) ISBN 0-321-30454-3.Applicant
- Witten et al., Data Mining: Practical Machine Learning Tools and Techniques, Ian H. Witten & Eibe Frank, Elsevier (2005) ISBN 0-12-088407-0.Applicant
- Written Opinion; International Application No. PCT/US05/40606; mailed Feb. 14, 2007; 5 pages.Applicant
- Written Opinion; International Application No. PCT/US05/40606; mailed Mar. 1, 2007; 5 pages.Applicant