US 9,002,785 B2Grant
Stubbing systems and methods in a data replication environment
Issue Date:2015-04-07
•18 Claims
•9 Drawing Sheets
Abstract
Stubbing systems and methods are provided for intelligent data management in a replication environment, such as by reducing the space occupied by replication data on a destination system. In certain examples, stub files or like objects replace migrated, de-duplicated or otherwise copied data that has been moved from the destination system to secondary storage. Access is further provided to the replication data in a manner that is transparent to the user and/or without substantially impacting the base replication process. In order to distinguish stub files representing migrated replication data from replicated stub files, priority tags or like identifiers can be used. Thus, when accessing a stub file on the destination system, such as to modify replication data or perform a restore process, the tagged stub files can be used to recall archived data prior to performing the requested operation so that an accurate copy of the source data is generated.
Metadata
Assignee
- CommVault Systems, Inc.
Inventors
- Anand Prahlad
- Vijay H. Agrawal
Application Information
Application Number:US 13/955,445
Filing Date:2013-07-31
Priority Date:2010-03-30
Art Unit:2158
Classifications
IPC:
G06F17/00G06F7/00G06F17/30
Field of Search:
G06F 17/30156G06F 3/0649G06F 3/067G06F 3/065G06F 11/1448G06F 11/1469G06F 17/30194G06F 3/0685
Patent Drawings (9 sheets)
Description
Related Applications
[0001] This application is a continuation of U.S. application Ser. No. 12/750,067, filed on Mar. 30, 2010 and entitled “STUBBING SYSTEMS AND METHODS IN A DATA REPLICATION ENVIRONMENT,” which is related to the following U.S. patent applications filed on Mar. 30, 2013, each of which is hereby incorporated herein by reference in its entirety:
-
- [0002] U.S. application Ser. No. 12/749,949, entitled “Stub File Prioritization in a Data Replication System”; and
- [0003] U.S. application Ser. No. 12/749,953, entitled “Data Restore Systems and Methods in a Replication Environment”.
Background
[0004] 1. Field
[0005] The present disclosure relates to performing copy and/or data management operations in a computer network and, in particular, to systems and methods for managing stub files in a data replication system.
[0006] 2. Description of the Related Art
[0007] Computers have become an integral part of business operations such that many banks, insurance companies, brokerage firms, financial service providers, and a variety of other businesses rely on computer networks to store, manipulate, and display information that is constantly subject to change. Oftentimes, the success or failure of an important transaction may turn on the availability of information that is both accurate and current. Accordingly, businesses worldwide recognize the commercial value of their data and seek reliable, cost-effective ways to protect the information stored on their computer networks.
[0008] To address the need to maintain current copies of electronic information, certain data replication systems have been provided to “continuously” copy data from one or more source machines to one or more destination machines. These continuous data replication (CDR) systems provide several advantages for disaster recovery solutions and can substantially reduce the amount of data that is lost during an unanticipated system failure.
[0009] One drawback of such CDR systems is that synchronization of the source and destination machines generally requires the same amount of storage space on both the source and destination. Thus, not only do many conventional CDR systems require large amounts of disk space, but they also tend to be less useful for general data backup purposes.
Summary
[0010] In view of the foregoing, a need exists for improved systems and methods for the managing replication data in a storage system, such as a CDR system. For example, there is a need for conserving disk space on a destination storage device, while maintaining the ability to provide sufficient and timely recovery of the replicated data. Moreover, there is a need for providing user access to the replicated data in a manner that is transparent to the user and/or without substantially impacting the CDR, or other replication, process.
[0011] In certain embodiments of the invention disclosed herein, stubbing systems and methods are provided for destination storage devices in a CDR system. For instance, data on a destination storage device can be selectively moved to secondary storage based on archive, de-duplication, or other storage policies, to free up space on the destination system.
[0012] For example, certain embodiments of the invention involve the de-duplication, or single-instancing, of replication data. In such systems, de-duplicated data blocks on the replication storage device can be replaced with substantially smaller stub files that serve as pointers to, or placeholders for, the actual data. In certain embodiments, a data migration module of the replication system periodically examines the replication data to identify common blocks that have not been accessed for a period of time and that can be replaced by smaller stub files, while a copy of the actual data is archived to secondary storage, such as a less-expensive medium or the like.
[0013] In order to distinguish the stub files representing migrated replication data from original stub files that have been replicated from the source system, certain embodiments of the invention use priority tags. Thus, when accessing a stub file on the destination system, such as to modify the replication data or to perform a system restore process, the tagged stub files can be used to recall the archived data prior to performing the requested operation so that an accurate replica of the source data can be compiled.
[0014] Certain embodiments of the invention include a method for performing data management operations on replicated data of a destination storage device. The method includes processing, with one or more routines, at least one log file having a plurality of log entries indicative of operations generated by a computer application executing on a source system, the operations being directed to data on a source storage device. The method further includes replaying, with the one or more routines, the operations on a destination storage device to modify replication data on the destination storage device, wherein said replaying further comprises: (i) identifying a plurality of stub files within the replication data, wherein the plurality of stub files comprises one or more first stub files each comprising a predetermined tag value, and wherein the plurality of stub files further comprises one or more second stub files that do not comprise the predetermined tag value; (ii) for each of the one or more first stub files, recalling from a secondary storage one or more data objects represented by each of the one or more first stub files and replacing each of the one or more first stub files with the corresponding data object prior to modifying the replication data; and (iii) modifying the replication data on the destination storage device to match the data on the source storage device.
[0015] Certain embodiments of the invention further include a destination system for performing data replication in a computer network. The destination system comprises a destination storage device, at least one replication log file, a replication module and a migration module. The destination storage device stores replication data having a plurality of stub files, the plurality of stub files comprising one or more first stub files each having at least one predetermined tag value and one or more second stub files that do not have the at least one predetermined tag value. The at least one replication log file comprises a plurality of log entries indicative of data operations generated by a computer application for execution on a source storage device. A replication module traverses the plurality of log entries in the replication log file(s) and copies the log entries to execute the data operations on replication data of the destination storage device. The migration module restores copied data from a secondary storage device to the destination storage device based on the one or more first stub files. In certain embodiments, the replication module is further configured to identify the first stub file(s) and instruct the migration module to replace the first stub file(s) with the copied data from the secondary storage device prior to executing the data operations on the replication data.
[0016] In certain embodiments, a destination system is disclosed for performing data replication in a computer network. The destination system comprises means for storing replication data having a plurality of stub files, the plurality of stub files comprising one or more first stub files each comprising at least one predetermined tag value and one or more second stub files that do not comprise the at least one predetermined tag value. The system further includes means for receiving a plurality of log entries indicative of data operations generated by a computer application for execution on a source storage device, and means for traversing the plurality of log entries in the receiving means and for copying the log entries to execute the data operations on replication data of the storing means. The system further includes means for restoring copied data from a secondary storage device to the storing means based on the first stub file(s). Furthermore, the traversing means can identify the first stub file(s) and instruct the restoring means to replace the first stub file(s) with the copied data from the secondary storage device prior to executing the data operations on the replication data.
[0017] In certain embodiments, a method is disclosed for performing data management operations in a computer network. The method includes monitoring operations associated with a source computing device, the operations operative to write data to a source storage device. The method further includes copying the data to a destination storage device based at least in part on the operations, the data comprising at least one first stub file, and scanning the data of the destination storage device to identify a common data object repeated between multiple portions of the data on the destination storage device. The method also includes archiving a copy of the common data object on a second storage device and determining a last access time of each of the multiple data portions of the destination storage device having the common data object. For each of the multiple data portions having a last access time at or before the time of the archiving of the copy of the common data object, the method includes replacing the common data object of the particular data portion with a second stub file, wherein the second stub file comprises a tag value not possessed by any of the first stub file(s), and wherein the second stub file comprises information indicative of a location of the copy of the common data object.
[0018] In further embodiments, a continuous data replication system is disclosed that comprises a first storage device, at least one monitoring module, a replication module and a migration module. The first storage device stores data write operations from at least one computer application at a first location, the first location comprising at least one first stub file. The at least one module monitors the data write operations and generates first log entries based on the data write operations. The second storage device comprises second log entries, wherein the second log entries comprise copies of at least a portion of the first log entries. The replication module is in communication with the second storage device and is configured to process the second log entries to modify replicated data stored in a second location to substantially mirror the data of the first location, the replicated data comprising a copy of the first stub file(s). The migration module is configured to archive select data objects of the replicated data to a third location and to replace each of the select data objects of the replicated data with a second stub file, wherein each of the second stub files comprises an identifier not possessed by the first stub file(s) and wherein each of the second stub files comprises information indicative of a location of the archived copy of the data object at the third location.
[0019] In certain embodiments a continuous data replication system is disclosed that comprises means for storing data write operations from at least one computer application at a first location, the first location comprising at least one first stub file. The replication system further includes means for monitoring the data write operations and for generating first log entries based on the data write operations and also means for receiving second log entries, wherein the second log entries comprise copies of at least a portion of the first log entries. The replication system further includes means for processing the second log entries to modify replicated data stored in a second location to substantially mirror the data of the first location, the replicated data comprising a copy of the first stub file(s), and means for archiving select data objects of the replicated data to a third location and for replacing each of the select data objects of the replicated data with a second stub file, wherein each of the second stub files comprises an identifier not possessed by the first stub file(s) and wherein each of the second stub files comprises information indicative of a location of the archived copy of the data object at the third location.
[0020] In certain further embodiments, a method is disclosed for restoring data in a continuous data replication system. The method includes receiving, with a first computing device, a request to restore data of one or more snapshots of replication data of a destination storage device, the replication data having first stub files replicated from a source system and second stub files indicative of select data blocks of the replication data copied to a secondary storage device from the destination storage device. The method further includes mounting the snapshot(s); identifying the second stub files captured by the snapshot(s); and recalling to a staging area the select data blocks from the secondary storage device corresponding to each of the identified second stub files. In addition, the method includes, following said recalling, restoring the replication data from the snapshot(s), the restored data comprising each of the first stub files and comprising none of the second stub files.
[0021] In certain embodiments, a system is disclosed for restoring data in a continuous data replication environment. The system includes a first storage device comprising data replicated from a source storage system, the replicated data comprising first stub files replicated from the source storage system and second stub files indicative of select data blocks of the replicated data copied to a secondary storage device. The system also includes a restore module configured to mount a snapshot of the replicated data, the snapshot representing a point-in-time image of the replicated data, wherein the restore module is further configured to identify the second stub files captured by the snapshot(s). The system further includes a migration module in communication with the restore module, the migration module being configured to recall to a staging area the select data blocks from the secondary storage device corresponding to each of the identified second stub files. Moreover, in certain embodiments, the restore module is configured to restore the replication data represented by the snapshot, the restored data comprising each of the first stub files and comprising none of the second stub files.
[0022] In certain embodiments, a system is disclosed for restoring data in a continuous data replication environment. The system comprises means for storing data replicated from a source storage system, the replicated data comprising first stub files replicated from the source storage system and second stub files indicative of select data blocks of the replicated data copied to a secondary storage device. The system also comprises means for mounting a snapshot of the replicated data, the snapshot representing a point-in-time image of the replicated data, wherein the mounting means further identifies the second stub files captured by the one or more snapshots. Moreover, the system comprises means for recalling to a staging area the select data blocks from the secondary storage device corresponding to each of the identified second stub files, and wherein the mounting means further restores the replication data represented by the snapshot, the restored data comprising each of the first stub files and comprising none of the second stub files.
[0023] For purposes of summarizing the disclosure, certain aspects, advantages and novel features of the inventions have been described herein. It is to be understood that not necessarily all such advantages may be achieved in accordance with any particular embodiment of the invention. Thus, the invention may be embodied or carried out in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other advantages as may be taught or suggested herein.
Brief Description of the Drawings
[0024] FIG. 1 illustrates a block diagram of a data replication system, according to certain embodiments of the invention.
[0025] FIG. 2 illustrates a block diagram of an exemplary embodiment of a destination system of the data replication system of FIG. 1 .
[0026] FIG. 3 illustrates an exemplary de-duplication stub file usable with the destination system of FIG. 2 .
[0027] FIGS. 4-6 illustrate flowcharts of an exemplary embodiment of a de-duplication method for destination data of a CDR system, such as the data management system of FIG. 1 . In particular, FIG. 4 illustrates a flowchart of an exemplary embodiment of a scan process of the de-duplication method; FIG. 5 illustrates a flowchart of an exemplary embodiment of an archive process of the de-duplication method; and FIG. 6 illustrates a flowchart of an exemplary embodiment of a stubbing process of the de-duplication method.
[0028] FIG. 7 illustrates a flowchart of an exemplary embodiment of a synchronization process usable by the data replication system of FIG. 1 .
[0029] FIG. 8 illustrates a flowchart of an exemplary embodiment of a restore process usable by the data replication system of FIG. 1 .
Detailed Description of the Preferred Embodiments
[0030] As will be seen from the disclosure herein, systems and methods are provided for intelligent and efficient data management. For instance, certain embodiments of the invention provide for improved CDR systems that reduce the amount of space required for replication data on a destination system. Such systems can utilize stub files or the like to replace migrated, de-duplicated or otherwise copied data that has been moved from the destination system to secondary storage. Disclosed systems and methods further provide access to the replication data in a manner that is transparent to the user and/or without substantially impacting the CDR, or like replication, process.
[0031] In certain examples, embodiments of the invention are directed to the de-duplication, or single-instancing, of replication data. In such systems, de-duplicated data blocks on the destination storage device can be replaced with stub files that serve as pointers to the storage locations of the actual data. For instance, like stub files can be used to reference the same common data block that has been de-duplicated from the destination system. In certain embodiments, a migration module on the destination system periodically examines the replication data to identify the common data blocks that have not been accessed for a period of time and that can be replaced by the smaller stub file, while a copy of the actual data is archived to secondary storage.
[0032] In order to distinguish stub files representing migrated replication data from original stub files that have been replicated from the source system, embodiments of the invention can advantageously utilize priority tags or like identifiers. Thus, when accessing a stub file on the destination system, such as to modify the replication data or to perform a system restore process, the tagged stub files can be used to recall the archived data prior to performing the requested operation so that an accurate replica of the source data is generated.
[0033] Embodiments of the invention can also be used to restore data from one or more snapshots that represent replicated data in a “known good,” “stable” or “recoverable” state, even when the snapshots comprise one or more stub files. Certain tags or other priority identifiers can be used to distinguish the stub files that represent migrated replication data from those stub files that had been replicated from a source machine.
[0034] The features of the systems and methods will now be described with reference to the drawings summarized above. Throughout the drawings, reference numbers are re-used to indicate correspondence between referenced elements. The drawings, associated descriptions, and specific implementation are provided to illustrate embodiments of the invention and not to limit the scope of the disclosure.
[0035] In addition, methods and functions described herein are not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined into a single block or state.
[0036] FIG. 1 illustrates a block diagram of a data management or replication system 100 according to certain embodiments of the invention. In general, the data replication system 100 can engage in continuous data replication between source and destination device(s), such that the replicated data is substantially synchronized with data on the source device(s). Moreover, the data replication system 100 advantageously provides for further migration of the destination data, such as based on de-duplication or other storage policies, to conserve available disk space of the destination system. In doing so, the data replication system 100 is advantageously configured to identify replication data that has been migrated and to account for the migrated data when engaging in additional data management operations, such as when modifying and/or restoring replication data.
[0037] As shown in FIG. 1 , the data replication system 100 comprises a source system 102 capable of communicating with a destination system 104 by sending and/or receiving data over a network 106. For instance, in certain embodiments, the destination system 104 receives and/or stores a replicated copy of at least a portion of data, such as application-specific data, associated with the source system 102, such as on a source storage device 112.
[0038] The illustrated network 106 advantageously comprises any means for communicating data between two or more systems or components. It certain embodiments, the network 106 comprises a computer network. For example, the network 106 may comprise a public network such as the Internet, a virtual private network (VPN), a token ring or TCP/IP based network, a wide area network (WAN), a local area network (LAN), an intranet network, a point-to-point link, a wireless network, a cellular network, a wireless data transmission system, a two-way cable system, an interactive kiosk network, a satellite network, a broadband network, a baseband network, combinations of the same or the like. In embodiments wherein the source system 102 and destination system 104 are part of the same computing device, the network 106 may represent a communications socket or other suitable internal data transfer path or mechanism.
[0039] In certain embodiments, the source system 102 can comprise any computing device or means for processing data and includes, for example, a server computer, a workstation, a personal computer, a cell phone, a portable computing device, a handheld computing device, a personal digital assistant (PDA) or the like.
[0040] As shown, the source system 102 comprises one or more applications 108 residing on and/or being executed by a computing device. For instance, the applications 108 may comprise software applications that interact with a user to process data and may include, for example, database applications (e.g., SQL applications), word processors, spreadsheets, financial applications, management applications, e-commerce applications, browsers, combinations of the same or the like. For example, in certain embodiments, the applications 108 may comprise one or more of the following: MICROSOFT EXCHANGE, MICROSOFT SHAREPOINT, MICROSOFT SQL SERVER, ORACLE, MICROSOFT WORD and LOTUS NOTES.
[0041] The source system 102 further comprises one or more processes, such as filter drivers 110, that interact with data (e.g., production data) associated with the applications 108 to capture information usable to replicate application data to the destination system 104. For instance, the filter driver 110 may comprise a file system filter driver, an operating system driver, a filtering program, a data trapping program, an application, a module of the application 108, an application programming interface (“API”), or other like software module or process that, among other things, monitors and/or intercepts particular application requests targeted at a file system, another file system filter driver, a network attached storage (“NAS”), a storage area network (“SAN”), mass storage and/or other memory or raw data. In some embodiments, the filter driver 110 may reside in the I/O stack of the application 108 and may intercept, analyze and/or copy certain data traveling from the application 108 to a file system.
[0042] In certain embodiments, the filter driver 110 may intercept data modification operations that include changes, updates and new information (e.g., data writes) with respect to application(s) 108 of interest. For example, the filter driver 110 may locate, monitor and/or process one or more of the following with respect to a particular application 108, application type or group of applications: data management operations (e.g., data write operations, file attribute modifications), logs or journals (e.g., NTFS change journal), configuration files, file settings, control files, other files used by the application 108, combinations of the same or the like. In certain embodiments, such data may also be gathered from files across multiple storage systems within the source system 102. Furthermore, the filter driver 110 may be configured to monitor changes to particular files, such as files identified as being associated with data of the application(s) 108.
[0043] In certain embodiments, multiple filter drivers 110 may be deployed on a computing system, each filter driver being dedicated to data of a particular application 108. In such embodiments, not all information associated with the client system 102 may be captured by the filter drivers 110 and, thus, the impact on system performance may be reduced. In other embodiments, the filter driver 110 may be suitable for use with multiple application types and/or may be adaptable or configurable for use with multiple applications 108. For example, one or more instances of customized or particular filtering programs may be instantiated based on application specifics or other needs or preferences.
[0044] The illustrated source system 102 further comprises the source storage device 112 for storing production data of the application(s) 108. The source storage 112 may include any type of physical media capable of storing electronic data. For example, the source storage 112 may comprise magnetic storage, such as a disk or a tape drive, or other type of mass storage. In certain embodiments, the source storage 112 may be internal and/or external to (e.g., remote to) the computing device(s) having the applications 108 and the filter drivers 110. In yet other embodiments, the source storage 112 can include a NAS or the like.
[0045] In yet other embodiments, the source storage 112 can comprise one or more databases and database logs. For instance, in certain embodiments, database transactions directed to the source storage 112 may be first written to a file in the database logs and subsequently committed to the database in accordance with data management techniques for enhancing storage operation performance.
[0046] As further illustrated in FIG. 1 , the destination system 104 comprises a replication module 114 and a destination storage device 116. In certain embodiments, the replication module 114 is configured to monitor and/or manage the copying of data from the source system 102 to the destination system 104, such as data associated with the information obtained by the filter drivers 110. For example, the replication module 114 can comprise any computing device capable of processing data and includes, for example, a server computer, a workstation, a personal computer or the like. In yet other embodiments, the replication module 114 is a “dumb” server or terminal that receives and executes instructions from the source system 102.
[0047] The destination storage 116 may include any type of physical media capable of storing electronic data, such as replication data sent from the source system 102. For example, the destination storage 116 may comprise magnetic storage or other type(s) of mass storage. In certain embodiments, the destination storage 116 may be internal and/or external to the computing device(s) having the replication module 114.
[0048] In certain embodiments, the source storage 112 and/or the destination storage 116 may be implemented as one or more storage “volumes” that include physical storage disks defining an overall logical arrangement of storage space. For instance, disks within a particular volume may be organized as one or more groups of redundant array of independent (or inexpensive) disks (RAID). In certain embodiments, either or both of the storage devices 112, 116 may include multiple storage devices of the same or different media.
[0049] As shown, the data replication system 100 further includes a data migration module 118 in communication with the destination storage 116. In general, the migration module 118 is configured to copy, or migrate, data from the destination storage 116 to a secondary storage 120. For example, the migration module 118 can selectively archive, back up or otherwise copy certain portions of the replication data on the destination storage 116 to the secondary storage 120. In certain embodiments, the migration module 118 is further configured to truncate data on the destination storage 116.
[0050] In certain embodiments, the migration module 118 is configured to perform file or block-level single instancing, or de-duplication, of the data stored on the destination storage 116. Examples of single instancing methods and structures usable with embodiments of the invention are discussed in U.S. patent application Ser. No. 12/145,342, filed Jun. 24, 2008, published as U.S. Patent Application Publication No. 2009-0319585 A1, which is hereby incorporated herein by reference in its entirety to be considered part of this specification. In yet other embodiments, the migration module 118 is configured to perform one or more of the following copy operations: archiving, backup, Hierarchical Storage Management (“HSM”) copies, Information Lifecycle Management (“ILM”) copies or the like.
[0051] In certain embodiments, the migration module 118 can advantageously replace the copied data on the destination storage 116 with a stub file or like object that indicates the new location of the migrated data on the secondary storage 120. For instance, the stub file can comprise a relatively small, truncated file (e.g., several kilobytes) having the same name as the original file. The stub file can also include metadata that identifies the file as a stub and that can be used by the storage system to locate and restore the migrated data to the destination storage 116 or other location.
[0052] The secondary storage 120 can include any type of physical media capable of storing electronic data, such as the migrated data from the destination storage 116. In certain embodiments, secondary storage 120 comprises media configured for long-term data retention, such as tape media or the like. In yet other embodiments, the secondary storage 120 can comprise a disk or other type of mass storage. For example, in certain embodiments, the secondary storage 120 advantageously comprises a slower access time and/or a less expensive storage medium than the destination storage 116.
[0053] Moreover, although the migration module 118 and the secondary storage 120 are illustrated as being external to the destination system 104, it will be understood that either or both of these components can be integrated into the destination system 104. For instance, in certain embodiments the replication module 114 can include the migration module 118, and/or the destination storage 116 can include the secondary storage 120.
[0054] FIG. 2 illustrates a block diagram of an exemplary embodiment of a destination system 204 that provides for de-duplication of data in a CDR system. For instance, the destination system 204 can be advantageously configured to maintain a replication copy of data from a source system while conserving space used on the destination storage device.
[0055] In certain embodiments, the destination system 204 can be used in the data replication system 100 of FIG. 1 . Thus, to simplify the description, certain components of the destination system 204 of FIG. 2 will not be redescribed in detail if they were described above. Rather, the components of the destination system 204 will be given a reference numeral that retains the same last two digits as the reference numeral used in data replication system 100 of FIG. 1 , and the last two digits will be preceded with a numeral “2.”
[0056] As shown in FIG. 2 , the destination system 204 comprises a replication agent 230 and one or more processes, such as threads 232, that populate a destination storage 216. In certain embodiments, the replication agent 230 comprises one or more software modules that coordinate the transfer of data from a source system, such as the source system 102 to the destination storage 216. For instance, the replication agent 230 can manage replication based on one or more predefined preferences, storage policies or the like.
[0057] In certain embodiments, the replication agent 230 instantiates an appropriate number of threads, processes, or routines, 232 for copying data from replication log files 233 to the destination storage 216 to maintain a replicated copy of a source storage device. In operation, in certain embodiments, the threads 232 advantageously process or traverse the entries of the replication logs 233 for particular types of data and then copy that data to certain locations on one or more replication volumes based on data paths identified by the replication agent 230 and/or associated with each thread 232.
[0058] For example, in certain embodiments, the replication logs 233 can contain a copy of the data stored on source logs of a client system and/or particular data operations being performed on the source system data. Such replication logs 233 can comprise any type of memory capable of storing data including, for example, cache memory. In certain embodiments, the replication logs 233 may reside on the destination system 204, such as, for example, on the destination storage 216, or at least a portion of the replication logs 233 may be external to the destination system 204. In certain embodiments, once the replication logs 233 have been populated with the data from the source logs, the data on the source logs is available to be erased and/or overwritten to conserve memory space.
[0059] In certain embodiments, one thread 232 may write to one or more volumes of the destination storage 216 and/or multiple threads 232 may write to a single volume in parallel. Moreover, each thread 232 can be assigned to a hard-coded path pair, which includes (i) a source path identifying the location on the source storage device associated with a data management operation (e.g., “C:\Folder\”) and (ii) a destination path identifying the location on the destination storage 216 to receive the replicated data (e.g., “D:\folder\”) from the thread 232.
[0060] The destination system 204 further includes a de-duplication module 218 that traverses the data in the destination storage 216 to identify common data objects within one or more files on the destination storage 216. For instance, in certain embodiments, the de-duplication module 218 performs block-level de-duplication to identify common 64 KB blocks of data on the destination storage 216.
[0061] In certain embodiments, the de-duplication module 218 generates a substantially unique identifier for each 64 KB block, such as by performing a cryptographic hash function (e.g., message-digest algorithm 5 (MD5)), a secure hash algorithm (e.g., SHA-256), a (digital) digital fingerprint, a checksum, combinations of the same or the like. For each block having a matching identifier, the de-duplication module 218 can assume that such blocks contain identical data. For instance, the de-duplication module 218 can generate the substantially unique identifier for each block on-the-fly while traversing the blocks of the destination storage 216.
[0062] In yet other embodiments, the identifier for each block can be calculated by a module other than the de-duplication module 218, such as by a media agent, the replication agent 230 or the like. For instance, the identifier can be generated, in certain embodiments, when the block is initially stored on the destination storage 216, as part of the replication process from the source system 102 to the destination system 104, or at any other time prior to the comparison by the de-duplication module 218.
[0063] To conserve storage space, each set of common or identical blocks of data found in the destination storage 216 can be stored as a single block in the de-duplication storage 220. Moreover, the de-duplication module 218 can replace each of the common blocks on the destination storage 216 with a substantially smaller stub file that indicates that the actual data block has been copied to the de-duplication storage 220.
[0064] For instance, as shown in FIG. 2 , the destination storage 216 comprises three files, File A 234, File B 236 and File C 238. Two of the files, File A 234 and File C 238, have a common data block, which has been replaced with a de-duplication stub file (i.e., Stub X 240) by the de-duplication module 218. This common data block is stored in the de-duplication storage 232 as common block 244.
[0065] In certain embodiments, the de-duplication stub file 240 is distinguishable from other stub files via a tag, a header entry or other like identifier. Such identification can be advantageous in a replication system, such as the destination system 204, so that the system can distinguish between stubs that have been replicated to the destination storage 216 from a source storage device and stubs that represent actual data on the destination storage 216 that has been archived, de-duplicated or otherwise migrated from the destination storage 216 to de-duplication storage 220.
[0066] For example, File B 242 on the destination storage 216 also includes a stub file (i.e., Stub Y 242) that has been replicated from a source storage device. Thus, in certain embodiments, Stub Y 242, a non de-duplication stub file, does not necessarily correspond to a common block stored on the de-duplication storage 220 and does not include the same tag or other identifier contained by the de-duplication stub files.
[0067] In certain embodiments, the de-duplication module 218 further maintains a tag index 239 that tracks tag values used by stubs on the destination storage 216. For instance, the index 239 can indicate which tag value(s) are assigned to de-duplication stub files (e.g., Stub X 240) and/or replicated stub files (e.g., Stub Y 242). Thus, in such embodiments, the de-duplication module 218 can access the index 239 any time it encounters a stub file on the destination storage 216 based on the tag value contained by the stub. In yet other embodiments, the index 239 can be maintained on the destination storage 216, the de-duplication storage 220 or other component of the destination system 204.
[0068] Although not illustrated in FIG. 2 , the destination system 204 can further comprise a de-duplication database that associates de-duplication stub files 240 on the destination storage 216 with their corresponding common block(s) 244 on the de-duplication storage 220. For example, the de-duplication module 218 can be configured to maintain and/or access a table, index, linked list or other structure that stores entries for each of the de-duplication stub files 240 on the destination storage 216 and the location of the corresponding common block 244 on the de-duplication storage 220.
[0069] Although the stub files illustrated in FIG. 2 have been described with reference to common data blocks, in other embodiments of the invention the stub files can be used to identify other identical data objects, such as files, strings or the like. Moreover, the common data objects need not be limited to 64 KB but may be larger or smaller depending on the specifications (e.g., operating system) of the applicable system.
[0070] The de-duplication module 218 can further be configured to restore and/or recall data from the de-duplication storage 220. For instance, as discussed in more detail below, the de-duplication module 218 can advantageously retrieve the de-duplication or archived data in response to a request to access the replication data on the destination storage 216.
[0071] Furthermore, although the destination system 204 of FIG. 2 has been described with reference to de-duplication of data, it will be understood from the disclosure herein that other embodiments of the destination system 204 can be configured to perform other migration processes, as disclosed above, that result in the copying and/or stubbing of data.
[0072] As is further illustrated, in certain embodiments the replication agent 230 can communicate directly with the de-duplication module 218. For instance, the two components can schedule access to replication data on the destination storage 216, and/or the replication agent 230 can instruct the de-duplication module to restore data, such as the common block 244, from the de-duplication storage 220 to the destination storage 216.
[0073] FIG. 3 illustrates an exemplary de-duplication stub file 340 usable with the destination system 204 of FIG. 2 . In general, the de-duplication stub file 340 contains information that is necessary to locate and/or recall a migrated file or data object. In certain embodiments, the de-duplication stub file 340 comprises a self-describing stub that distinguishes the stub 340 from other types of stubs, such as those that have been replicated from a source system in a replication system.
[0074] For instance, in certain embodiments, the de-duplication stub file 340 comprises a 4 KB file that represents a common 64 KB block of data. In certain embodiments, the de-duplication module 218 or other like module utilizes the data within the stub 340 to retrieve the 64 KB data block in response to a data modification or restore operation request for the replication data. For example, the de-duplication stub file 340 can reference a block offset of the corresponding 64 KB data block 244 within the de-duplication storage 220. In yet other embodiments, the stub file 340 can represent an entire file or data object rather than a fixed block size.
[0075] For exemplary purposes, the de-duplication stub file 340 is shown in FIG. 3 with a plurality of fields. It will be understood that the illustrated stub file 340 is merely exemplary and that one or more of such fields can be optional and/or dependent on the type of operating system(s) used in the replication system.
[0076] As shown, the stub file 340 includes a tag value field 352. In certain embodiments, the tag value 352 distinguishes the de-duplication stub file 340 from regular stub files. For instance, in certain embodiments, the tag value 352 can be one of two preset values: a first value that identifies the stub file as a de-duplication stub file or a second value associated with a replicated stub file that represents a file migrated from a source storage device (e.g., a stub file that was itself replicated in a copy operation). For example, the tag value 352 could comprise a single bit to distinguish the two types of stub files.
[0077] In yet other embodiments, the tag value 352 can comprise a unique, substantially unique or other identifier (e.g., an alphanumeric value) that can be used in accessing a lookup table or like structure (e.g., index 239) to determine if the stub file 340 is a de-duplication stub file or a regular stub file.
[0078] A time stamp field 354 can store an indication of when the represented file was migrated to secondary storage and replaced with the stub file. The file size field 356 can indicate the size of the file and/or block represented by the stub file 340. In environments wherein all stub files reference a predetermined block size, the stub file 340 may not have such a field.
[0079] A file name field 358 indicates the name of the file referenced by the stub file 340. In certain embodiments, the stub file 340 itself is assigned the same name as the migrated file, thereby presenting the appearance that the actual file is located in the particular storage location.
[0080] The stub file 340 further includes a file location information field 360 containing data for locating and/or retrieving the migrated file. For example, the field 360 can comprise an archive file identifier, volume identifier, one or more offset values, a pathname, an address, combinations of the same or the like. It will be understood from the disclosure herein that the field 360 is illustrated as one field for simplification purposes and that other embodiments of the stub file 340 can comprise multiple fields (adjacent or non-adjacent) with information relating to the location of the migrated file. In general, the field 360 comprises enough information such that a migration module (e.g., migration module 118) can access the migrated file.
[0081] A checksum field 362 includes data for verifying that a restored file is not corrupted and/or accurately represents the data object that was migrated. For instance, when restoring a migrated file or object, the value in the checksum field 362 of the corresponding stub file 340 can be compared with a checksum of the restored file to validate the data.
[0082] The stub file 340 further includes a flag field 364 that contains other information regarding the migrated file or data object. For example, the flag field 364 can indicate whether or not the migrated file is encrypted, compressed or the like. In yet other embodiments, the stub file 340 can function without the flag field 364.
[0083] Although the de-duplication stub file 340 has been described with respect to particular embodiments, it will be understood from the disclosure herein that the stub file 340 can comprise more or fewer fields or information than what is illustrated in FIG. 3 . Moreover, the stub file 340 may comprise a file between 511 bytes and 16 KB in size.
[0084] FIGS. 4-6 illustrate three flowcharts of an exemplary embodiment of a method for de-duplicating, or single instancing, replicated data in a data replication system, such as a CDR system. In general, the illustrated de-duplication method provides for the migrating and stubbing of common data objects on a destination storage device without significantly impacting the performance of data replication to the destination storage device. For exemplary purposes, the blocks of the flowcharts of FIG. 4-6 will be described with reference to the components of the destination system 204 of FIG. 2 .
[0085] With respect to FIG. 4 , a flowchart is shown of an exemplary embodiment of a scan process 400 of a de-duplication method for the destination system 204. In general, the scan process 400 involves identifying common data objects within replication data of a destination storage device.
[0086] At Block 405, the replication agent 230 and thread(s) 232 replicate data from a source storage device to the destination storage device 216. In certain embodiments, this block continues to be executed throughout the scan process 400 and/or other processes of FIGS. 5 and 6 . In certain embodiments, the replication of data to the destination storage 216 is given priority over one or more other data operations of the de-duplication method described below in order to maintain substantial coherency between the replicated data and the source system data. Moreover, the de-duplication of the replicated data can be performed without significantly impacting the primary data replication process.
[0087] At Block 410, the de-duplication module 218 receives a command to archive data on the destination machine. In certain embodiments, the de-duplication module 218 initiates archiving based on a storage policy and/or user input. For instance, the storage policy can dictate that archiving be performed daily or on another periodic basis. In yet other embodiments, archiving can be performed based on an available storage capacity of the destination storage 216.
[0088] At Block 415, the de-duplication module 218 scans the destination storage 216 to identify common data objects. For instance, the de-duplication module 218 can identify 64 KB data blocks on the destination storage 216, such as from different files, that comprise identical data. In certain embodiments, the de-duplication module 218 can perform a cryptographic hash function or other algorithm, as discussed previously, to generate a substantially unique identifier based on the data contained in each block. For each block having the same identifier, the de-duplication module 218 can identify the block as a candidate for de-duplication together with the other like blocks, such as through a flag or other marker, listing the blocks in a data structure, or the like.
[0089] The term “data object” as used herein is a broad term and is used in its ordinary sense and includes, without limitation, any distinct or identifiable grouping of electronic information that exists in storage and/or on which operations can be performed. For example, a data object can comprise a data file, a data block, a program, an array, any other collection of electronic information or the like.
[0090] In certain embodiments, in order to avoid excessive restore operations on migrated data of secondary storage 220, it is preferred to not archive data that has a relatively high likelihood of being accessed in the future. Thus, during the scanning, the de-duplication module 218 can identify those common data objects on the destination storage 216 that have not been modified and/or accessed within a predetermined period of time (e.g., within the last seven days).
[0091] At Block 420, the process 400 records the scan time of the destination data. As discussed in more detail below with respect to FIG. 6 , the scan time can advantageously be used to determine whether or not a particular data object should be stubbed. It will be understood that Block 420 can comprise recording of individual scan times for each data object on the destination storage 216 or the time that the scan process was initiated for the entire set of replication data.
[0092] At Block 425, the de-duplication module 218 maintains a list or other record of the common data objects that were identified on the destination storage as being candidates for de-duplication.
[0093] Although the scan process 400 has been described with respect to particular blocks, other embodiments of the process can include different and/or fewer blocks than those described above. For instance, in certain embodiments, the process 400 can conduct an initial scan of the destination storage 216 for all data objects that have not been modified and/or accessed for a predetermined period of time (e.g., more than seven days), which data objects are identified as candidates for archiving or migration to secondary storage. A second pass is then made by the de-duplication module 218 through these identified data objects to locate common data objects that can be de-duplicated to the de-duplication storage 220.
[0094] Following the scan process 400, the de-duplication module 218 commences with the archive process portion of the de-duplication method. FIG. 5 illustrates a flowchart of an exemplary embodiment of an archive process 500 of the de-duplication method for a replication system. In general, this archive process 500 involves determining appropriate times to migrate or copy replication data from the destination storage 216.
[0095] At Block 505, the de-duplication module 505 accesses a common data object identified in the list created in Block 425. Before archiving each data object, the de-duplication module 218 at Block 510 determines if the particular data object is currently in use by a CDR process (e.g., is being modified based on changes to source system data). If the data object is currently in use, the de-duplication module 515 pauses the archive process 500 until the CDR process has completed (Block 515). In yet other embodiments, the de-duplication module 218 can move to a next identified data object for archiving.
[0096] At Block 520, if the current data object is not in use by a CDR process, the de-duplication module 218 archives the current data object in secondary storage 220. In certain embodiments, Block 520 comprises storing only a single common block 244 in the de-duplication storage 220 for identical data blocks within the replication data set.
[0097] The archive process 500 then determines if there are additional data objects on the destination storage 216 that have been identified for archiving (Block 525). If there are additional data objects, the de-duplication module 218 moves to the next data object (Block 530), and the archive process 500 returns to Block 510. Otherwise, the archive process 500 completes, and the de-duplication method commences with stubbing.
[0098] Although the process 500 has been described with reference to “archiving,” it should be understood that the process 500 can apply similarly to migrating, de-duplicating, single instancing or other types of copy operations. Rather, the term “archiving” is used with respect to process 500, and the remainder of the de-duplication process, for simplification purposes.
[0099] FIG. 6 illustrates a flowchart of an exemplary embodiment of a stubbing process 600 usable with the destination system 204. In general, the process 600 can be performed on each of the data objects archived by the process 500 to replace the objects with stub files or like truncation objects in order to conserve space on a destination storage device of a replication system.
[0100] In particular, in certain circumstances, the data of a replicated file can change on the destination storage 216 between the time of a scan of the destination storage (Block 415) and the time at which the data object is to be stubbed. Thus, the process 600 advantageously accounts for such data modifications by requiring the de-duplication module 218 to first access the metadata of each data object on the destination storage 216 that has been archived on secondary storage 220 to determine a last accessed and/or modified time for the data object (Block 605).
[0101] In certain further embodiments, such data objects can be tagged or otherwise identified or recorded during the scan process 400 and or archive process 500 such that the de-duplication module 218 can quickly locate the data objects during the process 600.
[0102] If the last accessed and/or modified time of the particular data object is after the recorded scan time (Block 610), the de-duplication module 218 does not proceed with replacing the data object with a stub file (Block 615). In such situations, it is possible that the data object archived on secondary storage 220 is no longer consistent with the data object on the destination storage 216.
[0103] In yet other embodiments, the process 600 determines at Block 610 if the last accessed and/or modified time is after a time that the data object was archived or copied instead of the scan time. If so, the process 600 continues with Block 615.
[0104] If the data object has not been accessed and/or modified since the scan time and/or archive time, the de-duplication module 218 replaces the archived data object with a stub file, such as the de-duplication stub file 340 illustrated in FIG. 3 . As discussed above, the stub file can advantageously be a self-describing stub file that is used to identify archived and/or de-duplicated data and can differ in content and/or structure from other types of stub files. Moreover, in the de-duplication environment, multiple data objects on the destination storage 216 can be replaced with the same stub file or a stub file with the same tag, which references a common data block on the secondary storage 220. Once the stubbing process 600 has completed processing each of the identified data objects, the de-duplication method 600 is completed.
[0105] In yet other embodiments of the invention, systems and methods can immediately replace archived data objects with stub files on the destination storage 216 prior to continuing with scanning the entire storage device. In such embodiments, the likelihood of the data object being accessed and/or modified between the time of the scan and the time of stubbing is decreased substantially.
[0106] In certain embodiments of the data replication system 100, the source system 102 communicates with the associated destination system 104 to verify that the two systems are synchronized. For instance, the source system 102 may receive from the destination system 104 an identification (e.g., unique serial number) of the data operation currently being replicated by the destination system. The source system 102 may then compare the received identification with the data operation being forwarded to the source storage 112.
[0107] In order to ensure that the data modifications are being made to the same data on the destination system as the source system, certain embodiments of the invention are configured to account for the use of stub files in the replication data. FIG. 7 illustrates a flowchart of an exemplary embodiment of a synchronization process 700 usable in a data replication environment. In particular, the synchronization process 700 is capable of modifying files on a destination storage device of a replication system that have been stubbed according to a de-duplication policy, archive policy, migration policy or the like. For exemplary purposes, the synchronization process 700 will be described with reference to the components of the data replication system 100 of FIG. 1 .
[0108] At Block 705, the synchronization process 700 identifies a modification to data on the source system 102. For instance, a log file indicative of data modifications of the source system 102 data can be sent over a network to the destination system 104 via a CDR process. Examples of CDR processes and configurations usable with embodiments of the invention are described in U.S. Pat. No. 7,651,593, issued Jan. 26, 2010, which is hereby incorporated herein by reference in its entirety.
[0109] In certain embodiments, the replication module 114 receives the command to modify the replication data on the destination storage 116 based on changes made to the source data (Block 710). Prior to doing so, the replication module 114 determines if the replication data to be modified includes a stub file (Block 715). For instance, the replication module 114 can read metadata of the replication data to determine if any of the data comprises a stub file. In yet other embodiments, the replication module 114 can access an index or cache that maintains a record of the stub files within the replication data. Such a cache or index may be maintained, for example, by the migration module 118.
[0110] If the replication data includes a stub file, the process 700 continues with Block 720 to determine if the stub file includes a tag or other predetermined value (e.g., via tag value 352). In certain embodiments, the tag value distinguishes the particular stub file as being associated with replication data that has been migrated, archived, de-duped or otherwise moved to secondary storage 120 by the migration module 118 as opposed to a stub file replicated from the source storage 112. For instance, the tag value can comprise an identifier that is compared with a list of identifiers in a migration table or index to determine if the stub file is a de-duplication stub file or a replicated stub file.
[0111] If the stub file does include the tag value, the process 700 recalls the actual data object(s) referenced by the stub file and restores the data to the destination storage 116. In certain embodiments, the replication module 114 can invoke the migration module 118 to recall the data. In certain further embodiments, the recall function can take priority over other jobs being performed or scheduled to be performed by the migration module 118 because the CDR process is halted until the pertinent replication data is recalled and restored to the destination storage 116 from secondary storage 120.
[0112] Once the data is restored from secondary storage 120, or if the replication data does not include (tagged) stub files, the process 700 moves to Block 730 to apply the requested modification to the replication data, after which the process 700 terminates for the particular requested modification.
[0113] The tagged stub files can advantageously be used in a variety of other processes. FIG. 8 illustrates a flowchart of an exemplary embodiment of a process 800 for restoring data from one or more snapshots in a CDR system. In general, the restore process 800 is capable of restoring data from a snapshot including one or more stub files representing replication data that has been de-duplicated, archived, migrated or the like. For exemplary purposes, the restore process 800 will be described with reference to the components of the data replication system 100 of FIG. 1 .
[0114] At Block 805, the replication module 114 identifies a point in time when the data of destination storage device 116 represents a “known good,” “stable” or “recoverable” state. In certain embodiments, such a state may be defined as when particular computing operations of the application(s) 108 are complete to a point such that further operation, recovery and/or rolling back of the application(s) 108 may occur, based on the recorded or replicated data, without the loss of critical information or computing operations needed for operation of the application(s) 108. This point of referential integrity is generally referred to herein as a “known good” state of the application data.
[0115] In certain embodiments of the invention, a consistency point marker (e.g., logical marker or tag) in one or more CDR log files can identify when replication data represents a known good state. For instance, such a marker can be generated and/or inserted in the log files by the filter driver 110 and/or a data agent denoting that a “consistency point” or “consistency recovery point” has been reached. In some embodiments, the consistency point marker further indicates the time at which the application 108 was in the known good state. Additional details on such consistency point markers are disclosed in U.S. Pat. No. 7,651,593, issued Jan. 26, 2010, which is hereby incorporated herein by reference in its entirety.
[0116] In certain embodiments, the consistency point marker is replicated to the destination system 104 along with replicated data. As the replication marker 114 comes across the consistency point marker, it knows that the replication data, at that point in time, represents a known good state. Based on the consistency point marker, the replication module 114 can advantageously perform a snapshot on the replication data (Block 810). As a result, the snapshot represents a point-in-time copy of the replication data in a known good state.
[0117] At Block 815, the process 800 later receives a request to restore the data that was the subject of the snapshot. For instance, the data restore request may be in response to a system crash or failure, and can involve restoring the storage device or volume to a previous or most recent known good state. In certain embodiments, the restore request comprises the replication module 114 or other component mounting the snapshot to obtain a full logical file system of the replication data at the time the snapshot was taken.
[0118] The replication module 114 then identifies whether or not the snapshot comprises any stub files (Block 820). If the snapshot comprises stub files, the process 800 determines if any of the stub files includes a particular tag or like identifier (Block 825). For instance, the replication module 114 can determine if a tag value of the stub file matches one or more predetermined values that identify stub files as representing migrated, archived or de-duplicated data as opposed to a stub file that was replicated from the source system 102.
[0119] If the stub file has such a tag or identifier, the process 800 recalls the actual data represented by the stub file to a staging area that serves as a temporary repository for the recalled data while the restore process 800 is being performed (Block 830). For instance, the replication module 114 and/or migration module 118 can recall archived data blocks to an area on the destination storage 116 or the secondary storage 120. For example, this staging area can be a temporary folder created to receive the recalled data for a brief duration until it is restored, after which the temporary folder can be deleted.
[0120] After the archived data has been recalled, or if the snapshot does not include any (tagged) stub files, the replication module 114 restores the data from the snapshot (Block 835). While performing the restore, when the replication module 114 comes across a stub file referenced by the snapshot, the replication module 114 can restore the appropriate data from the staging area rather than restore the stub file.
[0121] Although the process 800 has been described with reference to particular arrangements, other embodiments of the process 800 can have more or fewer blocks than those described above. For instance, the process 800 can be performed on snapshots that do not represent the replication data in a known good or recoverable state.
[0122] In certain embodiments of the invention, data replication systems and methods may be used in a modular storage management system, embodiments of which are described in more detail in U.S. Pat. No. 7,035,880, issued Apr. 5, 2006, which is hereby incorporated herein by reference in its entirety. For example, the data replication system may be part of a storage operation cell that includes combinations of hardware and software components directed to performing storage operations on electronic data. Exemplary storage operation cells usable with embodiments of the invention include CommCells as embodied in the QNet storage management system and the QINETIX or SIMPANA storage management systems offered by CommVault Systems, Inc. (Oceanport, N.J.), and as further described in U.S. Pat. No. 7,454,569, issued Nov. 18, 2008, which is hereby incorporated herein by reference in its entirety.
[0123] Systems and modules described herein may comprise software, firmware, hardware, or any combination(s) of software, firmware, or hardware suitable for the purposes described herein. Software and other modules may reside on servers, workstations, personal computers, computerized tablets, PDAs, and other devices suitable for the purposes described herein. Software and other modules may be accessible via local memory, via a network, via a browser, or via other means suitable for the purposes described herein. Data structures described herein may comprise computer files, variables, programming arrays, programming structures, or any electronic information storage schemes or methods, or any combinations thereof, suitable for the purposes described herein. User interface elements described herein may comprise elements from graphical user interfaces, command line interfaces, and other interfaces suitable for the purposes described herein.
[0124] Embodiments of the invention are also described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, may be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the acts specified in the flowchart and/or block diagram block or blocks.
[0125] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the acts specified in the flowchart and/or block diagram block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operations to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the acts specified in the flowchart and/or block diagram block or blocks.
[0126] While certain embodiments of the inventions have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the disclosure. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the disclosure. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the disclosure.
Claims
What is claimed is:
1. A method of managing the storage of data in a computer network, the method comprising:
receiving data from a source system comprising computer hardware at a destination system comprising computer hardware including one or more processors, the data comprising at least one first stub file comprising information indicative of a location of additional data on a storage device;
storing the data at a destination storage device included with the destination system, wherein the destination storage device differs from the storage device;
identifying a first portion of the data for storage at a secondary storage device, wherein the secondary storage device differs from the storage device and the destination storage device;
providing a copy of the first portion of the data for storage in the secondary storage device;
generating a second stub file representative of the first portion of the data;
replacing the first portion of the data at the destination storage device with the second stub file; and
tagging the second stub file with an identifier that distinguishes stub files generated at the destination system from stub files received with the data from the source system, wherein the second stub file comprises information indicative of a location of the copy of the first portion of the data on the secondary storage device, and wherein the at least one first stub file is not tagged with the identifier.
2. The method of claim 1, wherein the first portion of the data comprises a data object that is included by multiple portions of the data.
3. The method of claim 2, further comprising:
identifying a second portion of the data comprising a copy of the data object; and
replacing the second portion of the data with the second stub file without providing a copy of the second portion of the data to the secondary storage device.
4. The method of claim 1, wherein the first portion of the data comprises data that has been designated for archival.
5. The method of claim 1, further comprising using the second stub file to access the copy of the first portion of the data from the secondary storage device during a restore operation.
6. The method of claim 1, further comprising maintaining an index for managing identifiers associated with stub files, the index including the identifier associated with the second stub file.
7. The method of claim 1, further comprising determining whether the first portion of the data has a last access time at or before the time of creation of the copy of the first portion of the data, wherein said replacing the first portion of the data at the destination storage device with the second stub file occurs in response to determining that the last access time is at or before the time of creation of the copy of the first portion of the data.
8. A system for managing the storage of data in a computer network, the system comprising:
computer hardware configured to execute a data manager, the data manager configured to:
scan data located at a destination storage device to identify a first portion of the data to store at a secondary storage device, the data comprising at least a first stub file indicative of a portion of the data stored at a storage device that differs from the destination storage device and the secondary storage device;
provide a copy of the first portion of the data for storage in the secondary storage device;
generate a second stub file representative of the first portion of the data;
replace the first portion of the data at the destination storage device with the second stub file indicative of a location of the copy of the first portion of the data on the secondary storage device; and
tag the second stub file with an identifier that distinguishes stub files generated by the data manager from stub files indicative of portions of the data stored at the storage device, wherein the first stub file is not tagged with the identifier.
9. The system of claim 8, wherein the first portion of the data comprises a data object that is included by multiple portions of the data.
10. The system of claim 9, wherein the data manager is further configured to:
scan the data located at the destination storage device to identify a second portion of the data comprising the data object; and
replace the second portion of the data with the second stub file.
11. The system of claim 8, wherein the first portion of the data comprises a file.
12. The system of claim 8, wherein the data manager is further configured to use the second stub file to access the copy of the first portion of the data from the secondary storage device during a restore operation.
13. The system of claim 8, wherein the first portion of data satisfies a particular data size.
14. The system of claim 13, wherein the particular data size is 64 KB.
15. The system of claim 8, further comprising the destination storage device storing the data, wherein the data is provided to the destination storage device by a source system comprising computer hardware.
16. The system of claim 8, wherein the data manager is further configured to maintain an index for managing identifiers associated with stub files, wherein each respective stub file includes an identifier used to distinguish the respective stub file from other ones of the stub files.
17. The system of claim 8, wherein the data manager is further configured to determine whether the first portion of the data has a last access time at or before the time of creation of the copy of the first portion of data, and wherein the data manager replaces the first portion of the data with the second stub file in response to determining that the last access time is at or before the time of creation of the copy of the first portion of the data.
18. Non-transitory computer storage comprising instructions which, when executed, cause the computing system to perform steps comprising:
receiving data at a first system comprising computer hardware including one or more processors from a second system comprising computer hardware including one or more processors, the data comprising a first stub file comprising information indicative of a location of additional data on a separate storage device, wherein the separate storage device is not included with the first system;
storing the data at a first storage device included with the first system;
identifying a first portion of the data for storage at a second storage device, wherein the second storage device differs from the separate storage;
providing a copy of the first portion of the data for storage in the second storage device;
generating a second stub file representative of the first portion of the data;
replacing the first portion of the data at the first storage device with the second stub file; and
tagging the second stub file with an identifier that distinguishes stub files generated at the first system from stub files received with the data from the second system, wherein the second stub file comprises information indicative of a location of the copy of the first portion of the data on the second storage device, and wherein the first stub file is not tagged with the identifier.
Patent Citations (664)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4296465(A) | 1981-10-01 | Lemak | Applicant |
| US4686620(A) | 1987-08-01 | Ng | Applicant |
| US4995035(A) | 1991-02-01 | Cole et al. | Applicant |
| US5005122(A) | 1991-04-01 | Griffin et al. | Applicant |
| US5093912(A) | 1992-03-01 | Dong et al. | Applicant |
| US5133065(A) | 1992-07-01 | Cheffetz 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 |
| US5231668(A) | 1993-07-01 | Kravitz | 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 |
| US5263154(A) | 1993-11-01 | Eastridge et al. | Applicant |
| US5265159(A) | 1993-11-01 | Kung | 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 |
| US5317731(A) | 1994-05-01 | Dias 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 |
| US5369757(A) | 1994-11-01 | Spiro et al. | Applicant |
| US5403639(A) | 1995-04-01 | Belsan et al. | Applicant |
| US5410700(A) | 1995-04-01 | Fecteau et al. | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi | Applicant |
| US5455926(A) | 1995-10-01 | Keele et al. | Applicant |
| US5487072(A) | 1996-01-01 | Kant | 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 |
| US5544345(A) | 1996-08-01 | Carpenter et al. | Applicant |
| US5544347(A) | 1996-08-01 | Yanai et al. | Applicant |
| US5546536(A) | 1996-08-01 | Davis 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 |
| US5598546(A) | 1997-01-01 | Blomgren | Applicant |
| US5604862(A) | 1997-02-01 | Midgely 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 |
| US5668986(A) | 1997-09-01 | Nilsen et al. | Applicant |
| US5673381(A) | 1997-09-01 | Huai et al. | Applicant |
| US5675511(A) | 1997-10-01 | Prasad et al. | Applicant |
| US5677900(A) | 1997-10-01 | Nishida et al. | Applicant |
| US5682513(A) | 1997-10-01 | Candelaria et al. | Applicant |
| US5687343(A) | 1997-11-01 | Fecteau et al. | Applicant |
| US5689706(A) | 1997-11-01 | Rao et al. | Applicant |
| US5699361(A) | 1997-12-01 | Ding et al. | Applicant |
| US5719786(A) | 1998-02-01 | Nelson et al. | Applicant |
| US5720026(A) | 1998-02-01 | Uemura et al. | Applicant |
| US5729743(A) | 1998-03-01 | Squibb | Applicant |
| US5737747(A) | 1998-04-01 | Vishlitzky et al. | Applicant |
| US5742792(A) | 1998-04-01 | Yanai et al. | Applicant |
| US5751997(A) | 1998-05-01 | Kullick et al. | Applicant |
| US5758359(A) | 1998-05-01 | Saxon | 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 |
| US5765173(A) | 1998-06-01 | Cane et al. | Applicant |
| US5778395(A) | 1998-07-01 | Whiting et al. | Applicant |
| US5790114(A) | 1998-08-01 | Geaghan 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 |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5813017(A) | 1998-09-01 | Morris | 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 |
| US5878408(A) | 1999-03-01 | Van Huben et al. | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5901327(A) | 1999-05-01 | Ofek | Applicant |
| US5907621(A) | 1999-05-01 | Bachman et al. | Applicant |
| US5907672(A) | 1999-05-01 | Matze et al. | Applicant |
| US5924102(A) | 1999-07-01 | Perks | Applicant |
| US5926836(A) | 1999-07-01 | Blumenau | Applicant |
| US5933104(A) | 1999-08-01 | Kimura | Applicant |
| US5933601(A) | 1999-08-01 | Fanshier 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 |
| US5991779(A) | 1999-11-01 | Bejar | Applicant |
| US5995091(A) | 1999-11-01 | Near 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 |
| US6021475(A) | 2000-02-01 | Nguyen et al. | Applicant |
| US6023710(A) | 2000-02-01 | Steiner et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6049889(A) | 2000-04-01 | Steely, Jr. et al. | Applicant |
| US6052735(A) | 2000-04-01 | Ulrich et al. | Applicant |
| US6058066(A) | 2000-05-01 | Norris et al. | Applicant |
| US6061692(A) | 2000-05-01 | Thomas et al. | Applicant |
| US6072490(A) | 2000-06-01 | Bates et al. | Applicant |
| US6076148(A) | 2000-06-01 | Kedem et al. | Applicant |
| US6088697(A) | 2000-07-01 | Crockett et al. | Applicant |
| US6094416(A) | 2000-07-01 | Ying | Applicant |
| US6105129(A) | 2000-08-01 | Meier 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 |
| US6131148(A) | 2000-10-01 | West et al. | Applicant |
| US6131190(A) | 2000-10-01 | Sidwell | Applicant |
| US6137864(A) | 2000-10-01 | Yaker | Applicant |
| US6148377(A) | 2000-11-01 | Carter et al. | 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 |
| US6158044(A) | 2000-12-01 | Tibbetts | Applicant |
| US6161111(A) | 2000-12-01 | Mutalik et al. | Applicant |
| US6163856(A) | 2000-12-01 | Dion et al. | Applicant |
| US6167402(A) | 2000-12-01 | Yeager | Applicant |
| US6175829(B1) | 2001-01-01 | Li et al. | Applicant |
| US6195695(B1) | 2001-02-01 | Cheston et al. | Applicant |
| US6205450(B1) | 2001-03-01 | Kanome | Applicant |
| US6212512(B1) | 2001-04-01 | Barney et al. | Applicant |
| US6212521(B1) | 2001-04-01 | Minami et al. | Applicant |
| US6230164(B1) | 2001-05-01 | Rekieta et al. | Applicant |
| US6260068(B1) | 2001-07-01 | Zalewski 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 |
| US6279078(B1) | 2001-08-01 | Sicola et al. | Applicant |
| US6292783(B1) | 2001-09-01 | Rohler et al. | Applicant |
| US6301592(B1) | 2001-10-01 | Aoyama et al. | Applicant |
| US6304880(B1) | 2001-10-01 | Kishi | Applicant |
| US6311193(B1) | 2001-10-01 | Sekido | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Applicant |
| US6328766(B1) | 2001-12-01 | Long | Applicant |
| US6330570(B1) | 2001-12-01 | Crighton | 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 |
| US6363464(B1) | 2002-03-01 | Mangione | Applicant |
| US6366986(B1) | 2002-04-01 | St. Pierre et al. | Applicant |
| US6366988(B1) | 2002-04-01 | Skiba et al. | Applicant |
| US6374336(B1) | 2002-04-01 | Peters et al. | Applicant |
| US6374363(B1) | 2002-04-01 | Wu et al. | Applicant |
| US6389432(B1) | 2002-05-01 | Pothapragada et al. | Applicant |
| US6397308(B1) | 2002-05-01 | Ofek et al. | Applicant |
| US6418478(B1) | 2002-07-01 | Ignatius et al. | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6434681(B1) | 2002-08-01 | Armangau | Applicant |
| US6438595(B1) | 2002-08-01 | Blumenau et al. | Applicant |
| US6466950(B1) | 2002-10-01 | Ono | Applicant |
| US6473775(B1) | 2002-10-01 | Kusters et al. | Applicant |
| US6487561(B1) | 2002-11-01 | Ofek et al. | Applicant |
| US6487644(B1) | 2002-11-01 | Huebsch et al. | Applicant |
| US6487645(B1) | 2002-11-01 | Clark et al. | Applicant |
| US6502205(B1) | 2002-12-01 | Yanai et al. | Applicant |
| US6516314(B1) | 2003-02-01 | Birkler et al. | Applicant |
| US6516327(B1) | 2003-02-01 | Zondervan et al. | Applicant |
| US6516348(B1) | 2003-02-01 | MacFarlane et al. | Applicant |
| US6519679(B2) | 2003-02-01 | Devireddy et al. | Applicant |
| US6538669(B1) | 2003-03-01 | Lagueux, Jr. et al. | Applicant |
| US6539462(B1) | 2003-03-01 | Mikkelsen et al. | Applicant |
| US6542468(B1) | 2003-04-01 | Hatakeyama | 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 |
| US6564229(B1) | 2003-05-01 | Baweja et al. | Applicant |
| US6564271(B2) | 2003-05-01 | Micalizzi, Jr. et al. | Applicant |
| US6581143(B2) | 2003-06-01 | Gagne et al. | Applicant |
| US6604118(B2) | 2003-08-01 | Kleinman et al. | Applicant |
| US6604149(B1) | 2003-08-01 | Deo et al. | Applicant |
| US6611849(B1) | 2003-08-01 | Raff et al. | Applicant |
| US6615223(B1) | 2003-09-01 | Shih et al. | Applicant |
| US6629189(B1) | 2003-09-01 | Sandstrom et al. | Applicant |
| US6631477(B1) | 2003-10-01 | LeCrone et al. | Applicant |
| US6631493(B2) | 2003-10-01 | Ottesen et al. | Applicant |
| US6647396(B2) | 2003-11-01 | Parnell et al. | Applicant |
| US6647473(B1) | 2003-11-01 | Golds et al. | Applicant |
| US6651075(B1) | 2003-11-01 | Kusters 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 |
| US6662198(B2) | 2003-12-01 | Satyanarayanan et al. | Applicant |
| US6665815(B1) | 2003-12-01 | Goldstein et al. | Applicant |
| US6681230(B1) | 2004-01-01 | Blott et al. | Applicant |
| US6691209(B1) | 2004-02-01 | O'Connell | Applicant |
| US6721767(B2) | 2004-04-01 | De Meno et al. | Applicant |
| US6728733(B2) | 2004-04-01 | Tokui | Applicant |
| US6732124(B1) | 2004-05-01 | Koseki et al. | Applicant |
| US6732125(B1) | 2004-05-01 | Autrey et al. | Applicant |
| US6742092(B1) | 2004-05-01 | Huebsch et al. | Applicant |
| US6748504(B2) | 2004-06-01 | Sawdon et al. | Applicant |
| US6751635(B1) | 2004-06-01 | Chen et al. | Applicant |
| US6757794(B2) | 2004-06-01 | Cabrera et al. | Applicant |
| US6760723(B2) | 2004-07-01 | Oshinsky et al. | Applicant |
| US6763351(B1) | 2004-07-01 | Subramaniam et al. | Applicant |
| US6789161(B1) | 2004-09-01 | Blendermann et al. | Applicant |
| US6792472(B1) | 2004-09-01 | Otterness et al. | Applicant |
| US6792518(B2) | 2004-09-01 | Armangau et al. | Applicant |
| US6799258(B1) | 2004-09-01 | Linde | Applicant |
| US6820035(B1) | 2004-11-01 | Zahavi | Applicant |
| US6836779(B2) | 2004-12-01 | Poulin | Applicant |
| US6839724(B2) | 2005-01-01 | Manchanda et al. | Applicant |
| US6871163(B2) | 2005-03-01 | Hiller et al. | Applicant |
| US6871271(B2) | 2005-03-01 | Ohran et al. | Applicant |
| US6880051(B2) | 2005-04-01 | Timpanaro-Perrotta | Applicant |
| US6886020(B1) | 2005-04-01 | Zahavi et al. | Applicant |
| US6892211(B2) | 2005-05-01 | Hitz et al. | Applicant |
| US6912482(B2) | 2005-06-01 | Kaiser | Applicant |
| US6925476(B1) | 2005-08-01 | Multer et al. | Applicant |
| US6925512(B2) | 2005-08-01 | Louzoun et al. | Applicant |
| US6938135(B1) | 2005-08-01 | Kekre et al. | Applicant |
| US6938180(B1) | 2005-08-01 | Dysert et al. | Applicant |
| US6941393(B2) | 2005-09-01 | Secatch | Applicant |
| US6944796(B2) | 2005-09-01 | Joshi et al. | Applicant |
| US6952705(B2) | 2005-10-01 | Knoblock et al. | Applicant |
| US6952758(B2) | 2005-10-01 | Chron et al. | Applicant |
| US6954834(B2) | 2005-10-01 | Slater et al. | Applicant |
| US6968351(B2) | 2005-11-01 | Butterworth | Applicant |
| US6973553(B1) | 2005-12-01 | Archibald, Jr. et al. | Applicant |
| US6978265(B2) | 2005-12-01 | Schumacher | Applicant |
| US6981177(B2) | 2005-12-01 | Beattie | Applicant |
| US6983351(B2) | 2006-01-01 | Gibble et al. | Applicant |
| US6993539(B2) | 2006-01-01 | Federwisch et al. | Applicant |
| US7003519(B1) | 2006-02-01 | Biettron et al. | Applicant |
| US7003641(B2) | 2006-02-01 | Prahlad et al. | Applicant |
| US7007046(B2) | 2006-02-01 | Manley et al. | Applicant |
| US7032131(B2) | 2006-04-01 | Lubbers et al. | Applicant |
| US7035880(B1) | 2006-04-01 | Crescenti et al. | Applicant |
| US7039661(B1) | 2006-05-01 | Ranade | Applicant |
| US7051050(B2) | 2006-05-01 | Chen et al. | Applicant |
| US7062761(B2) | 2006-06-01 | Slavin et al. | Applicant |
| US7065538(B2) | 2006-06-01 | Aronoff et al. | Applicant |
| US7068597(B1) | 2006-06-01 | Fijolek et al. | Applicant |
| US7082441(B1) | 2006-07-01 | Zahavi et al. | Applicant |
| US7085787(B2) | 2006-08-01 | Beier et al. | Applicant |
| US7085904(B2) | 2006-08-01 | Mizuno et al. | Applicant |
| US7093012(B2) | 2006-08-01 | Olstad et al. | Applicant |
| US7096315(B2) | 2006-08-01 | Takeda et al. | Applicant |
| US7103731(B2) | 2006-09-01 | Gibble et al. | Applicant |
| US7103740(B1) | 2006-09-01 | Colgrove et al. | Applicant |
| US7106691(B1) | 2006-09-01 | DeCaluwe et al. | Applicant |
| US7107298(B2) | 2006-09-01 | Prahlad et al. | Applicant |
| US7107395(B1) | 2006-09-01 | Ofek et al. | Applicant |
| US7111021(B1) | 2006-09-01 | Lewis et al. | Applicant |
| US7111189(B1) | 2006-09-01 | Sicola et al. | Applicant |
| US7120757(B2) | 2006-10-01 | Tsuge | Applicant |
| US7130860(B2) | 2006-10-01 | Pachet et al. | Applicant |
| US7130970(B2) | 2006-10-01 | Devassy et al. | Applicant |
| US7139932(B2) | 2006-11-01 | Watanabe | Applicant |
| US7155465(B2) | 2006-12-01 | Lee et al. | Applicant |
| US7155633(B2) | 2006-12-01 | Tuma et al. | Applicant |
| US7158985(B1) | 2007-01-01 | Liskov | Applicant |
| US7177866(B2) | 2007-02-01 | Holenstein et al. | Applicant |
| US7181477(B2) | 2007-02-01 | Saika et al. | Applicant |
| US7188292(B2) | 2007-03-01 | Cordina et al. | Applicant |
| US7191198(B2) | 2007-03-01 | Asano et al. | Applicant |
| US7194454(B2) | 2007-03-01 | Hansen et al. | Applicant |
| US7194487(B1) | 2007-03-01 | Kekre et al. | Applicant |
| US7200620(B2) | 2007-04-01 | Gupta | Applicant |
| US7203807(B2) | 2007-04-01 | Urabe et al. | Applicant |
| US7209972(B1) | 2007-04-01 | Ignatius et al. | Applicant |
| US7225204(B2) | 2007-05-01 | Manley et al. | Applicant |
| US7225208(B2) | 2007-05-01 | Midgley et al. | Applicant |
| US7225210(B2) | 2007-05-01 | Guthrie, II | Applicant |
| US7228456(B2) | 2007-06-01 | Lecrone et al. | Applicant |
| US7231391(B2) | 2007-06-01 | Aronoff et al. | Applicant |
| US7231544(B2) | 2007-06-01 | Tan et al. | Applicant |
| US7234115(B1) | 2007-06-01 | Sprauve et al. | Applicant |
| US7246140(B2) | 2007-07-01 | Therrien et al. | Applicant |
| US7246207(B2) | 2007-07-01 | Kottomtharayil | Applicant |
| US7257689(B1) | 2007-08-01 | Baird | Applicant |
| US7269612(B2) | 2007-09-01 | Devarakonda et al. | Applicant |
| US7269641(B2) | 2007-09-01 | Powers et al. | Applicant |
| US7272606(B2) | 2007-09-01 | Borthakur et al. | Applicant |
| US7275138(B2) | 2007-09-01 | Saika | Applicant |
| US7275177(B2) | 2007-09-01 | Armangau et al. | Applicant |
| US7278142(B2) | 2007-10-01 | Bandhole et al. | Applicant |
| US7284153(B2) | 2007-10-01 | Okbay et al. | Applicant |
| US7287047(B2) | 2007-10-01 | Kavuri | Applicant |
| US7293133(B1) | 2007-11-01 | Colgrove et al. | Applicant |
| US7296125(B2) | 2007-11-01 | Ohran | Applicant |
| US7315923(B2) | 2008-01-01 | Retnamma et al. | Applicant |
| US7318134(B1) | 2008-01-01 | Oliveira et al. | Applicant |
| US7340652(B2) | 2008-03-01 | Jarvis et al. | Applicant |
| US7343356(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7343365(B2) | 2008-03-01 | Farnham et al. | Applicant |
| US7343453(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7343459(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7346623(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7346751(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7356657(B2) | 2008-04-01 | Mikami | Applicant |
| US7359917(B2) | 2008-04-01 | Winter et al. | Applicant |
| US7363444(B2) | 2008-04-01 | Ji | Applicant |
| US7370232(B2) | 2008-05-01 | Safford | Applicant |
| US7373364(B1) | 2008-05-01 | Chapman | Applicant |
| US7380072(B2) | 2008-05-01 | Kottomtharayil et al. | Applicant |
| US7383293(B2) | 2008-06-01 | Gupta et al. | Applicant |
| US7389311(B1) | 2008-06-01 | Crescenti et al. | Applicant |
| US7392360(B1) | 2008-06-01 | Aharoni et al. | Applicant |
| US7395282(B1) | 2008-07-01 | Crescenti et al. | Applicant |
| US7401064(B1) | 2008-07-01 | Arone et al. | Applicant |
| US7409509(B2) | 2008-08-01 | Devassy et al. | Applicant |
| US7415488(B1) | 2008-08-01 | Muth et al. | Applicant |
| US7428657(B2) | 2008-09-01 | Yamasaki | Applicant |
| US7430587(B2) | 2008-09-01 | Malone et al. | Applicant |
| US7433301(B2) | 2008-10-01 | Akahane et al. | Applicant |
| US7440982(B2) | 2008-10-01 | Lu et al. | Applicant |
| US7454569(B2) | 2008-11-01 | Kavuri et al. | Applicant |
| US7457980(B2) | 2008-11-01 | Yang et al. | Applicant |
| US7461230(B1) | 2008-12-01 | Gupta et al. | Applicant |
| US7464236(B2) | 2008-12-01 | Sano et al. | Applicant |
| US7467167(B2) | 2008-12-01 | Patterson | Applicant |
| US7467267(B1) | 2008-12-01 | Mayock | Applicant |
| US7469262(B2) | 2008-12-01 | Baskaran et al. | Applicant |
| US7472238(B1) | 2008-12-01 | Gokhale et al. | Applicant |
| US7472312(B2) | 2008-12-01 | Jarvis et al. | Applicant |
| US7475284(B2) | 2009-01-01 | Koike | Applicant |
| US7484054(B2) | 2009-01-01 | Kottomtharayil et al. | Applicant |
| US7490207(B2) | 2009-02-01 | Amarendran | Applicant |
| US7496589(B1) | 2009-02-01 | Jain et al. | Applicant |
| US7496690(B2) | 2009-02-01 | Beverly et al. | Applicant |
| US7500053(B1) | 2009-03-01 | Kavuri et al. | Applicant |
| US7500150(B2) | 2009-03-01 | Sharma et al. | Applicant |
| US7502902(B2) | 2009-03-01 | Sato et al. | Applicant |
| US7509316(B2) | 2009-03-01 | Greenblatt et al. | Applicant |
| US7512601(B2) | 2009-03-01 | Cucerzan et al. | Applicant |
| US7516088(B2) | 2009-04-01 | Johnson et al. | Applicant |
| US7519726(B2) | 2009-04-01 | Palliyil et al. | Applicant |
| US7523483(B2) | 2009-04-01 | Dogan | Applicant |
| US7529745(B2) | 2009-05-01 | Ahluwalia et al. | Applicant |
| US7529748(B2) | 2009-05-01 | Wen et al. | Applicant |
| US7529782(B2) | 2009-05-01 | Prahlad et al. | Applicant |
| US7529898(B2) | 2009-05-01 | Nguyen et al. | Applicant |
| US7532340(B2) | 2009-05-01 | Koppich et al. | Applicant |
| US7533181(B2) | 2009-05-01 | Dawson et al. | Applicant |
| US7536291(B1) | 2009-05-01 | Retnamma et al. | Applicant |
| US7539707(B2) | 2009-05-01 | Prahlad et al. | Applicant |
| US7539835(B2) | 2009-05-01 | Kaiser | Applicant |
| US7543125(B2) | 2009-06-01 | Gokhale | Applicant |
| US7546324(B2) | 2009-06-01 | Prahlad et al. | Applicant |
| US7546364(B2) | 2009-06-01 | Raman et al. | Applicant |
| US7565572(B2) | 2009-07-01 | Yamasaki | Applicant |
| US7581077(B2) | 2009-08-01 | Ignatius et al. | Applicant |
| US7593966(B2) | 2009-09-01 | Therrien et al. | Applicant |
| US7596586(B2) | 2009-09-01 | Gokhale et al. | Applicant |
| US7606841(B1) | 2009-10-01 | Ranade | Applicant |
| US7606844(B2) | 2009-10-01 | Kottomtharayil | Applicant |
| US7613748(B2) | 2009-11-01 | Brockway et al. | Applicant |
| US7613750(B2) | 2009-11-01 | Valiyaparambil et al. | Applicant |
| US7617253(B2) | 2009-11-01 | Prahlad et al. | Applicant |
| US7617262(B2) | 2009-11-01 | Prahlad et al. | Applicant |
| US7617321(B2) | 2009-11-01 | Clark | Applicant |
| US7617369(B1) | 2009-11-01 | Bezbaruah et al. | Applicant |
| US7617541(B2) | 2009-11-01 | Plotkin et al. | Applicant |
| US7627598(B1) | 2009-12-01 | Burke | Applicant |
| US7627617(B2) | 2009-12-01 | Kavuri et al. | Applicant |
| US7636743(B2) | 2009-12-01 | Erofeev | Applicant |
| US7651593(B2) | 2010-01-01 | Prahlad et al. | Applicant |
| US7661028(B2) | 2010-02-01 | Erofeev | Applicant |
| US7668798(B2) | 2010-02-01 | Scanlon et al. | Applicant |
| US7669029(B1) | 2010-02-01 | Mishra et al. | Applicant |
| US7672979(B1) | 2010-03-01 | Appellof et al. | Applicant |
| US7673000(B2) | 2010-03-01 | Smoot et al. | Applicant |
| US7685126(B2) | 2010-03-01 | Patel et al. | Applicant |
| US7689467(B1) | 2010-03-01 | Belanger et al. | Applicant |
| US7694086(B1) | 2010-04-01 | Bezbaruah et al. | Applicant |
| US7702533(B2) | 2010-04-01 | Barnard et al. | Applicant |
| US7702670(B1) | 2010-04-01 | Duprey et al. | Applicant |
| US7707184(B1) | 2010-04-01 | Zhang et al. | Applicant |
| US7716171(B2) | 2010-05-01 | Kryger | Applicant |
| US7734715(B2) | 2010-06-01 | Hyakutake et al. | Applicant |
| US7739235(B2) | 2010-06-01 | Rousseau et al. | Applicant |
| US7809691(B1) | 2010-10-01 | Karmarkar et al. | Applicant |
| US7810067(B2) | 2010-10-01 | Kaelicke et al. | Applicant |
| US7831553(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7831622(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7840533(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7840537(B2) | 2010-11-01 | Gokhale et al. | Applicant |
| US7870355(B2) | 2011-01-01 | Erofeev | Applicant |
| US7904681(B1) | 2011-03-01 | Bappe | Applicant |
| US7930476(B1) | 2011-04-01 | Castelli et al. | Applicant |
| US7962455(B2) | 2011-06-01 | Erofeev | Applicant |
| US7962709(B2) | 2011-06-01 | Agrawal | Applicant |
| US8005795(B2) | 2011-08-01 | Galipeau et al. | Applicant |
| US8024294(B2) | 2011-09-01 | Kottomtharayil | Applicant |
| US8121983(B2) | 2012-02-01 | Prahlad et al. | Applicant |
| US8166263(B2) | 2012-04-01 | Prahlad | Applicant |
| US8190565(B2) | 2012-05-01 | Prahlad et al. | Applicant |
| US8195623(B2) | 2012-06-01 | Prahlad et al. | Applicant |
| US8204859(B2) | 2012-06-01 | Ngo | Applicant |
| US8219524(B2) | 2012-07-01 | Gokhale | Applicant |
| US8271830(B2) | 2012-09-01 | Erofeev | Applicant |
| US8285684(B2) | 2012-10-01 | Prahlad et al. | Applicant |
| US8352422(B2) | 2013-01-01 | Prahlad et al. | Applicant |
| US8463751(B2) | 2013-06-01 | Kottomtharayil | Applicant |
| US8489656(B2) | 2013-07-01 | Erofeev | Applicant |
| US8504515(B2) | 2013-08-01 | Prahlad et al. | Applicant |
| US8504517(B2) | 2013-08-01 | Agrawal | Applicant |
| US8572038(B2) | 2013-10-01 | Erofeev | Applicant |
| US8589347(B2) | 2013-11-01 | Erofeev | Applicant |
| US8655850(B2) | 2014-02-01 | Ngo et al. | Applicant |
| US8656218(B2) | 2014-02-01 | Erofeev | Applicant |
| US8666942(B2) | 2014-03-01 | Ngo | Applicant |
| US8725694(B2) | 2014-05-01 | Kottomtharayil | Applicant |
| US8725698(B2) | 2014-05-01 | Prahlad et al. | Applicant |
| US8726242(B2) | 2014-05-01 | Ngo | Applicant |
| US8745105(B2) | 2014-06-01 | Erofeev | Applicant |
| US8793221(B2) | 2014-07-01 | Prahlad et al. | Applicant |
| US8868494(B2) | 2014-10-01 | Agrawal | Applicant |
| US2001/0029512(A1) | 2001-10-01 | Oshinsky et al. | Applicant |
| US2001/0029517(A1) | 2001-10-01 | De Meno et al. | Applicant |
| US2001/0032172(A1) | 2001-10-01 | Moulinet et al. | Applicant |
| US2001/0035866(A1) | 2001-11-01 | Finger et al. | Applicant |
| US2001/0042222(A1) | 2001-11-01 | Kedem et al. | Applicant |
| US2001/0044807(A1) | 2001-11-01 | Kleiman et al. | Applicant |
| US2002/0002557(A1) | 2002-01-01 | Straube et al. | Applicant |
| US2002/0004883(A1) | 2002-01-01 | Nguyen et al. | Applicant |
| US2002/0019909(A1) | 2002-02-01 | D'Errico | Applicant |
| US2002/0023051(A1) | 2002-02-01 | Kunzle et al. | Applicant |
| US2002/0040376(A1) | 2002-04-01 | Yamanaka et al. | Applicant |
| US2002/0042869(A1) | 2002-04-01 | Tate et al. | Applicant |
| US2002/0049626(A1) | 2002-04-01 | Mathias et al. | Applicant |
| US2002/0049718(A1) | 2002-04-01 | Kleiman et al. | Applicant |
| US2002/0049738(A1) | 2002-04-01 | Epstein | Applicant |
| US2002/0049778(A1) | 2002-04-01 | Bell et al. | Applicant |
| US2002/0062230(A1) | 2002-05-01 | Morag et al. | Applicant |
| US2002/0069324(A1) | 2002-06-01 | Gerasimov et al. | Applicant |
| US2002/0083055(A1) | 2002-06-01 | Pachet et al. | Applicant |
| US2002/0091712(A1) | 2002-07-01 | Martin et al. | Applicant |
| US2002/0103848(A1) | 2002-08-01 | Giacomini et al. | Applicant |
| US2002/0107877(A1) | 2002-08-01 | Whiting et al. | Applicant |
| US2002/0112134(A1) | 2002-08-01 | Ohran et al. | Applicant |
| US2002/0120741(A1) | 2002-08-01 | Webb et al. | Applicant |
| US2002/0124137(A1) | 2002-09-01 | Ulrich et al. | Applicant |
| US2002/0133511(A1) | 2002-09-01 | Hostetter et al. | Applicant |
| US2002/0133512(A1) | 2002-09-01 | Milillo et al. | Applicant |
| US2002/0161753(A1) | 2002-10-01 | Inaba et al. | Applicant |
| US2002/0174107(A1) | 2002-11-01 | Poulin | Applicant |
| US2002/0174139(A1) | 2002-11-01 | Midgley et al. | Applicant |
| US2002/0174416(A1) | 2002-11-01 | Bates et al. | Applicant |
| US2002/0181395(A1) | 2002-12-01 | Foster et al. | Applicant |
| US2003/0005119(A1) | 2003-01-01 | Mercier et al. | Applicant |
| US2003/0018657(A1) | 2003-01-01 | Monday | Applicant |
| US2003/0023893(A1) | 2003-01-01 | Lee et al. | Applicant |
| US2003/0028736(A1) | 2003-02-01 | Berkowitz et al. | Applicant |
| US2003/0033308(A1) | 2003-02-01 | Patel et al. | Applicant |
| US2003/0061491(A1) | 2003-03-01 | Jaskiewicz et al. | Applicant |
| US2003/0079018(A1) | 2003-04-01 | Lolayekar et al. | Applicant |
| US2003/0097296(A1) | 2003-05-01 | Putt | Applicant |
| US2003/0126200(A1) | 2003-07-01 | Wolff | Applicant |
| US2003/0131278(A1) | 2003-07-01 | Fujibayashi | Applicant |
| US2003/0135783(A1) | 2003-07-01 | Martin et al. | Applicant |
| US2003/0161338(A1) | 2003-08-01 | Ng et al. | Applicant |
| US2003/0167380(A1) | 2003-09-01 | Green et al. | Applicant |
| US2003/0177149(A1) | 2003-09-01 | Coombs | Applicant |
| US2003/0177321(A1) | 2003-09-01 | Watanabe | Applicant |
| US2003/0187847(A1) | 2003-10-01 | Lubbers et al. | Applicant |
| US2003/0225800(A1) | 2003-12-01 | Kavuri | Applicant |
| US2004/0006572(A1) | 2004-01-01 | Hoshino et al. | Applicant |
| US2004/0006578(A1) | 2004-01-01 | Yu | Applicant |
| US2004/0010487(A1) | 2004-01-01 | Prahlad et al. | Applicant |
| US2004/0015468(A1) | 2004-01-01 | Beier et al. | Applicant |
| US2004/0039679(A1) | 2004-02-01 | Norton et al. | Applicant |
| US2004/0078632(A1) | 2004-04-01 | Infante et al. | Applicant |
| US2004/0098425(A1) | 2004-05-01 | Wiss et al. | Applicant |
| US2004/0107199(A1) | 2004-06-01 | Dalrymple et al. | Applicant |
| US2004/0117438(A1) | 2004-06-01 | Considine et al. | Applicant |
| US2004/0117572(A1) | 2004-06-01 | Welsh et al. | Applicant |
| US2004/0133634(A1) | 2004-07-01 | Luke et al. | Applicant |
| US2004/0139128(A1) | 2004-07-01 | Becker et al. | Applicant |
| US2004/0158588(A1) | 2004-08-01 | Pruet | Applicant |
| US2004/0193625(A1) | 2004-09-01 | Sutoh et al. | Applicant |
| US2004/0193953(A1) | 2004-09-01 | Callahan et al. | Applicant |
| US2004/0205206(A1) | 2004-10-01 | Naik et al. | Applicant |
| US2004/0212639(A1) | 2004-10-01 | Smoot et al. | Applicant |
| US2004/0215724(A1) | 2004-10-01 | Smoot et al. | Applicant |
| US2004/0225437(A1) | 2004-11-01 | Endo et al. | Applicant |
| US2004/0230829(A1) | 2004-11-01 | Dogan et al. | Applicant |
| US2004/0236958(A1) | 2004-11-01 | Teicher et al. | Applicant |
| US2004/0249883(A1) | 2004-12-01 | Srinivasan et al. | Applicant |
| US2004/0250033(A1) | 2004-12-01 | Prahlad et al. | Applicant |
| US2004/0254919(A1) | 2004-12-01 | Giuseppini | Applicant |
| US2004/0260678(A1) | 2004-12-01 | Verbowski et al. | Applicant |
| US2004/0267777(A1) | 2004-12-01 | Sugimura et al. | Applicant |
| US2004/0267835(A1) | 2004-12-01 | Zwilling et al. | Applicant |
| US2004/0267836(A1) | 2004-12-01 | Armangau et al. | Applicant |
| US2005/0015409(A1) | 2005-01-01 | Cheng et al. | Examiner |
| US2005/0027892(A1) | 2005-02-01 | McCabe et al. | Applicant |
| US2005/0033800(A1) | 2005-02-01 | Kavuri et al. | Applicant |
| US2005/0044114(A1) | 2005-02-01 | Kottomtharayil et al. | Applicant |
| US2005/0055445(A1) | 2005-03-01 | Gupta et al. | Applicant |
| US2005/0060613(A1) | 2005-03-01 | Cheng | Applicant |
| US2005/0071389(A1) | 2005-03-01 | Gupta | Applicant |
| US2005/0071391(A1) | 2005-03-01 | Fuerderer et al. | Applicant |
| US2005/0080928(A1) | 2005-04-01 | Beverly et al. | Applicant |
| US2005/0086443(A1) | 2005-04-01 | Mizuno et al. | Applicant |
| US2005/0108292(A1) | 2005-05-01 | Burton et al. | Applicant |
| US2005/0114406(A1) | 2005-05-01 | Borthakur et al. | Applicant |
| US2005/0131900(A1) | 2005-06-01 | Palliyll et al. | Applicant |
| US2005/0138306(A1) | 2005-06-01 | Panchbudhe et al. | Applicant |
| US2005/0144202(A1) | 2005-06-01 | Chen | Applicant |
| US2005/0172073(A1) | 2005-08-01 | Voigt et al. | Applicant |
| US2005/0187982(A1) | 2005-08-01 | Sato | Applicant |
| US2005/0187992(A1) | 2005-08-01 | Prahlad et al. | Applicant |
| US2005/0188109(A1) | 2005-08-01 | Shiga et al. | Applicant |
| US2005/0188254(A1) | 2005-08-01 | Urabe et al. | Applicant |
| US2005/0193026(A1) | 2005-09-01 | Prahlad et al. | Applicant |
| US2005/0198083(A1) | 2005-09-01 | Saika et al. | Applicant |
| US2005/0228875(A1) | 2005-10-01 | Monitzer et al. | Applicant |
| US2005/0246376(A1) | 2005-11-01 | Lu et al. | Applicant |
| US2005/0246510(A1) | 2005-11-01 | Retnamma et al. | Applicant |
| US2005/0254456(A1) | 2005-11-01 | Sakai | Applicant |
| US2005/0268068(A1) | 2005-12-01 | Ignatius et al. | 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/0010341(A1) | 2006-01-01 | Kodama | Applicant |
| US2006/0020616(A1) | 2006-01-01 | Hardy et al. | Applicant |
| US2006/0034454(A1) | 2006-02-01 | Damgaard et al. | Applicant |
| US2006/0036901(A1) | 2006-02-01 | Yang et al. | Applicant |
| US2006/0047805(A1) | 2006-03-01 | Byrd et al. | Applicant |
| US2006/0047931(A1) | 2006-03-01 | Saika | Applicant |
| US2006/0092861(A1) | 2006-05-01 | Corday et al. | Applicant |
| US2006/0107089(A1) | 2006-05-01 | Jansz et al. | Applicant |
| US2006/0120401(A1) | 2006-06-01 | Harada et al. | Applicant |
| US2006/0129537(A1) | 2006-06-01 | Torii et al. | Applicant |
| US2006/0136685(A1) | 2006-06-01 | Griv et al. | Applicant |
| US2006/0155946(A1) | 2006-07-01 | Ji | Applicant |
| US2006/0171315(A1) | 2006-08-01 | Choi et al. | Applicant |
| US2006/0174075(A1) | 2006-08-01 | Sutoh | Applicant |
| US2006/0215564(A1) | 2006-09-01 | Breitgand et al. | Applicant |
| US2006/0230244(A1) | 2006-10-01 | Amarendran et al. | Applicant |
| US2006/0242371(A1) | 2006-10-01 | Shono et al. | Applicant |
| US2006/0242489(A1) | 2006-10-01 | Brockway et al. | Applicant |
| US2007/0033437(A1) | 2007-02-01 | Kawamura | Applicant |
| US2007/0043956(A1) | 2007-02-01 | El Far et al. | Applicant |
| US2007/0050547(A1) | 2007-03-01 | Sano | Applicant |
| US2007/0055737(A1) | 2007-03-01 | Yamashita et al. | Applicant |
| US2007/0094467(A1) | 2007-04-01 | Yamasaki | Applicant |
| US2007/0100867(A1) | 2007-05-01 | Celik et al. | Applicant |
| US2007/0112897(A1) | 2007-05-01 | Asano et al. | Applicant |
| US2007/0113006(A1) | 2007-05-01 | Elliott et al. | Applicant |
| US2007/0124347(A1) | 2007-05-01 | Vivian et al. | Applicant |
| US2007/0124348(A1) | 2007-05-01 | Claborn et al. | Applicant |
| US2007/0130373(A1) | 2007-06-01 | Kalwitz | Applicant |
| US2007/0143371(A1) | 2007-06-01 | Kottomtharayil | Applicant |
| US2007/0143756(A1) | 2007-06-01 | Gokhale | Applicant |
| US2007/0179990(A1) | 2007-08-01 | Zimran et al. | Applicant |
| US2007/0183224(A1) | 2007-08-01 | Erofeev | Applicant |
| US2007/0185852(A1) | 2007-08-01 | Erofeev | Applicant |
| US2007/0185937(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0185938(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0185939(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0185940(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0186042(A1) | 2007-08-01 | Kottomtharayil et al. | Applicant |
| US2007/0186068(A1) | 2007-08-01 | Agrawal | Applicant |
| US2007/0198602(A1) | 2007-08-01 | Ngo et al. | Applicant |
| US2007/0226438(A1) | 2007-09-01 | Erofeev | Applicant |
| US2007/0233756(A1) | 2007-10-01 | D'Souza et al. | Applicant |
| US2007/0244571(A1) | 2007-10-01 | Wilson et al. | Applicant |
| US2007/0260609(A1) | 2007-11-01 | Tulyani | Applicant |
| US2007/0276848(A1) | 2007-11-01 | Kim | Applicant |
| US2007/0288536(A1) | 2007-12-01 | Sen et al. | Applicant |
| US2008/0016126(A1) | 2008-01-01 | Kottomtharayil et al. | Applicant |
| US2008/0016293(A1) | 2008-01-01 | Saika | Applicant |
| US2008/0028009(A1) | 2008-01-01 | Ngo | Applicant |
| US2008/0059515(A1) | 2008-03-01 | Fulton | Applicant |
| US2008/0077634(A1) | 2008-03-01 | Quakenbush | Applicant |
| US2008/0077636(A1) | 2008-03-01 | Gupta et al. | Applicant |
| US2008/0103916(A1) | 2008-05-01 | Camarador et al. | Applicant |
| US2008/0104357(A1) | 2008-05-01 | Kim et al. | Applicant |
| US2008/0114815(A1) | 2008-05-01 | Sutoh | Applicant |
| US2008/0147878(A1) | 2008-06-01 | Kottomtharayil et al. | Applicant |
| US2008/0183775(A1) | 2008-07-01 | Prahlad et al. | Applicant |
| US2008/0205301(A1) | 2008-08-01 | Burton et al. | Applicant |
| US2008/0208933(A1) | 2008-08-01 | Lyon | Applicant |
| US2008/0228987(A1) | 2008-09-01 | Yagi | 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/0244205(A1) | 2008-10-01 | Amano et al. | Applicant |
| US2008/0250178(A1) | 2008-10-01 | Haustein et al. | Applicant |
| US2008/0306954(A1) | 2008-12-01 | Hornqvist | Applicant |
| US2008/0313497(A1) | 2008-12-01 | Hirakawa | Applicant |
| US2009/0013014(A1) | 2009-01-01 | Kern | Applicant |
| US2009/0044046(A1) | 2009-02-01 | Yamasaki | Applicant |
| US2009/0113056(A1) | 2009-04-01 | Tameshige | Applicant |
| US2009/0150462(A1) | 2009-06-01 | McClanahan et al. | Applicant |
| US2009/0182963(A1) | 2009-07-01 | Prahlad et al. | Applicant |
| US2009/0187944(A1) | 2009-07-01 | White et al. | Applicant |
| US2009/0300079(A1) | 2009-12-01 | Shitomi | Examiner |
| 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/0049753(A1) | 2010-02-01 | Prahlad et al. | Applicant |
| US2010/0094808(A1) | 2010-04-01 | Erofeev | Applicant |
| US2010/0100529(A1) | 2010-04-01 | Erofeev | Applicant |
| US2010/0122053(A1) | 2010-05-01 | Prahlad et al. | Applicant |
| US2010/0131461(A1) | 2010-05-01 | Prahlad et al. | Applicant |
| US2010/0131467(A1) | 2010-05-01 | Prahlad et al. | Applicant |
| US2010/0145909(A1) | 2010-06-01 | Ngo | Applicant |
| US2010/0153338(A1) | 2010-06-01 | Ngo et al. | Applicant |
| US2010/0179941(A1) | 2010-07-01 | Agrawal et al. | Applicant |
| US2010/0205150(A1) | 2010-08-01 | Prahlad et al. | Applicant |
| US2010/0211571(A1) | 2010-08-01 | Prahlad et al. | Applicant |
| US2011/0066599(A1) | 2011-03-01 | Prahlad et al. | Applicant |
| US2011/0246429(A1) | 2011-10-01 | Prahlad et al. | Applicant |
| US2012/0011336(A1) | 2012-01-01 | Saika | Applicant |
| US2012/0317074(A1) | 2012-12-01 | Ngo | Applicant |
| US2013/0006926(A1) | 2013-01-01 | Erofeev | Applicant |
| US2013/0006938(A1) | 2013-01-01 | Prahlad et al. | Applicant |
| US2013/0006942(A1) | 2013-01-01 | Prahlad et al. | Applicant |
| US2013/0254166(A1) | 2013-09-01 | Kottomtharayil | Applicant |
| US2014/0032495(A1) | 2014-01-01 | Erofeev | Applicant |
| US2014/0164327(A1) | 2014-06-01 | Ngo et al. | Applicant |
| US2014/0181022(A1) | 2014-06-01 | Ngo | Applicant |
| US2014/0181029(A1) | 2014-06-01 | Erofeev | Applicant |
| US2014/0236900(A1) | 2014-08-01 | Kottomtharayil | Applicant |
| US2014/0244586(A1) | 2014-08-01 | Ngo | Applicant |
| US2014/0324772(A1) | 2014-10-01 | Prahlad et al. | Applicant |
| AU2006331932 | 2006-12-01 | Applicant | |
| CA2632935 | 2006-12-01 | 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 | |
| EP1349089 | 2003-01-01 | Applicant | |
| EP1349088 | 2003-10-01 | Applicant | |
| EP1579331 | 2005-09-01 | Applicant | |
| EP1974296 | 2008-10-01 | Applicant | |
| GB2256952 | 1992-12-01 | Applicant | |
| GB2411030 | 2005-08-01 | Applicant | |
| JP5189281 | 1993-07-01 | Applicant | |
| JP6274605 | 1994-09-01 | Applicant | |
| JP9016463 | 1997-01-01 | Applicant | |
| JP11259348 | 1999-09-01 | Applicant | |
| JP200347811 | 2000-12-01 | Applicant | |
| WO93/03549 | 1993-02-01 | Applicant | |
| WO95/13580 | 1995-05-01 | Applicant | |
| WO98/39707 | 1998-09-01 | Applicant | |
| WO99/12098 | 1999-03-01 | Applicant | |
| WO99/14692 | 1999-03-01 | Applicant | |
| WO2/095632 | 2002-11-01 | Applicant | |
| WO3/028183 | 2003-04-01 | Applicant | |
| WO2004/034197 | 2004-04-01 | Applicant | |
| WO2005/055093 | 2005-06-01 | Applicant | |
| WO2005/086032 | 2005-09-01 | Applicant | |
| WO2007/053314 | 2007-05-01 | Applicant | |
| WO2010/068570 | 2010-06-01 | Applicant |
Non-Patent Literature (44)
- 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
- Arneson, David A., Control Data Corporation, Development of Omniserver; Mass Storage Systems, 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
- Cabrera, et al. “ADSM: A Multi-Platform, Scalable, Back-up and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5, 1995-Mar. 9, 1995, pp. 420-427, San Francisco, CA.Applicant
- Calvert, “SQL Server 2005 Snapshots”, published Apr. 3, 2006, http:/www.simple-talk.com/contnet/print.aspx?article=137, 6 pages.Applicant
- Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.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
- Gray, et al. “Transaction processing: concepts and techniques” 1994, Morgan Kaufmann Publishers, USA, pp. 604-609, 646-655.B7.Applicant
- Harrington, “The RFP Process: How to Hire a Third Party”, Transportation & Distribution, Sep. 1988, vol. 39, Issue 9, in 5 pages.Applicant
- http://en.wikipedia.org/wiki/Naive—Bayes—classifier, printed on Jun. 1, 2010, in 7 pages.Applicant
- IBM, “Intelligent Selection of Logs Required During Recovery Processing”, ip.com, Sep. 16, 2002, 4 pages.Applicant
- IBM, “Near Zero Impact Backup and Data Replication Appliance”, ip.com, Oct. 18. 2004, 5 pages.Applicant
- Jander, “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4(Mar. 21, 1998), pp. 64-72.Applicant
- Kashyap, et al., “Professional Services Automation: A knowledge Mangement approach using LSI and Domain specific Ontologies”, FLAIRS-01 Proceedings, 2001, pp. 300-302.Applicant
- Lyon, Design considerations in replicated database systems for disaster protection, Compcon 1988, Feb. 29, 1988, pp. 428-430.Applicant
- Microsoft Corporation, “Microsoft Exchange Server: Best Practices for Exchange Database Management,” 1998.Applicant
- Park, et al., “An Efficient Logging Scheme for Recoverable Distributed Shared Memory Systems”, IEEE, 1997, 9 pages.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
- The Oracle8 Replication Manual, Part No. A58245-01; Chapters 1-2; Dec. 1, 1997; obtained from website: http://download-west.oracle.com/docs/cd/A64702—01/doc/server.805/a58245/toc.htm on May 20, 2009.Applicant
- Veritas Software Corporation, “Veritas Volume Manager 3.2, Administrator's Guide,” Aug., 2001, 360 pages.Applicant
- Wiesmann, Database replication techniques: a three parameter classification. Oct. 16. 2000, pp. 206-215.Applicant
- Final Office Action for Japanese Application No. 2003531581, Mail Date Mar. 24, 2009, 6 pages.Applicant
- International Search Report and Written Opinion dated Nov. 13, 2009, PCT/US2007/081681.Applicant
- First Office Action for Japanese Application No. 2003531581, Mail Date Jul. 8, 2008, 8 pages.Applicant
- International Preliminary Report on Patentability, PCT Application No. PCT/US2009/066880, mailed Jun. 23, 2011, in 9 pages.Applicant
- International Search Report and Written Opinion issued in PCT Application No. PCT/US2011/030396, mailed Jul. 18, 2011, in 20 pages.Applicant
- International Search Report and Written Opinion issued in PCT Application No. PCT/US2011/38436, mailed Sep. 21, 2011, in 18 pages.Applicant
- Canadian Office Action dated Sep. 24, 2012, Application No. 2,632,935, 2 pages.Applicant
- European Examination Report; Application No, 06848901.2, Apr. 1, 2009, pp. 7.Applicant
- Examiner's First Report; Application No. 2006331932, May 11, 2011 in 2 pages.Applicant
- Canadian Office Action dated Dec. 29, 2010, Application No. CA2546304.Applicant
- Examiner's Report for Australian Application No. 2003279847, Dated Dec. 9, 2008, 4 pages.Applicant
- First Office Action in Canadian application No. 2,632,935 dated Feb. 16, 2012, in 5 pages.Applicant
- International Search Report dated May 15, 2007, PCT/US2006/048273.Applicant
- Second Examination Report in EU Appl. No. 06 848 901.2-2201 dated Dec. 3, 2010.Applicant
- International Search Report and Written Opinion dated Mar. 25, 2010, PCT/US2009/066880.Applicant
- International Preliminary Report on Patentability and Written Opinion in PCT/US2011/030396 mailed Oct. 2, 2012.Applicant
- International Preliminary Report on Patentability and Written Opinion in PCT/US2011/038436 mailed Dec. 4, 2012.Applicant
- International Search Report dated Dec. 28, 2009, PCT/US204/038324.Applicant
- International Search Report and Written Opinion dated Jan. 11, 2006, PCT/US2004/038455.Applicant
- Exam Report in Australian Application No. 2009324800 dated Jun. 17, 2013.Applicant
- U.S. Appl. No. 14/038,540, filed Sep. 26, 2013, Erofeev.Applicant