Patent Grant
11709739
Single instancing in a data storage system typically involves attempting to store only a single instance of a file on a storage device. In certain single instancing systems, a separate folder on the file system of the storage device is created for each single instancing storage operation performed. Each file that has been single instanced is stored as a separate individual file in the separate folder.
Because there may be numerous computing systems in the data storage system, each requiring one or more storage operations, these techniques may result in the creation of numerous folders, each containing numerous files. For example, if there are hundreds of computing systems, each having thousands of files, backing up or copying all of these files may potentially result in the creation of millions of files on the storage device.
Certain file systems of storage devices may not be capable of adequately providing for storing such large numbers of files. Other file systems may be equipped to handle storing millions of files or more, but may not perform optimally in such situations.
The need exists for systems and methods that overcome the above problems, as well as that provide additional benefits. Overall, the examples herein of some prior or related systems and their associated limitations are intended to be illustrative and not exclusive. Other limitations of existing or prior systems will become apparent to those of skill in the art upon reading the following Detailed Description.
The headings provided herein are for convenience only and do not necessarily affect the scope or meaning of the claimed invention.
This application describes in detail, among other things, systems and methods for single instancing (alternatively called deduplicating) blocks of data in a data storage system (alternatively called a data storage network, a data storage environment, or a data storage enterprise). The data storage system stores single instanced blocks of data (alternatively referred to as deduplicated blocks of data) in one or more files and maintains one or more data structures (e.g., index files) that keep track of which blocks of data are referenced. This allows the data storage system to, among other things: 1) single-instance data at a more granular level (at a block-level instead of at a file-level); 2) reduce or eliminate redundantly stored data, thereby saving storage space; 3) store very large numbers of blocks of data without regard to file system limitations; and 4) delete data that no longer needs to be stored, while still maintaining data that needs to be stored.
The data storage system, for example, may include multiple computing devices or computing systems (e.g., client computing devices) that store primary data (e.g., production data such as system files, user files, etc.). The data storage system may also include a secondary storage computing device, a single instance database, and one or more storage devices that store copies of the primary data (e.g., secondary copies, tertiary copies, etc.). The secondary storage computing device receives blocks of data from the computing devices and accesses the single instance database to determine whether the blocks of data are unique (unique meaning that no instances of the blocks of data are already stored on the storage devices). If a block of data is unique, the single instance database stores it in a file on a storage device. If not, the secondary storage computing device can avoid storing the block of data on the storage devices.
The primary data of the computing devices can be divided into data that is eligible for single instancing and data that is not eligible for single instancing. An example of the latter is metadata (e.g., Master File Table (MFT) information) and an example of the former is data (e.g., operating system and/or application files). A file typically comprises one or more blocks as tracked by the file systems of the computing devices.
The computing devices align data that is eligible for single instancing into blocks of data (which may comprise one or more blocks as tracked by the file systems of the computing devices) and generate identifiers for the blocks of data that the secondary storage computing device uses to determine if the blocks of data are unique. This allows the secondary storage computing device to avoid generating identifiers for the blocks of data, which may be computationally expensive and/or require a long time to perform. Therefore, the distribution of the task of generating identifiers (which can be computationally expensive operations) across numerous computing devices frees up the secondary storage computing device to perform other operations (e.g., storing data, retrieving data, pruning data, etc.).
The computing devices send the blocks of data and other data (e.g., metadata and/or the data that is not eligible for single instancing) in a data stream to the secondary storage computing device. The secondary storage computing device receives the data stream and stores blocks of data and their identifiers in buffers in random access memory (RAM). The secondary storage computing device determines whether a block of data is already stored on a storage device. To do this, the secondary storage computing device determines, by analyzing data structures in the single instance database in view of the block's identifier, whether the block of data is already stored on a storage device. If it is, then the secondary storage computing device 1) stores a link to the already stored block of data in a metadata file and 2) discards the block of data from the memory buffer. If it is not, then the secondary storage computing device stores the block of data in a container file.
Because the size of a block of data and associated metadata is typically less then the size of a memory buffer, the secondary storage computing device can keep a single block of data in a single memory buffer while it looks up its identifier in the single instance database. This allows the secondary storage computing device to avoid writing the block of data to disk (an operation which is typically slower than storing the block of data in a RAM buffer) until the secondary storage computing device determines that it needs to store the block of data in a container file on a storage device. The secondary storage computing device stores data that is not eligible for single instancing in metadata files.
By storing multiple blocks of data in a single container file, the secondary storage computing device avoids storing each block of data as a separate file on the file systems of the storage devices. This reduces the number of files that would be stored on the file systems of the storage devices, thereby ensuring that the storage devices can adequately store the data of the computing devices in the data storage system.
One advantage of these techniques is that they significantly reduce the number of files stored on a file system of a computing device or storage device. This is at least partly due to the storage of data blocks within the container files. Even if the secondary storage computing device performs numerous storage operations, these techniques will result in storing far fewer files on the file system than storage operations where each data block is stored as a separate file. Therefore, the file system of the computing device or storage device may not necessarily have to contend with storing excessively large numbers of files, such as millions of files or more. Accordingly, these techniques enable very large numbers of blocks of data to be stored without regard to limitations of the file system of the computing device or storage device.
However, the storage of blocks of data in container files may create additional complexities when it comes time to prune data. This is because a container file may contain blocks of data that are referenced by links in metadata files and thus cannot be deleted, because referenced blocks of data typically still need to be stored on the storage devices. Furthermore, because the blocks of data are not stored as files on the file systems of the storage devices, they cannot be directly referenced by the file system.
The systems and methods described herein provide solutions to these problems. The secondary storage computing device creates the container files as sparse files (typically only on operating systems that support sparse files, e.g., Windows operating systems, and other operating systems that support sparse files). A sparse file is type of file that may include empty space (e.g., a sparse file may have real data within it, such as at the beginning of the file and/or at the end of the file, but may also have empty space in it that is not storing actual data, such as a contiguous range of bytes all having a value of zero). Second, the secondary storage computing device maintains a separate index that stores an indication of whether blocks of data in container files are referred to by links in metadata files. In some examples, this can be analogized to using another, non-native file system that keeps track of blocks of data in the container files, on top of the existing, native file systems of the storage devices.
When a block of data is not referred to and does not need to be stored, the secondary storage computing device can prune it. To prune data, the secondary storage computing device accesses the separate index to determine the blocks of data that are not referred to by links. On operating systems that support sparse files, the secondary storage computing device can free up space in the container files corresponding to those blocks of data by marking the portions of the physical media corresponding to the unreferenced portions of the container file as available for storage (e.g., by zeroing out the corresponding bytes in the container files). On operating systems that do not support sparse files, the secondary storage computing device can free up space in the container files by truncating the extreme portions of the container files (e.g., the extremities such as the beginnings and/or the ends of the container files), thereby making the corresponding portions of the physical media available to store other data. Freeing up space in container files allows the operating system to utilize the freed-up space in other fashions (e.g., other programs may utilize the freed-up space).
Various examples of the invention will now be described. The following description provides specific details for a thorough understanding and enabling description of these examples. One skilled in the relevant art will understand, however, that the invention may be practiced without many of these details. Likewise, one skilled in the relevant art will also understand that the invention may include many other obvious features not described in detail herein. Additionally, some well-known structures or functions may not be shown or described in detail below, so as to avoid unnecessarily obscuring the relevant description.
The terminology used below is to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific examples of the invention. Indeed, certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this Detailed Description section.
While aspects of the invention, such as certain functions, are described as being performed exclusively on a single device, the invention can also be practiced in distributed environments where functions or modules are shared among disparate processing devices, which are linked through a communications network, such as a Local Area Network (LAN), Wide Area Network (WAN), and/or the Internet. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
Aspects of the invention may be stored or distributed on computer-readable media, including tangible computer-readable storage media such as magnetically or optically readable computer discs, hard-wired or preprogrammed chips (e.g., EEPROM semiconductor chips), nanotechnology memory, biological memory, or other data storage media. Alternatively, computer implemented instructions, data structures, screen displays, and other data under aspects of the invention may be distributed over the Internet or over other networks (including wireless networks), on a propagated signal on a propagation medium (e.g., an electromagnetic wave(s), a sound wave, etc.) over a period of time, or they may be provided on any analog or digital network (packet switched, circuit switched, or other scheme).
Aspects of the invention will now be described in detail with respect to
Suitable Data Storage System
The system 150 may generally include combinations of hardware and software components associated with performing storage operations on electronic data. Storage operations include copying, backing up, creating, storing, retrieving, and/or migrating primary storage data (e.g., data stores 160 and/or 162) and secondary storage data (which may include, for example, snapshot copies, backup copies, hierarchical storage management (HSM) copies, archive copies, and other types of copies of electronic data stored on storage devices 115). The system 150 may provide one or more integrated management consoles for users or system processes to interface with in order to perform certain storage operations on electronic data as further described herein. Such integrated management consoles may be displayed at a central control facility or several similar consoles distributed throughout multiple network locations to provide global or geographically specific network data storage information.
In one example, storage operations may be performed according to various storage preferences, for example, as expressed by a user preference, a storage policy, a schedule policy, and/or a retention policy. A “storage policy” is generally a data structure or other information source that includes a set of preferences and other storage criteria associated with performing a storage operation. The preferences and storage criteria may include, but are not limited to, a storage location, relationships between system components, network pathways to utilize in a storage operation, data characteristics, compression or encryption requirements, preferred system components to utilize in a storage operation, a single instancing or variable instancing policy to apply to the data, and/or other criteria relating to a storage operation. For example, a storage policy may indicate that certain data is to be stored in the storage device 115, retained for a specified period of time before being aged to another tier of secondary storage, copied to the storage device 115 using a specified number of data streams, etc.
A “schedule policy” may specify a frequency with which to perform storage operations and a window of time within which to perform them. For example, a schedule policy may specify that a storage operation is to be performed every Saturday morning from 2:00 a.m. to 4:00 a.m. A “retention policy” may specify how long data is to be retained at specific tiers of storage or what criteria must be met before data may be pruned or moved from one tier of storage to another tier of storage. In some cases, the storage policy includes information generally specified by the schedule policy and/or the retention policy. (Put another way, the storage policy includes the schedule policy and/or the retention policy.) Storage policies, schedule policies and/or retention policies may be stored in a database of the storage manager 105, to archive media as metadata for use in restore operations or other storage operations, or to other locations or components of the system 150.
The system 150 may comprise a storage operation cell that is one of multiple storage operation cells arranged in a hierarchy or other organization. Storage operation cells may be related to backup cells and provide some or all of the functionality of backup cells as described in the assignee's U.S. patent application Ser. No. 09/354,058, now U.S. Pat. No. 7,395,282, which is incorporated herein by reference in its entirety. However, storage operation cells may also perform additional types of storage operations and other types of storage management functions that are not generally offered by backup cells.
Storage operation cells may contain not only physical devices, but also may represent logical concepts, organizations, and hierarchies. For example, a first storage operation cell may be configured to perform a first type of storage operations such as HSM operations, which may include backup or other types of data migration, and may include a variety of physical components including a storage manager 105 (or management agent 131), a secondary storage computing device 165, a client 130, and other components as described herein. A second storage operation cell may contain the same or similar physical components; however, it may be configured to perform a second type of storage operations, such as storage resource management (SRM) operations, and may include monitoring a primary data copy or performing other known SRM operations.
Thus, as can be seen from the above, although the first and second storage operation cells are logically distinct entities configured to perform different management functions (i.e., HSM and SRM, respectively), each storage operation cell may contain the same or similar physical devices. Alternatively, different storage operation cells may contain some of the same physical devices and not others. For example, a storage operation cell configured to perform SRM tasks may contain a secondary storage computing device 165, client 130, or other network device connected to a primary storage volume, while a storage operation cell configured to perform HSM tasks may instead include a secondary storage computing device 165, client 130, or other network device connected to a secondary storage volume and not contain the elements or components associated with and including the primary storage volume. (The term “connected” as used herein does not necessarily require a physical connection; rather, it could refer to two devices that are operably coupled to each other, communicably coupled to each other, in communication with each other, or more generally, refer to the capability of two devices to communicate with each other.) These two storage operation cells, however, may each include a different storage manager 105 that coordinates storage operations via the same secondary storage computing devices 165 and storage devices 115. This “overlapping” configuration allows storage resources to be accessed by more than one storage manager 105, such that multiple paths exist to each storage device 115 facilitating failover, load balancing, and promoting robust data access via alternative routes.
Alternatively or additionally, the same storage manager 105 may control two or more storage operation cells (whether or not each storage operation cell has its own dedicated storage manager 105). Moreover, in certain embodiments, the extent or type of overlap may be user-defined (through a control console) or may be automatically configured to optimize data storage and/or retrieval.
The clients 130 typically include application software for performing various operations. Clients 130 typically also include an operating system on which the application software runs. A file system can be provided to facilitate and control file access by the operating system and application software. File systems can facilitate access to local and remote storage devices for file or data access and storage. Clients 130 can also include local storage such as a media module media drive with fixed or removable media.
In some examples, the clients 130 include storage mechanisms for allowing computer programs or other instructions or data to be loaded into memory for execution. Such storage mechanisms might include, for example, a fixed or removable storage unit and an interface. Examples of such storage units and interfaces can include a program cartridge and cartridge interface, a removable memory (for example, a flash memory or other removable memory module) and memory slot, a PCMCIA slot and card, and other fixed or removable storage units and interfaces that allow software and data to be transferred from the storage unit to memory.
Data agent 195 may be a software module or part of a software module that is generally responsible for performing storage operations on the data of the client 130 stored in data store 160/162 or other memory location. Each client 130 may have at least one data agent 195 and the system 150 can support multiple clients 130. Data agent 195 may be distributed between client 130 and storage manager 105 (and any other intermediate components), or it may be deployed from a remote location or its functions approximated by a remote process that performs some or all of the functions of data agent 195.
As used herein, the term module might describe a given unit of functionality that can be performed in accordance with one or more embodiments of the present invention. As used herein, a module might be implemented utilizing any form of hardware, software, firmware, or a combination thereof. For example, one or more processors, controllers, ASICs, PLAs, logical components, software routines or other mechanisms might be implemented to make up a module. In implementation, the various modules described herein might be implemented as discrete modules or the functions and features described can be shared in part or in total among one or more modules. In other words, as would be apparent to one of ordinary skill in the art after reading this description, the various features and functionality described herein may be implemented in any given application and can be implemented in one or more separate or shared modules in various combinations and permutations. Even though various features or elements of functionality may be individually described or claimed as separate modules, one of ordinary skill in the art will understand that these features and functionality can be shared among one or more common software and hardware elements, and such description shall not require or imply that separate hardware or software components are used to implement such features or functionality.
The overall system 150 may employ multiple data agents 195, each of which may perform storage operations on data associated with a different application. For example, different individual data agents 195 may be designed to handle Microsoft Exchange data, Lotus Notes data, Microsoft Windows file system data, Microsoft Active Directory Objects data, Microsoft SQL Server data, Microsoft Sharepoint Server data, and other types of data known in the art. Other embodiments may employ one or more generic data agents 195 that can handle and process multiple data types rather than using the specialized data agents described above.
If a client 130 has two or more types of data, one data agent 195 may be required for each data type to perform storage operations on the data of the client 130. For example, to back up, migrate, and restore all the data on a Microsoft Exchange server, the client 130 may use one Microsoft Exchange Mailbox data agent 195 to back up the Exchange mailboxes, one Microsoft Exchange Database data agent 195 to back up the Exchange databases, one Microsoft Exchange Public Folder data agent 195 to back up the Exchange Public Folders, and one Microsoft Windows File System data agent 195 to back up the file system of the client 130. These data agents 195 would be treated as four separate data agents 195 by the system even though they reside on the same client 130.
Alternatively, the overall system 150 may use one or more generic data agents 195, each of which may be capable of handling two or more data types. For example, one generic data agent 195 may be used to back up, migrate and restore Microsoft Exchange Mailbox data and Microsoft Exchange Database data while another generic data agent 195 may handle Microsoft Exchange Public Folder data and Microsoft Windows File System data, etc.
Data agents 195 may be responsible for arranging or packing data to be copied or migrated into a certain format such as an archive file. Nonetheless, it will be understood that this represents only one example, and any suitable packing or containerization technique or transfer methodology may be used if desired. Such an archive file may include metadata, a list of files or data objects copied, the file, and data objects themselves. Moreover, any data moved by the data agents may be tracked within the system by updating indexes associated with appropriate storage managers 105 or secondary storage computing devices 165. As used herein, a file or a data object refers to any collection or grouping of bytes of data that can be viewed as one or more logical units.
Generally speaking, storage manager 105 may be a software module or other application that coordinates and controls storage operations performed by the system 150. Storage manager 105 may communicate with some or all elements of the system 150, including clients 130, data agents 195, secondary storage computing devices 165, and storage devices 115, to initiate and manage storage operations (e.g., backups, migrations, data recovery operations, etc.).
Storage manager 105 may include a jobs agent 120 that monitors the status of some or all storage operations previously performed, currently being performed, or scheduled to be performed by the system 150. (One or more storage operations are alternatively referred to herein as a “job” or “jobs.”) Jobs agent 120 may be communicatively coupled to an interface agent 125 (e.g., a software module or application). Interface agent 125 may include information processing and display software, such as a graphical user interface (“GUI”), an application programming interface (“API”), or other interactive interface through which users and system processes can retrieve information about the status of storage operations. For example, in an arrangement of multiple storage operations cell, through interface agent 125, users may optionally issue instructions to various storage operation cells regarding performance of the storage operations as described and contemplated herein. For example, a user may modify a schedule concerning the number of pending snapshot copies or other types of copies scheduled as needed to suit particular needs or requirements. As another example, a user may employ the GUI to view the status of pending storage operations in some or all of the storage operation cells in a given network or to monitor the status of certain components in a particular storage operation cell (e.g., the amount of storage capacity left in a particular storage device 115).
Storage manager 105 may also include a management agent 131 that is typically implemented as a software module or application program. In general, management agent 131 provides an interface that allows various management agents 131 in other storage operation cells to communicate with one another. For example, assume a certain network configuration includes multiple storage operation cells hierarchically arranged or otherwise logically related in a WAN or LAN configuration. With this arrangement, each storage operation cell may be connected to the other through each respective interface agent 125. This allows each storage operation cell to send and receive certain pertinent information from other storage operation cells, including status information, routing information, information regarding capacity and utilization, etc. These communications paths may also be used to convey information and instructions regarding storage operations.
For example, a management agent 131 in a first storage operation cell may communicate with a management agent 131 in a second storage operation cell regarding the status of storage operations in the second storage operation cell. Another illustrative example includes the case where a management agent 131 in a first storage operation cell communicates with a management agent 131 in a second storage operation cell to control storage manager 105 (and other components) of the second storage operation cell via management agent 131 contained in storage manager 105.
Another illustrative example is the case where management agent 131 in a first storage operation cell communicates directly with and controls the components in a second storage operation cell and bypasses the storage manager 105 in the second storage operation cell. If desired, storage operation cells can also be organized hierarchically such that hierarchically superior cells control or pass information to hierarchically subordinate cells or vice versa.
Storage manager 105 may also maintain an index, a database, or other data structure 111. The data stored in database 111 may be used to indicate logical associations between components of the system, user preferences, management tasks, media containerization and data storage information or other useful data. For example, the storage manager 105 may use data from database 111 to track logical associations between secondary storage computing device 165 and storage devices 115 (or movement of data as containerized from primary to secondary storage).
Generally speaking, the secondary storage computing device 165, which may also be referred to as a media agent, may be implemented as a software module that conveys data, as directed by storage manager 105, between a client 130 and one or more storage devices 115 such as a tape library, a magnetic media storage device, an optical media storage device, or any other suitable storage device. In one embodiment, secondary storage computing device 165 may be communicatively coupled to and control a storage device 115. A secondary storage computing device 165 may be considered to be associated with a particular storage device 115 if that secondary storage computing device 165 is capable of routing and storing data to that particular storage device 115.
In operation, a secondary storage computing device 165 associated with a particular storage device 115 may instruct the storage device to use a robotic arm or other retrieval means to load or eject a certain storage media, and to subsequently archive, migrate, or restore data to or from that media. Secondary storage computing device 165 may communicate with a storage device 115 via a suitable communications path such as a SCSI or Fibre Channel communications link. In some embodiments, the storage device 115 may be communicatively coupled to the storage manager 105 via a SAN.
Each secondary storage computing device 165 may maintain an index, a database, or other data structure 161 that may store index data generated during storage operations for secondary storage (SS) as described herein, including creating a metabase (MB). For example, performing storage operations on Microsoft Exchange data may generate index data. Such index data provides a secondary storage computing device 165 or other external device with a fast and efficient mechanism for locating data stored or backed up. Thus, a secondary storage computing device index 161, or a database 111 of a storage manager 105, may store data associating a client 130 with a particular secondary storage computing device 165 or storage device 115, for example, as specified in a storage policy, while a database or other data structure in secondary storage computing device 165 may indicate where specifically the data of the client 130 is stored in storage device 115, what specific files were stored, and other information associated with storage of the data of the client 130. In some embodiments, such index data may be stored along with the data backed up in a storage device 115, with an additional copy of the index data written to index cache in a secondary storage device. Thus the data is readily available for use in storage operations and other activities without having to be first retrieved from the storage device 115.
Generally speaking, information stored in cache is typically recent information that reflects certain particulars about operations that have recently occurred. After a certain period of time, this information is sent to secondary storage and tracked. This information may need to be retrieved and uploaded back into a cache or other memory in a secondary computing device before data can be retrieved from storage device 115. In some embodiments, the cached information may include information regarding format or containerization of archives or other files stored on storage device 115.
One or more of the secondary storage computing devices 165 may also maintain one or more single instance databases 123. More details as to single instancing may be found in one or more of the following commonly-assigned U.S. patent applications:
In some examples, the secondary storage computing devices 165 maintain one or more variable instance databases. Variable instancing generally refers to storing in secondary storage one or more instances, but fewer than the total number of instances, of each data block (or data object) in a set of data (e.g., primary data). More details as to variable instancing may be found in the commonly-assigned U.S. Pat. App. No. 61/164,803 (entitled STORING A VARIABLE NUMBER OF INSTANCES OF DATA OBJECTS).
In some embodiments, certain components may reside and execute on the same computer. For example, in some embodiments, a client 130 such as a data agent 195, or a storage manager 105, coordinates and directs local archiving, migration, and retrieval application functions as further described in the previously-referenced U.S. patent application Ser. No. 09/610,738. This client 130 can function independently or together with other similar clients 130.
As shown in
Moreover, in operation, a storage manager 105 or other management module may keep track of certain information that allows the storage manager 105 to select, designate, or otherwise identify metabases to be searched in response to certain queries as further described herein. Movement of data between primary and secondary storage may also involve movement of associated metadata and other tracking information as further described herein.
In some examples, primary data may be organized into one or more sub-clients. A sub-client is a portion of the data of one or more clients 130, and can contain either all of the data of the clients 130 or a designated subset thereof. As depicted in
Components of a Block-Level Single Instancing System
In addition to the data agent 195, the client 130 includes data 240. The data 240 includes single instanceable data (SI data) 242 and non-single instanceable data (non-SI data) 244. SI data 242 includes data that is eligible for single instancing. Non-SI data 244 includes data that is not eligible for single instancing. Non-SI data 244 may include metadata such as access control lists (ACLs), disk partition information, Master File Table (MFT) or File Allocation Table (FAT) information, and/or other metadata. Non-SI data 244 may also include other data that is determined not to be single instanceable. SI data 242 may include data 240 of the client 130 other than non-SI data 244 (e.g., system files, application files, user files, etc.).
The secondary storage computing device 165 includes a data stream reception component 220 and an identifier comparison component 222. Various functions performed by these components are also described in detail herein. The secondary storage computing device 165 also includes a memory 230, which includes multiple buffers 232. The secondary storage computing device 165 may also include other components, such as a decompression component and/or a decryption component. The single instance database 123 includes data structures 250 that are used to store data, such as metadata about SI data 242. The storage device 115 also includes data structures 260 that are used to store data, such as SI data 242 and non-SI data 244. In some examples, the secondary storage computing device 165 includes the components that the client 130 includes, and performs the functions that the client 130 performs.
Processes for Performing Storage Operations
The process 300 begins at step 305 where the data agent 195 receives an indication to copy data of the client 130. The storage manager 105 may send the indication to the data agent 195 (e.g., according to a storage policy), an administrator may manually start the process 300, and/or the process 300 may be automatically started according to a schedule policy.
At step 310 the data agent 195 accesses the data 240 of the client 130. The data agent 195 (e.g., the data identification component 202) determines which portions of the data 240 are SI data 242 and which portions are non-SI data 244. For example, the data agent 195 may determine that metadata (e.g., MFT, FAT, volume information, transaction logs, etc.) on the file system of the client 130 is non-SI data 244, and that data other than metadata is SI data 242 (e.g., system files, user files, etc.). At step 315 the data agent 195 (e.g., the data stream generation component 214) forms a data stream of multiple pairs of stream header and stream payload from the SI data 242 and the non-SI data 244. (An example data stream is illustrated in
At step 320, the data agent 195 (e.g., the identifier generation component 206) aligns the stream header and stream payload into one or more fixed size blocks of data. (An example data stream with stream header and stream payload aligned into multiple blocks is illustrated in
At step 325 the data agent 195 determines whether a data block is single instanceable. The data agent 195 does so by analyzing the portion of the one or more corresponding stream headers that indicates whether the data block is single instanceable. For example, the stream headers may contain a flag or bit that indicates whether the successive stream payload contain single instanceable data. (For example, see
Examples of identifiers include a hash value, message digest, checksum, digital fingerprint, digital signature or other sequence of bytes that substantially uniquely identifies the data block in the data storage system. For example, identifiers could be generated using Message Digest Algorithm 5 (MD5) or Secure Hash Algorithm SHA 512. In some instances, the phrase “substantially unique” is used to modify the term “identifier” because algorithms used to produce hash values may result in collisions, where two different data objects, when hashed, result in the same hash value. However, depending upon the algorithm or cryptographic hash function used, collisions should be suitably rare and thus the identifier generated for a block should be unique throughout the data storage system. The term “probabilistically unique identifier” may also be used. In this case, the phrase “probabilistically unique” is used to indicate that collisions should be low-probability occurrences, and, therefore, the identifier should be unique throughout the data storage system.
At step 335 the data agent 195 (e.g., the identifier generation component 206) inserts the generated identifier into the data stream. The generated identifier may be comprised in an identifier header and identifier data pair that immediately follows the data block for which it is generated. (See
At step 415 the secondary storage computing device 165 determines whether the data block is single instanceable. The secondary storage computing device 165 may do so, for example, by analyzing the metadata in the stream header that indicates whether the data block is single instanceable (e.g., a flag or bit that indicates whether the data block is single instanceable).
If the data block is single instanceable, the process 400 continues at step 425, where the secondary storage computing device (e.g., the identifier comparison component 222) obtains the identifier corresponding to the data block (e.g., from the identifier data of the data stream) and looks up the identifier. The secondary storage computing device 165 looks up the identifier in the primary table in the single instance database 123. (Example data structures used by the single instance database 123 are illustrated in
At step 430, if the secondary storage computing device 165 finds the identifier of the data block in the primary table, this indicates that an instance of the data block is already stored on the storage device 115, and that the block of data should not be stored. Accordingly, the secondary storage computing device 165 can avoid storing another instance of the data block and can instead store a link (alternatively called a pointer) to the location(s) of the already stored instance. At step 445 the secondary storage computing device 165 adds a link to the location(s) of the already stored instance of the data block to a metadata file. The link refers or points to the already stored instance of the data block. For example, the secondary storage computing device 165 may add as the link to the metadata file the record of the already stored instance of the data block in the primary table. At step 450 the secondary storage computing device 165 adds an entry to the secondary table in the single instance database. The entry includes the location of the link in the metadata file. The secondary storage computing device 165 also increments a reference count corresponding to the data block in the primary table. The reference count indicates the number of links to the already stored instance of the data block. At step 455 the secondary storage computing device 165 discards the stream header and stream payload corresponding to the data block from the buffer 232 of the memory 230. Additionally or alternatively, the secondary storage computing device 165 may indicate that the buffer is available for storing another pair of stream header and stream payload.
If the secondary storage computing device 165 does not find the identifier of the block in the primary table (step 430), this indicates that no instances of the data block are already stored on the storage device 115, and that the block of data should be stored. Accordingly, at step 435 the secondary storage computing device 165 stores the data block in a container file on the storage device 115. (See
If the data block is not single instanceable (step 415), the process 400 continues at step 420, where the secondary storage computing device 165 stores the block in a metadata file. (See
In some examples, the secondary storage computing device 165 may perform additional operations during the process 400, such as decrypting the stream payload (e.g., using a decryption component) and/or decompressing the stream payload (e.g., using a decompression component). The secondary storage computing device 165 may also store in the index 161, for the data blocks, information mapping an archive file and offset to the physical location of the data blocks. An archive file is a logical entity that is created during a storage operation and that corresponds to physical locations of data blocks on the storage device 115. The storage manager 105 may map archive files to physical locations and keep such information in index 111.
In some examples, a variable number of instances of data blocks (e.g., more than one instance and up to N−1 instances, where N is the number of instances of the data block in primary data) is stored on the storage devices 115. In such examples, the secondary storage computing devices 165 may use techniques described in the previously referenced U.S. Pat. App. No. 61/164,803 to ensure that a sufficient number of instances of the blocks of data are stored on the storage devices 115. Storing multiple instances (up to N−1) of N data blocks provides for less risk of data loss than single instance storage techniques, and generally nearly as less risk of data loss as conventional data protection techniques (which store N instances of N data blocks). Storing multiple instances (up to N−1) of N data blocks also provides for more efficient use of available storage space than conventional data protection techniques, and almost as efficient use as single instance storage techniques. Accordingly, the storing of a variable number of instances of data blocks enables an administrator to tailor data protection to strike an appropriate balance between 1) minimizing the risk of data loss, and 2) making efficient use of available data storage space, in accordance with the administrator's requirements.
Suitable Data Structures
Referring to
Referring to
Referring to
The data structures 260 include one or more volume folders 702, one or more chunk folders 704/705 within a volume folder 702, and multiple files within a chunk folder 704. Each chunk folder 704/705 includes a metadata file 706/707, a metadata index file 708/709, one or more container files 710/711/713, and a container index file 712/714. The metadata file 706/707 stores non-SI data blocks as well as links to SI data blocks stored in container files. The metadata index file 708/709 stores an index to the data in the metadata file 706/707. The container files 710/711/713 store SI data blocks. The container index file 712/714 stores an index to the container files 710/711/713. Among other things, the container index file 712/714 stores an indication of whether a corresponding block in a container file 710/711/713 is referred to by a link in a metadata file 706/707. For example, data block B2 in the container file 710 is referred to by a link in the metadata file 707 in the chunk folder 705. Accordingly, the corresponding index entry in the container index file 712 indicates that the data block B2 in the container file 710 is referred to. As another example, data block B1 in the container file 711 is referred to by a link in the metadata file 707, and so the corresponding index entry in the container index file 712 indicates that this data block is referred to.
As an example, the data structures 260 illustrated in
If the operating system of the secondary storage computing device 165 supports sparse files, then when the secondary storage computing device 165 creates container files 710/711/713, it can create them as sparse files. As previously described, a sparse file is type of file that may include empty space (e.g., a sparse file may have real data within it, such as at the beginning of the file and/or at the end of the file, but may also have empty space in it that is not storing actual data, such as a contiguous range of bytes all having a value of zero). Having the container files 710/711/713 be sparse files allows the secondary storage computing device 165 to free up space in the container files 710/711/713 when blocks of data in the container files 710/711/713 no longer need to be stored on the storage devices 115. In some examples, the secondary storage computing device 165 creates a new container file 710/711/713 when a container file 710/711/713 either includes 100 blocks of data or when the size of the container file 710 exceeds 50 Mb. In other examples, the secondary storage computing device 165 creates a new container file 710/711/713 when a container file 710/711/713 satisfies other criteria (e.g., it contains from approximately 100 to approximately 1000 blocks or when its size exceeds approximately 50 Mb to 1 Gb). Those of skill in the art will understand that the secondary storage computing device 165 can create a new container file 710/711/713 when other criteria are met.
In some cases, a file on which a storage operation is performed may comprise a large number of data blocks. For example, a 100 Mb file may be comprised in 400 data blocks of size 256 KB. If such a file is to be stored, its data blocks may span more than one container file, or even more than one chunk folder. As another example, a database file of 20 Gb may comprise over 40,000 data blocks of size 512 KB. If such a database file is to be stored, its data blocks will likely span multiple container files, multiple chunk folders, and potentially multiple volume folders. As described in detail herein, restoring such files may thus requiring accessing multiple container files, chunk folders, and/or volume folders to obtain the requisite data blocks.
One advantage of the data structures 260 illustrated in
Another advantage is that the data storage system enables a reduction in the amount of blocks of data stored on the storage devices 115, while still maintaining at least one instance of each block of primary data. In examples where the data storage system stores a variable number of instances of blocks of primary data, blocks of primary data can be distributed across two or more storage devices 115, thereby adding a further aspect of redundancy.
Another advantage is that the metadata files 706/707, the metadata index files 708/709, the container files 710/711/713, and/or the container index files 712/714 could be used to replicate the data stored in the single instance database 123 or reconstruct the single instance database 123 if the data of the single instance database 123 is ever lost and/or corrupted.
The storage of data blocks in the container files may create additional complexities when it comes time to prune data blocks (pruning data blocks may be alternatively referred to as deleting or removing data blocks) that the data storage system no longer need retain. This is because the data blocks are not stored as files on the file system on the storage device 115 and thus cannot be directly referenced by the file system using the file system's data structures (the data structures that are built into or provided with the file system). As described in detail with reference to
In some examples, the use of the container index files 712/714, the metadata index files 708/709, and/or the primary and secondary tables 600/650 to track data is analogous to a driver, agent or an additional file system that is layered on top of the existing file system of the storage device 115. This driver/agent/additional file system allows the data storage system to efficiently keep track of very large numbers of blocks of data, without regard to any limitations of the file systems of the storage devices 115. Accordingly, the data storage system can store very large numbers of blocks of data.
Accordingly, the data structures 260 illustrated in
Process for Restoring Data
At step 815 the secondary storage computing device 165 determines volume folders and chunk folders corresponding to the archive file and offset. The secondary storage computing device 165 may do so by analyzing the index 161 to determine the volume folders and chunk folders. The determined volume folders and chunk folders contain the requested data. At step 820 the secondary storage computing device 165 accesses an index file within the determined volume folders and chunk folders that corresponds to the data to be restored. This may be the metadata index file 708/709 when the requested data is non-SI data 244 or the container index file 712/714 when the requested data is SI data 242. At step 825 the secondary storage computing device 165 determines, from the index file, the offset within the metadata file 706/707 or the offset within the container file 710/711/13 corresponding to the requested data. At step 830 the secondary storage computing device 165 accesses the metadata file 706/707 or the container file 710/711/13 and seeks to the determined offset. At step 835 the secondary storage computing device 165 retrieves the data from the metadata file 706/707 or the container file 710/711/13. At step 840 the secondary storage computing device restores the data to a selected location (e.g., to a client 130 and/or to another location). The process 800 then concludes.
As previously noted, restoring a file may necessitate accessing multiple container files, chunk folders, and/or volume folders to obtain the data blocks that comprise the file. The secondary storage computing device 165 may thus have to obtain a first data block from a first container file and a second data block from a second container file. As another example, the secondary storage computing device 165 may thus have to obtain a first data block from a first container file within a first folder and a second data block from a second container file within a second folder. To do so, the secondary storage computing device 165 may have to access multiple index files or other data structures to locate the requisite blocks of data. Those of skill in the art will understand that various techniques may be used to restore data such as files and other data.
Process for Pruning Data
As previously noted, the data structures 260 illustrated in
At step 907 the secondary storage computing device 165 determines the file, e.g., archive file, and the volume folders 702 and chunk folder 704 corresponding to the job to be pruned. The secondary storage computing device 165 may do so, for example, by analyzing the index 111 and/or the index 161 to determine this information. At step 910 the secondary storage computing device 165 deletes the metadata file 706 and the metadata index file 708 in the chunk folder 704. The secondary storage computing device 165 can delete the metadata file 706 and the metadata index file 708 in this example because these files include non-SI data 244, which is not referenced by any other data.
At step 915 the secondary storage computing device 165 accesses the container file 710 and the container index file 712 in the chunk folder 704. The secondary storage computing device 165 begins iterating through the data blocks in the container files 710. At step 920, beginning with a first block in the container file 710, the secondary storage computing device 165 accesses the primary table 600 in the single instance database 123. The secondary storage computing device 165 determines from the primary table 600 whether the reference count of a data block in the container file 710 is equal to zero. If so, this indicates that there are no references to the data block. The process 900 then continues at step 925, where the secondary storage computing device 165 sets the entry in the container index file 712 corresponding to the data block equal to zero, thus indicating that there are no references to the data block, and therefore prunable.
If the reference count of a data block is not equal to zero, then the data block is not prunable, and the process 900 continues at step 930. At this step, the secondary storage computing device 165 determines whether there are more data blocks in the container file 710. If so, the process 900 returns to step 920, where it accesses the next data block. If there are no more data blocks in the container file 710, the process 900 continues at step 932, where the secondary storage computing device 165 determines whether all the entries in the container index file 712 corresponding to the container file 710 are equal to zero. As illustrated in
However, if the container file 710 did not contain any referenced data blocks, then at step 933, the secondary storage computing device 165 would delete the container file 710. The process would then continue at step 935, where the secondary storage computing device 165 determines whether there are more container files. According to the example as illustrated in
After processing container files 710/711, the process 900 continues at step 940, where the secondary storage computing device 165 determines whether to free up storage space in the container files 710/711. The secondary storage computing device 165 may do so using various techniques. For example, if the operating system of the secondary storage computing device 165 supports sparse files, then the secondary storage computing device 165 may free up space by zeroing out the bytes in the container files corresponding to the space to be freed up. For a certain number of contiguous blocks (e.g., a threshold number of contiguous blocks, such as three contiguous blocks) for which the corresponding entries in the container index file 712 indicate that the blocks are not being referred to, then the secondary storage computing device 165 may mark these portions of the container files 710/711 as available for storage by the operating system or the file system. The secondary storage computing device 165 may do so by calling an API of the operating system to mark the unreferenced portions of the container files 710/711 as available for storage.
The secondary storage computing device 165 may use certain optimizations to manage the number of times portions of the container file are specified or marked as available for storage, such as only zeroing out bytes in container files when a threshold number of unreferenced contiguous blocks is reached (e.g., three or more unreferenced contiguous blocks). These optimizations may result in less overhead for the operating system because it reduces the number of contiguous ranges of zero-value bytes in the container files 710/711 that the operating system must keep track of (e.g., it reduces the amount of metadata about portions of the container files 710/711 that are available for storage).
If the operating system of the secondary storage computing device 165 does not support sparse files, then the secondary storage computing device 165 may free up space by truncating either the beginning or the end of the container files 710/711 (removing or deleting data at the beginning or end of the container files 710/711). The secondary storage computing device 165 may do so by calling an API of the operating system, or by operating directly on the container files 710/711. For example, if a certain number of the last blocks of the container file are not being referred to, the secondary storage computing device 165 may truncate these portions of the container files 710/711. Other techniques may be used to free up space in the container files 710/711 for storage of other data. At step 945 the secondary storage computing device 165 frees up space in the container files 710/711. The process 900 then concludes.
As a result of the process 900, the chunk folder 704 would contain only the container files 710/711 and the container index file 712. At a later time, when the chunk folder 705 is pruned (that is, when the job that created this chunk folder is selected to be pruned), then the container files 710/711 in the chunk folder 704 can be deleted, because they no longer contain data blocks that is referenced by other data. Therefore, pruning data corresponding to a job may also result in pruning data corresponding to an earlier job, because the data corresponding to the earlier job is no longer referenced by the later job.
Although the process 900 is described with reference to the pruning of data corresponding to jobs (one or more storage operations), other data can also be pruned. For example, an administrator may wish to delete SI data 242 but retain non-SI data 244. In such case, the administrator may instruct the secondary storage computing device 165 to delete the container files 710/711/713 but retain the metadata files 706/707 and metadata index files 708/709. As another example, an administrator or storage policy may delete one or more specific files. In such case, the secondary storage computing device 165 deletes the data blocks in the container files 710/711/713 corresponding to the specific files but retains other data blocks. The process 900 may include fewer or more steps than those described herein to accommodate these other pruning examples. Those of skill in the art will understand that data can be pruned in various fashions and therefore, that the process 900 is not limited to the steps described herein.
One advantage of the process 900 and the techniques described herein is that they enable the deletion of data on the storage devices 115 that no longer needs to be stored while still retaining data that needs to be stored, and doing so in a space-efficient manner. Space previously allocated for data blocks that no longer need to be stored can be reclaimed by the data storage system, and used to store other data. Accordingly, the techniques described herein provide for efficient use of available storage space (available on physical media).
From the foregoing, it will be appreciated that specific examples of data storage systems have been described herein for purposes of illustration, but that various modifications may be made without deviating from the spirit and scope of the invention. For example, although copy operations may have been described, the system may be used to perform many types of storage operations (e.g., backup operations, restore operations, archival operations, copy operations, Continuous Data Replication (CDR) operations, recovery operations, migration operations, HSM operations, etc.). As another example, although block-level single instancing has been described, the systems and methods detailed herein may be used to single instance files. As another example, the secondary storage computing device 165 may keep track of which blocks of data in container files 710 are not referenced, instead of keeping track of which blocks of data are referred to by links. As another example, non-SI data 244 may not be aligned into blocks of data. Accordingly, the invention is not limited except as by the appended claims.
Terms and phrases used in this document, and variations thereof, unless otherwise expressly stated, should be construed as open ended as opposed to limiting. As examples of the foregoing: the term “including” should be read as meaning “including, without limitation” or the like; the term “example” is used to provide exemplary instances of the item in discussion, not an exhaustive or limiting list thereof; the terms “a” or “an” should be read as meaning “at least one,” “one or more” or the like; and adjectives such as “conventional,” “traditional,” “normal,” “standard,” “known” and terms of similar meaning should not be construed as limiting the item described to a given time period or to an item available as of a given time, but instead should be read to encompass conventional, traditional, normal, or standard technologies that may be available or known now or at any time in the future. Likewise, where this document refers to technologies that would be apparent or known to one of ordinary skill in the art, such technologies encompass those apparent or known to the skilled artisan now or at any time in the future.
The presence of broadening words and phrases such as “one or more,” “at least,” “but not limited to” or other like phrases in some instances shall not be read to mean that the narrower case is intended or required in instances where such broadening phrases may be absent. The use of the term “module” does not imply that the components or functionality described or claimed as part of the module are all configured in a common package. Indeed, any or all of the various components of a module, whether control logic or other components, can be combined in a single package or separately maintained and can further be distributed in multiple groupings or packages or across multiple locations.
If a synchronization process or synchronization processes are described herein, it is not intended to require that multiple synchronizations occur simultaneously or that multiple computing systems being synchronized each receive the same data. Although in some examples the data can be broadcast to all participating computing systems simultaneously (or close to simultaneously), in other examples the data can be sent to different computing systems or groups of computing systems at different times. Likewise, in some examples the same data, or the same subset of the data can be sent to all computing systems. However, in other examples, subsets of the data can be tailored for a given computing system or group of computing systems.
Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” The word “coupled,” as generally used herein, refers to two or more elements that may be either directly connected, or connected by way of one or more intermediate elements. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description using the singular or plural number may also include the plural or singular number respectively. The word “or” in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
The above detailed description of embodiments of the invention is not intended to be exhaustive or to limit the invention to the precise form disclosed above. While specific embodiments of, and examples for, the invention are described above for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. For example, while processes or blocks are presented in a given order, alternative embodiments may perform routines having steps, or employ systems having blocks, in a different order, and some processes or blocks may be deleted, moved, added, subdivided, combined, and/or modified. Each of these processes or blocks may be implemented in a variety of different ways. Also, while processes or blocks are at times shown as being performed in series, these processes or blocks may instead be performed in parallel, or may be performed at different times.
The teachings of the invention provided herein can be applied to other systems, not necessarily the system described above. The elements and acts of the various embodiments described above can be combined to provide further embodiments.
Any patents and applications and other references noted above, including any that may be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the invention can be modified, if necessary, to employ the systems, functions, and concepts of the various references described above to provide yet further implementations of the invention.
These and other changes can be made to the invention in light of the above Detailed Description. While the above description details certain embodiments of the invention and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Details of the system may vary considerably in implementation details, while still being encompassed by the invention disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the invention should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the invention with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the invention under the claims.
While certain aspects of the invention are presented below in certain claim forms, the inventors contemplate the various aspects of the invention in any number of claim forms. For example, while only one aspect of the invention is recited as embodied in a computer-readable medium, other aspects may likewise be embodied in a computer-readable medium. As another example, while only one aspect of the invention is recited as a means-plus-function claim under 35 U.S.C. § 112, sixth paragraph, other aspects may likewise be embodied as a means-plus-function claim, or in other forms, such as being embodied in a computer-readable medium. (Any claims intended to be treated under 35 U.S.C. § 112, ¶6 will begin with the words “means for.”) Accordingly, the inventors reserve the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the invention.
This application is a continuation of U.S. patent application Ser. No. 17/169,257, filed on Feb. 5, 2021 (entitled BLOCK-LEVEL SINGLE INSTANCING), which is a continuation of U.S. patent application Ser. No. 16/228,726, filed on Dec. 20, 2018 (entitled BLOCK-LEVEL SINGLE INSTANCING), which is a continuation of U.S. patent application Ser. No. 14/668,450 filed on Mar. 25, 2015, which is a divisional of U.S. patent application Ser. No. 14/049,463 filed on Oct. 9, 2013 (entitled BLOCK-LEVEL SINGLE INSTANCING), which is a continuation of U.S. patent application Ser. No. 12/647,906 filed on Dec. 28, 2009 (entitled BLOCK-LEVEL SINGLE INSTANCING), now U.S. Pat. No. 8,578,120, which claims the benefit of U.S. Patent Application No. 61/180,791 filed on May 22, 2009 (entitled BLOCK-LEVEL SINGLE INSTANCING), and is related to U.S. patent application Ser. No. 12/565,576 filed on Sep. 23, 2009 (entitled SYSTEMS AND METHODS FOR MANAGING SINGLE INSTANCING DATA), each of which is incorporated by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4686620 | Ng | Aug 1987 | A |
| 4713755 | Worley, Jr. et al. | Dec 1987 | A |
| 4995035 | Cole et al. | Feb 1991 | A |
| 5005122 | Griffin et al. | Apr 1991 | A |
| 5093912 | Dong et al. | Mar 1992 | A |
| 5133065 | Cheffetz et al. | Jul 1992 | A |
| 5193154 | Kitajima et al. | Mar 1993 | A |
| 5212772 | Masters | May 1993 | A |
| 5226157 | Nakano et al. | Jul 1993 | A |
| 5239647 | Anglin et al. | Aug 1993 | A |
| 5241668 | Eastridge et al. | Aug 1993 | A |
| 5241670 | Eastridge et al. | Aug 1993 | A |
| 5276860 | Fortier et al. | Jan 1994 | A |
| 5276867 | Kenley et al. | Jan 1994 | A |
| 5287500 | Stoppani, Jr. | Feb 1994 | A |
| 5321816 | Rogan et al. | Jun 1994 | A |
| 5333315 | Saether et al. | Jul 1994 | A |
| 5347653 | Flynn et al. | Sep 1994 | A |
| 5410700 | Fecteau et al. | Apr 1995 | A |
| 5437012 | Mahajan | Jul 1995 | A |
| 5448724 | Hayashi et al. | Sep 1995 | A |
| 5491810 | Allen | Feb 1996 | A |
| 5495607 | Pisello et al. | Feb 1996 | A |
| 5504873 | Martin et al. | Apr 1996 | A |
| 5544345 | Carpenter et al. | Aug 1996 | A |
| 5544347 | Yanai et al. | Aug 1996 | A |
| 5559957 | Balk | Sep 1996 | A |
| 5604862 | Midgely et al. | Feb 1997 | A |
| 5606686 | Tarui et al. | Feb 1997 | A |
| 5619644 | Crockett et al. | Apr 1997 | A |
| 5628004 | Gormley et al. | May 1997 | A |
| 5634052 | Morris | May 1997 | A |
| 5638509 | Dunphy et al. | Jun 1997 | A |
| 5673381 | Huai et al. | Sep 1997 | A |
| 5699361 | Ding et al. | Dec 1997 | A |
| 5729743 | Squibb | Mar 1998 | A |
| 5742792 | Yanai | Apr 1998 | A |
| 5751997 | Kullick et al. | May 1998 | A |
| 5758359 | Saxon | May 1998 | A |
| 5761677 | Senator et al. | Jun 1998 | A |
| 5764972 | Crouse et al. | Jun 1998 | A |
| 5778395 | Whiting et al. | Jul 1998 | A |
| 5794229 | French et al. | Aug 1998 | A |
| 5806057 | Gormley et al. | Sep 1998 | A |
| 5812398 | Nielsen | Sep 1998 | A |
| 5813008 | Benson | Sep 1998 | A |
| 5813009 | Johnson et al. | Sep 1998 | A |
| 5813017 | Morris | Sep 1998 | A |
| 5822780 | Schutzman | Oct 1998 | A |
| 5862325 | Reed et al. | Jan 1999 | A |
| 5875478 | Blumenau | Feb 1999 | A |
| 5887134 | Ebrahim | Mar 1999 | A |
| 5901327 | Ofek | May 1999 | A |
| 5924102 | Perks | Jul 1999 | A |
| 5940833 | Benson | Aug 1999 | A |
| 5950205 | Aviani, Jr. | Sep 1999 | A |
| 5974563 | Beeler, Jr. | Oct 1999 | A |
| 5990810 | Williams | Nov 1999 | A |
| 6021415 | Cannon et al. | Feb 2000 | A |
| 6026414 | Anglin | Feb 2000 | A |
| 6052735 | Ulrich et al. | Apr 2000 | A |
| 6073133 | Chrabaszcz | Jun 2000 | A |
| 6076148 | Kedem et al. | Jun 2000 | A |
| 6094416 | Ying | Jul 2000 | A |
| 6125369 | Wu | Sep 2000 | A |
| 6131095 | Low et al. | Oct 2000 | A |
| 6131190 | Sidwell | Oct 2000 | A |
| 6148412 | Cannon et al. | Nov 2000 | A |
| 6154787 | Urevig et al. | Nov 2000 | A |
| 6161111 | Mutalik et al. | Dec 2000 | A |
| 6167402 | Yeager | Dec 2000 | A |
| 6173291 | Jenevein | Jan 2001 | B1 |
| 6212512 | Barney et al. | Apr 2001 | B1 |
| 6260069 | Anglin | Jul 2001 | B1 |
| 6269431 | Dunham | Jul 2001 | B1 |
| 6275953 | Vahalia et al. | Aug 2001 | B1 |
| 6301592 | Aoyama et al. | Oct 2001 | B1 |
| 6311252 | Raz | Oct 2001 | B1 |
| 6324544 | Alam | Nov 2001 | B1 |
| 6324581 | Xu et al. | Nov 2001 | B1 |
| 6328766 | Long | Dec 2001 | B1 |
| 6330570 | Crighton et al. | Dec 2001 | B1 |
| 6330642 | Carteau | Dec 2001 | B1 |
| 6343324 | Hubis et al. | Jan 2002 | B1 |
| RE37601 | Eastridge et al. | Mar 2002 | E |
| 6356801 | Goodman et al. | Mar 2002 | B1 |
| 6356915 | Chtchetkine | Mar 2002 | B1 |
| 6363400 | Chtchetkine | Mar 2002 | B1 |
| 6389432 | Pothapragada et al. | May 2002 | B1 |
| 6418478 | Ignatius | Jul 2002 | B1 |
| 6421711 | Blumenau et al. | Jul 2002 | B1 |
| 6477544 | Bolosky et al. | Nov 2002 | B1 |
| 6487561 | Ofek et al. | Nov 2002 | B1 |
| 6513051 | Bolosky | Jan 2003 | B1 |
| 6519679 | Devireddy et al. | Feb 2003 | B2 |
| 6538669 | Lagueux, Jr. et al. | Mar 2003 | B1 |
| 6564228 | O'Connor | May 2003 | B1 |
| 6609157 | Deo | Aug 2003 | B2 |
| 6609183 | Ohran | Aug 2003 | B2 |
| 6609187 | Merrell | Aug 2003 | B1 |
| 6658526 | Nguyen et al. | Dec 2003 | B2 |
| 6675177 | Webb | Jan 2004 | B1 |
| 6704730 | Moulton | Mar 2004 | B2 |
| 6708195 | Borman | Mar 2004 | B1 |
| 6745304 | Playe | Jun 2004 | B2 |
| 6757699 | Lowry | Jun 2004 | B2 |
| 6757794 | Cabrera | Jun 2004 | B2 |
| 6795903 | Schultz | Sep 2004 | B2 |
| 6810398 | Moulton | Oct 2004 | B2 |
| 6839819 | Martin | Jan 2005 | B2 |
| 6862674 | Dice | Mar 2005 | B2 |
| 6865655 | Andersen | Mar 2005 | B1 |
| 6868417 | Kazar et al. | Mar 2005 | B2 |
| 6889297 | Krapp et al. | May 2005 | B2 |
| 6901493 | Maffezzoni | May 2005 | B1 |
| 6912645 | Dorward | Jun 2005 | B2 |
| 6928459 | Sawdon et al. | Aug 2005 | B1 |
| 6952758 | Chron | Oct 2005 | B2 |
| 6959368 | St. Pierre | Oct 2005 | B1 |
| 6973553 | Archibald et al. | Dec 2005 | B1 |
| 6976039 | Chefalas | Dec 2005 | B2 |
| 6993162 | Stephany et al. | Jan 2006 | B2 |
| 7017113 | Bourbakis | Mar 2006 | B2 |
| 7035876 | Kawai et al. | Apr 2006 | B2 |
| 7035880 | Crescenti | Apr 2006 | B1 |
| 7035943 | Yamane | Apr 2006 | B2 |
| 7085904 | Mizuno | Aug 2006 | B2 |
| 7089383 | Ji | Aug 2006 | B2 |
| 7089395 | Jacobson | Aug 2006 | B2 |
| 7092956 | Ruediger | Aug 2006 | B2 |
| 7103740 | Colgrove et al. | Sep 2006 | B1 |
| 7107418 | Ohran | Sep 2006 | B2 |
| 7111173 | Scheldt | Sep 2006 | B1 |
| 7117246 | Christenson | Oct 2006 | B2 |
| 7139808 | Anderson et al. | Nov 2006 | B2 |
| 7143091 | Charnock | Nov 2006 | B2 |
| 7143108 | George | Nov 2006 | B1 |
| 7191290 | Ackaouy | Mar 2007 | B1 |
| 7200604 | Forman | Apr 2007 | B2 |
| 7200621 | Beck et al. | Apr 2007 | B2 |
| 7246272 | Cabezas | Jul 2007 | B2 |
| 7272606 | Borthakur | Sep 2007 | B2 |
| 7287252 | Bussiere | Oct 2007 | B2 |
| 7290102 | Lubbers et al. | Oct 2007 | B2 |
| 7310655 | Dussud | Dec 2007 | B2 |
| 7320059 | Armangau | Jan 2008 | B1 |
| 7325110 | Kubo | Jan 2008 | B2 |
| 7330997 | Odom | Feb 2008 | B1 |
| 7343459 | Prahlad | Mar 2008 | B2 |
| 7370003 | Pych | May 2008 | B2 |
| 7376805 | Stroberger et al. | May 2008 | B2 |
| 7383304 | Shimada et al. | Jun 2008 | B2 |
| 7383462 | Osaki | Jun 2008 | B2 |
| 7389345 | Adams | Jun 2008 | B1 |
| 7395282 | Crescenti | Jul 2008 | B1 |
| 7403942 | Bayliss | Jul 2008 | B1 |
| 7409522 | Fair et al. | Aug 2008 | B1 |
| 7444382 | Malik | Oct 2008 | B2 |
| 7444387 | Douceur | Oct 2008 | B2 |
| 7451166 | Damani et al. | Nov 2008 | B2 |
| 7478096 | Margolus et al. | Jan 2009 | B2 |
| 7478113 | De Spiegeleer | Jan 2009 | B1 |
| 7480782 | Garthwaite | Jan 2009 | B2 |
| 7487245 | Douceur | Feb 2009 | B2 |
| 7490207 | Amarendran | Feb 2009 | B2 |
| 7493314 | Huang | Feb 2009 | B2 |
| 7493456 | Brittain et al. | Feb 2009 | B2 |
| 7496604 | Sutton | Feb 2009 | B2 |
| 7512745 | Gschwind et al. | Mar 2009 | B2 |
| 7516208 | Kerrison | Apr 2009 | B1 |
| 7519635 | Haustein et al. | Apr 2009 | B1 |
| 7519726 | Pallyill | Apr 2009 | B2 |
| 7533331 | Brown et al. | May 2009 | B2 |
| 7536440 | Budd et al. | May 2009 | B2 |
| 7568080 | Prahlad | Jul 2009 | B2 |
| 7577687 | Bank et al. | Aug 2009 | B2 |
| 7590639 | Ivanova | Sep 2009 | B1 |
| 7603529 | MacHardy et al. | Oct 2009 | B1 |
| 7613748 | Brockway | Nov 2009 | B2 |
| 7617297 | Bruce | Nov 2009 | B2 |
| 7631120 | Darcy | Dec 2009 | B2 |
| 7631194 | Wahlert | Dec 2009 | B2 |
| 7636824 | Tormasov | Dec 2009 | B1 |
| 7647462 | Wolfgang | Jan 2010 | B2 |
| 7657550 | Prahlad | Feb 2010 | B2 |
| 7661028 | Erofeev | Feb 2010 | B2 |
| 7668884 | Prahlad | Feb 2010 | B2 |
| 7672779 | Fuchs | Mar 2010 | B2 |
| 7672981 | Faibish et al. | Mar 2010 | B1 |
| 7673089 | Hinchey | Mar 2010 | B2 |
| 7676590 | Silverman | Mar 2010 | B2 |
| 7685126 | Patel | Mar 2010 | B2 |
| 7685177 | Hagerstrom | Mar 2010 | B1 |
| 7685384 | Shavit | Mar 2010 | B2 |
| 7685459 | De Spiegeleer | Mar 2010 | B1 |
| 7698699 | Rogers et al. | Apr 2010 | B2 |
| 7716445 | Bonwick | May 2010 | B2 |
| 7721292 | Frasier et al. | May 2010 | B2 |
| 7734581 | Gu et al. | Jun 2010 | B2 |
| 7747579 | Prahlad | Jun 2010 | B2 |
| 7747584 | Jernigan, IV | Jun 2010 | B1 |
| 7747659 | Bacon et al. | Jun 2010 | B2 |
| 7778979 | Hatonen et al. | Aug 2010 | B2 |
| 7786881 | Burchard et al. | Aug 2010 | B2 |
| 7788230 | Dile | Aug 2010 | B2 |
| 7814142 | Mamou | Oct 2010 | B2 |
| 7818287 | Torii | Oct 2010 | B2 |
| 7818495 | Tanaka et al. | Oct 2010 | B2 |
| 7818531 | Barrall | Oct 2010 | B2 |
| 7830889 | Lemaire | Nov 2010 | B1 |
| 7831707 | Bardsley | Nov 2010 | B2 |
| 7831793 | Chakravarty et al. | Nov 2010 | B2 |
| 7831795 | Prahlad | Nov 2010 | B2 |
| 7836161 | Scheid | Nov 2010 | B2 |
| 7840537 | Gokhale | Nov 2010 | B2 |
| 7853750 | Stager et al. | Dec 2010 | B2 |
| 7856414 | Zee | Dec 2010 | B2 |
| 7865470 | Fries | Jan 2011 | B2 |
| 7865678 | Arakawa | Jan 2011 | B2 |
| 7870105 | Arakawa | Jan 2011 | B2 |
| 7870486 | Wang | Jan 2011 | B2 |
| 7873599 | Ishii | Jan 2011 | B2 |
| 7873806 | Prahlad | Jan 2011 | B2 |
| 7882077 | Gokhale | Feb 2011 | B2 |
| 7899990 | Moll et al. | Mar 2011 | B2 |
| 7921077 | Ting et al. | Apr 2011 | B2 |
| 7937371 | Bates et al. | May 2011 | B2 |
| 7953706 | Prahlad | May 2011 | B2 |
| 7962452 | Anglin | Jun 2011 | B2 |
| 8028106 | Bondurant et al. | Sep 2011 | B2 |
| 8037028 | Prahlad | Oct 2011 | B2 |
| 8041907 | Wu et al. | Oct 2011 | B1 |
| 8051367 | Arai et al. | Nov 2011 | B2 |
| 8054765 | Passey et al. | Nov 2011 | B2 |
| 8055618 | Anglin | Nov 2011 | B2 |
| 8055627 | Prahlad et al. | Nov 2011 | B2 |
| 8055745 | Atluri | Nov 2011 | B2 |
| 8078603 | Chandratillake | Dec 2011 | B1 |
| 8086799 | Mondal et al. | Dec 2011 | B2 |
| 8095756 | Somavarapu | Jan 2012 | B1 |
| 8108429 | Sim-Tang | Jan 2012 | B2 |
| 8112357 | Mueller | Feb 2012 | B2 |
| 8131687 | Bates et al. | Mar 2012 | B2 |
| 8140786 | Bunte | Mar 2012 | B2 |
| 8156092 | Hewett | Apr 2012 | B2 |
| 8156279 | Tanaka et al. | Apr 2012 | B2 |
| 8161003 | Kavuri | Apr 2012 | B2 |
| 8161255 | Anglin et al. | Apr 2012 | B2 |
| 8165221 | Zheng | Apr 2012 | B2 |
| 8166263 | Prahlad | Apr 2012 | B2 |
| 8170994 | Tsaur | May 2012 | B2 |
| 8190823 | Waltermann et al. | May 2012 | B2 |
| 8190835 | Yueh | May 2012 | B1 |
| 8213540 | Rickey | Jul 2012 | B1 |
| 8219524 | Gokhale | Jul 2012 | B2 |
| 8234444 | Bates et al. | Jul 2012 | B2 |
| 8239348 | Bezbaruah | Aug 2012 | B1 |
| 8244914 | Nagarkar | Aug 2012 | B1 |
| 8271992 | Chatley | Sep 2012 | B2 |
| 8285683 | Gokhale | Oct 2012 | B2 |
| 8290915 | Anglin | Oct 2012 | B2 |
| 8295875 | Masuda | Oct 2012 | B2 |
| 8296260 | Ting et al. | Oct 2012 | B2 |
| 8315984 | Frandzel | Nov 2012 | B2 |
| 8346730 | Srinivasan | Jan 2013 | B2 |
| 8364652 | Vijayan | Jan 2013 | B2 |
| 8375008 | Gomes | Feb 2013 | B1 |
| 8380957 | Prahlad | Feb 2013 | B2 |
| 8386436 | Ben-Dyke | Feb 2013 | B2 |
| 8392677 | Bunte et al. | Mar 2013 | B2 |
| 8401996 | Muller | Mar 2013 | B2 |
| 8412677 | Klose | Apr 2013 | B2 |
| 8412682 | Zheng et al. | Apr 2013 | B2 |
| 8484162 | Prahlad | Jul 2013 | B2 |
| 8495032 | Anglin et al. | Jul 2013 | B2 |
| 8548953 | Wong | Oct 2013 | B2 |
| 8572340 | Vijayan | Oct 2013 | B2 |
| 8577851 | Vijayan | Nov 2013 | B2 |
| 8578109 | Vijayan | Nov 2013 | B2 |
| 8578120 | Attarde et al. | Nov 2013 | B2 |
| 8620845 | Stoakes et al. | Dec 2013 | B2 |
| 8626723 | Ben-Shaul et al. | Jan 2014 | B2 |
| 8712969 | Prahlad | Apr 2014 | B2 |
| 8712974 | Datuashvili et al. | Apr 2014 | B2 |
| 8725687 | Klose | May 2014 | B2 |
| 8732403 | Nayak | May 2014 | B1 |
| 8769185 | Chung | Jul 2014 | B2 |
| 8782368 | Lillibridge et al. | Jul 2014 | B2 |
| 8788466 | Anglin et al. | Jul 2014 | B2 |
| 8880797 | Yueh | Nov 2014 | B2 |
| 8909881 | Bunte et al. | Dec 2014 | B2 |
| 8930306 | Ngo | Jan 2015 | B1 |
| 8935492 | Gokhale | Jan 2015 | B2 |
| 8954446 | Vijayan | Feb 2015 | B2 |
| 8965852 | Jayaraman | Feb 2015 | B2 |
| 8997020 | Chambers et al. | Mar 2015 | B2 |
| 9015181 | Kottomtharayil et al. | Apr 2015 | B2 |
| 9020890 | Kottomtharayil et al. | Apr 2015 | B2 |
| 9020900 | Vijayan | Apr 2015 | B2 |
| 9116850 | Vijayan | Apr 2015 | B2 |
| 9058117 | Attarde et al. | Jun 2015 | B2 |
| 9104623 | Vijayan | Aug 2015 | B2 |
| 9213540 | Rickey et al. | Dec 2015 | B1 |
| 9218374 | Muller | Dec 2015 | B2 |
| 9218375 | Muller | Dec 2015 | B2 |
| 9218376 | Muller | Dec 2015 | B2 |
| 9236079 | Prahlad et al. | Jan 2016 | B2 |
| 9251186 | Muller | Feb 2016 | B2 |
| 9262275 | Gokhale et al. | Feb 2016 | B2 |
| 9276871 | Freitas | Mar 2016 | B1 |
| 9372479 | Phillips | Jun 2016 | B1 |
| 9575673 | Mitkar | Feb 2017 | B2 |
| 9633022 | Vijayan et al. | Apr 2017 | B2 |
| 9633033 | Vijayan | Apr 2017 | B2 |
| 9633056 | Attarde | Apr 2017 | B2 |
| 9639563 | Gokhale | May 2017 | B2 |
| 9646166 | Cash | May 2017 | B2 |
| 9665591 | Vijayan | May 2017 | B2 |
| 9715434 | Xu | Jul 2017 | B1 |
| 9773025 | Muller et al. | Sep 2017 | B2 |
| 9781000 | Kumar | Oct 2017 | B1 |
| 10089337 | Senthilnathan et al. | Oct 2018 | B2 |
| 10108543 | Duggal | Oct 2018 | B1 |
| 10108544 | Duggal | Oct 2018 | B1 |
| 10262003 | Kottomtharayil et al. | Apr 2019 | B2 |
| 10324897 | Amarendran et al. | Jun 2019 | B2 |
| 10324914 | Senthilnathan et al. | Jun 2019 | B2 |
| 10339106 | Vijayan | Jul 2019 | B2 |
| 10795812 | Duggal | Oct 2020 | B1 |
| 10956274 | Attarde et al. | Mar 2021 | B2 |
| 20010037323 | Moulton et al. | Nov 2001 | A1 |
| 20020055972 | Weinman | May 2002 | A1 |
| 20020059317 | Black et al. | May 2002 | A1 |
| 20020065892 | Malik | May 2002 | A1 |
| 20020099806 | Balsamo | Jul 2002 | A1 |
| 20020107877 | Whiting | Aug 2002 | A1 |
| 20020169934 | Krapp et al. | Nov 2002 | A1 |
| 20030004922 | Schmidt et al. | Jan 2003 | A1 |
| 20030033308 | Patel et al. | Feb 2003 | A1 |
| 20030074600 | Tamatsu | Apr 2003 | A1 |
| 20030097359 | Ruediger | May 2003 | A1 |
| 20030110190 | Achiwa | Jun 2003 | A1 |
| 20030135480 | Van Arsdale | Jul 2003 | A1 |
| 20030167318 | Robbin | Sep 2003 | A1 |
| 20030172368 | Alumbaugh et al. | Sep 2003 | A1 |
| 20030177149 | Coombs | Sep 2003 | A1 |
| 20030236763 | Kilduff | Dec 2003 | A1 |
| 20040093259 | Pych | May 2004 | A1 |
| 20040128287 | Keller | Jul 2004 | A1 |
| 20040148306 | Moulton | Jul 2004 | A1 |
| 20040177319 | Horn | Sep 2004 | A1 |
| 20040187075 | Maxham et al. | Sep 2004 | A1 |
| 20040220975 | Carpentier | Nov 2004 | A1 |
| 20040230817 | Ma | Nov 2004 | A1 |
| 20040250033 | Prahlad et al. | Dec 2004 | A1 |
| 20050033756 | Kottomtharayil | Feb 2005 | A1 |
| 20050055359 | Kawai et al. | Mar 2005 | A1 |
| 20050060643 | Glass et al. | Mar 2005 | A1 |
| 20050066190 | Martin | Mar 2005 | A1 |
| 20050097150 | McKeon et al. | May 2005 | A1 |
| 20050108435 | Nowacki et al. | May 2005 | A1 |
| 20050131961 | Margolus | Jun 2005 | A1 |
| 20050138081 | Alshab et al. | Jun 2005 | A1 |
| 20050138483 | Hatonen et al. | Jun 2005 | A1 |
| 20050149589 | Bacon et al. | Jul 2005 | A1 |
| 20050160243 | Lubbers et al. | Jul 2005 | A1 |
| 20050177603 | Shavit | Aug 2005 | A1 |
| 20050182780 | Forman et al. | Aug 2005 | A1 |
| 20050195660 | Kavuri | Sep 2005 | A1 |
| 20050203864 | Schmidt | Sep 2005 | A1 |
| 20050203887 | Joshi | Sep 2005 | A1 |
| 20050210460 | Rogers | Sep 2005 | A1 |
| 20050223109 | Mamou et al. | Oct 2005 | A1 |
| 20050234823 | Schimpf | Oct 2005 | A1 |
| 20050246389 | Shah et al. | Nov 2005 | A1 |
| 20050254072 | Hirai | Nov 2005 | A1 |
| 20050262110 | Gu et al. | Nov 2005 | A1 |
| 20050262193 | Mamou et al. | Nov 2005 | A1 |
| 20050283461 | Sell | Dec 2005 | A1 |
| 20050286466 | Tagg et al. | Dec 2005 | A1 |
| 20060005048 | Osaki et al. | Jan 2006 | A1 |
| 20060053305 | Wahlert et al. | Jan 2006 | A1 |
| 20060010227 | Atluri | Mar 2006 | A1 |
| 20060047894 | Okumura | Mar 2006 | A1 |
| 20060047978 | Kawakami | Mar 2006 | A1 |
| 20060047998 | Darcy | Mar 2006 | A1 |
| 20060056623 | Gligor | Mar 2006 | A1 |
| 20060069702 | Moeller et al. | Mar 2006 | A1 |
| 20060089954 | Anschutz | Apr 2006 | A1 |
| 20060095470 | Cochran | May 2006 | A1 |
| 20060123313 | Brown et al. | Jun 2006 | A1 |
| 20060126615 | Angtin | Jun 2006 | A1 |
| 20060129576 | Carpentier | Jun 2006 | A1 |
| 20060129771 | Dasgupta | Jun 2006 | A1 |
| 20060129875 | Barrail | Jun 2006 | A1 |
| 20060174112 | Wray | Aug 2006 | A1 |
| 20060206547 | Kulkarni | Sep 2006 | A1 |
| 20060206621 | Toebes | Sep 2006 | A1 |
| 20060222163 | Bank et al. | Oct 2006 | A1 |
| 20060224846 | Amarendran | Oct 2006 | A1 |
| 20060230081 | Craswell | Oct 2006 | A1 |
| 20060230244 | Amarendran et al. | Oct 2006 | A1 |
| 20060259587 | Ackerman | Nov 2006 | A1 |
| 20060271622 | Scheid | Nov 2006 | A1 |
| 20070022145 | Kavuri | Jan 2007 | A1 |
| 20070067399 | Kulkarni | Mar 2007 | A1 |
| 20070079170 | Zimmer | Apr 2007 | A1 |
| 20070106863 | Bonwick | May 2007 | A1 |
| 20070118573 | Gadiraju et al. | May 2007 | A1 |
| 20070118705 | Arakawa et al. | May 2007 | A1 |
| 20070136200 | Frank | Jun 2007 | A1 |
| 20070156998 | Gorobets | Jul 2007 | A1 |
| 20070179995 | Prahlad | Aug 2007 | A1 |
| 20070198613 | Prahlad et al. | Aug 2007 | A1 |
| 20070203937 | Prahlad et al. | Aug 2007 | A1 |
| 20070255758 | Zheng et al. | Nov 2007 | A1 |
| 20070255909 | Gschwind et al. | Nov 2007 | A1 |
| 20070260476 | Smolen | Nov 2007 | A1 |
| 20070271316 | Hollebeek | Nov 2007 | A1 |
| 20070288534 | Zak | Dec 2007 | A1 |
| 20080005141 | Zheng et al. | Jan 2008 | A1 |
| 20080005201 | Ting et al. | Jan 2008 | A1 |
| 20080028007 | Ishii et al. | Jan 2008 | A1 |
| 20080034045 | Bardsley | Feb 2008 | A1 |
| 20080047935 | Hinchey | Feb 2008 | A1 |
| 20080082714 | Hinchey | Apr 2008 | A1 |
| 20080082736 | Chow et al. | Apr 2008 | A1 |
| 20080091881 | Brittain et al. | Apr 2008 | A1 |
| 20080098083 | Shergill | Apr 2008 | A1 |
| 20080098236 | Pandey et al. | Apr 2008 | A1 |
| 20080104291 | Hinchey | May 2008 | A1 |
| 20080115176 | Rodriguez | May 2008 | A1 |
| 20080125170 | Masuda | May 2008 | A1 |
| 20080126543 | Hamada | May 2008 | A1 |
| 20080144079 | Pandey | Jun 2008 | A1 |
| 20080162320 | Mueller et al. | Jul 2008 | A1 |
| 20080162467 | Fuchs | Jul 2008 | A1 |
| 20080162518 | Bollinger | Jul 2008 | A1 |
| 20080162597 | Tysowski | Jul 2008 | A1 |
| 20080184001 | Stager | Jul 2008 | A1 |
| 20080229037 | Bunte | Sep 2008 | A1 |
| 20080243769 | Arbour | Oct 2008 | A1 |
| 20080243879 | Gokhale et al. | Oct 2008 | A1 |
| 20080243914 | Prahlad | Oct 2008 | A1 |
| 20080243957 | Prahlad et al. | Oct 2008 | A1 |
| 20080243958 | Prahlad et al. | Oct 2008 | A1 |
| 20080244172 | Kano | Oct 2008 | A1 |
| 20080244204 | Cremelie et al. | Oct 2008 | A1 |
| 20080307000 | Paterson | Dec 2008 | A1 |
| 20090012984 | Ravid et al. | Jan 2009 | A1 |
| 20090049260 | Upadhyayula | Feb 2009 | A1 |
| 20090063528 | Yueh | Mar 2009 | A1 |
| 20090083341 | Parees | Mar 2009 | A1 |
| 20090083344 | Inoue et al. | Mar 2009 | A1 |
| 20090089483 | Tanaka et al. | Apr 2009 | A1 |
| 20090106369 | Chen et al. | Apr 2009 | A1 |
| 20090106480 | Chung | Apr 2009 | A1 |
| 20090109891 | Fonseca, Jr. et al. | Apr 2009 | A1 |
| 20090112870 | Ozzie | Apr 2009 | A1 |
| 20090119678 | Shih | May 2009 | A1 |
| 20090132619 | Arakawa et al. | May 2009 | A1 |
| 20090132764 | Moll et al. | May 2009 | A1 |
| 20090144285 | Chatley et al. | Jun 2009 | A1 |
| 20090150498 | Branda et al. | Jun 2009 | A1 |
| 20090171888 | Anglin | Jul 2009 | A1 |
| 20090177719 | Kavuri | Jul 2009 | A1 |
| 20090179754 | Burchard et al. | Jul 2009 | A1 |
| 20090192978 | Hewett et al. | Jul 2009 | A1 |
| 20090204636 | Li et al. | Aug 2009 | A1 |
| 20090204649 | Wona et al. | Aug 2009 | A1 |
| 20090204650 | Wong | Aug 2009 | A1 |
| 20090228446 | Anzai | Sep 2009 | A1 |
| 20090234870 | Bates et al. | Sep 2009 | A1 |
| 20090268903 | Bojinov et al. | Oct 2009 | A1 |
| 20090271402 | Srinivasan et al. | Oct 2009 | A1 |
| 20090271454 | Anglin et al. | Oct 2009 | A1 |
| 20090281847 | Hamilton, II | Nov 2009 | A1 |
| 20090319534 | Gokhale | Dec 2009 | A1 |
| 20090319585 | Gokhale | Dec 2009 | A1 |
| 20090327625 | Jaquette | Dec 2009 | A1 |
| 20100005259 | Prahlad et al. | Jan 2010 | A1 |
| 20100036887 | Anglin et al. | Feb 2010 | A1 |
| 20100070478 | Anglin | Mar 2010 | A1 |
| 20100077013 | Clements | Mar 2010 | A1 |
| 20100082529 | Mace et al. | Apr 2010 | A1 |
| 20100082558 | Anglin et al. | Apr 2010 | A1 |
| 20100082672 | Kottomtharayil | Apr 2010 | A1 |
| 20100088296 | Periyagaram | Apr 2010 | A1 |
| 20100094817 | Ben-Shaul et al. | Apr 2010 | A1 |
| 20100121825 | Bates et al. | May 2010 | A1 |
| 20100125553 | Huang | May 2010 | A1 |
| 20100138500 | Consul | Jun 2010 | A1 |
| 20100161554 | Datuashvili et al. | Jun 2010 | A1 |
| 20100169287 | Klose | Jul 2010 | A1 |
| 20100174881 | Anglin | Jul 2010 | A1 |
| 20100223441 | Lillibridge et al. | Sep 2010 | A1 |
| 20100250549 | Muller et al. | Sep 2010 | A1 |
| 20100281081 | Stager | Nov 2010 | A1 |
| 20100332401 | Prahlad | Dec 2010 | A1 |
| 20100333116 | Prahlad | Dec 2010 | A1 |
| 20110035357 | Ting et al. | Feb 2011 | A1 |
| 20110125711 | Meisenheimer | May 2011 | A1 |
| 20110125720 | Javaraman | May 2011 | A1 |
| 20120084524 | Gokhale et al. | Apr 2012 | A1 |
| 20120102286 | Holt | Apr 2012 | A1 |
| 20120150818 | Vijayan | Jun 2012 | A1 |
| 20120159098 | Cheung | Jun 2012 | A1 |
| 20120179656 | Bunte et al. | Jul 2012 | A1 |
| 20120209809 | Prahlad et al. | Aug 2012 | A1 |
| 20120233417 | Kalach | Sep 2012 | A1 |
| 20120271793 | Gokhale | Oct 2012 | A1 |
| 20120303595 | Liu et al. | Nov 2012 | A1 |
| 20120311581 | Balmin | Dec 2012 | A1 |
| 20130006946 | Prahlad et al. | Jan 2013 | A1 |
| 20130013573 | Anglin | Jan 2013 | A1 |
| 20130041872 | Aizman | Feb 2013 | A1 |
| 20130086007 | Bandopadhyay | Apr 2013 | A1 |
| 20130117305 | Varakin | May 2013 | A1 |
| 20130179405 | Bunte et al. | Jul 2013 | A1 |
| 20130218350 | Phillips | Aug 2013 | A1 |
| 20130218842 | Muller et al. | Aug 2013 | A1 |
| 20130262386 | Kottomtharayil et al. | Oct 2013 | A1 |
| 20130262801 | Sancheti | Oct 2013 | A1 |
| 20130290598 | Fiske | Oct 2013 | A1 |
| 20130339298 | Muller | Dec 2013 | A1 |
| 20130339310 | Muller | Dec 2013 | A1 |
| 20140006382 | Barber | Jan 2014 | A1 |
| 20140012814 | Bercovici et al. | Jan 2014 | A1 |
| 20140129961 | Zubarev | May 2014 | A1 |
| 20140181079 | Ghazal | Jun 2014 | A1 |
| 20140188532 | Liu | Jul 2014 | A1 |
| 20140250088 | Klose et al. | Sep 2014 | A1 |
| 20140310232 | Plattner | Oct 2014 | A1 |
| 20150178277 | Singhal | Jun 2015 | A1 |
| 20150199242 | Attarde et al. | Jul 2015 | A1 |
| 20150205678 | Kottomtharayil et al. | Jul 2015 | A1 |
| 20150205816 | Periyagaram | Jul 2015 | A1 |
| 20150205817 | Kottomtharayil et al. | Jul 2015 | A1 |
| 20150212889 | Amarendran et al. | Jul 2015 | A1 |
| 20150261776 | Attarde | Sep 2015 | A1 |
| 20160124658 | Prahlad | May 2016 | A1 |
| 20160179435 | Haley | Jun 2016 | A1 |
| 20160210064 | Dornemann | Jul 2016 | A1 |
| 20160342633 | Senthilnathan | Nov 2016 | A1 |
| 20160342655 | Senthilnathan | Nov 2016 | A1 |
| 20160342661 | Kumarasamy | Nov 2016 | A1 |
| 20160350324 | Wang | Dec 2016 | A1 |
| 20160350391 | Vijayan | Dec 2016 | A1 |
| 20170038978 | Li | Feb 2017 | A1 |
| 20170083408 | Vijayan et al. | Mar 2017 | A1 |
| 20170193003 | Vijayan | Jul 2017 | A1 |
| 20170206206 | Gokhale | Jul 2017 | A1 |
| 20180144000 | Muller | May 2018 | A1 |
| 20180239772 | Vijayan et al. | Aug 2018 | A1 |
| 20180314727 | Epstein | Nov 2018 | A1 |
| 20180364914 | Prahlad | Dec 2018 | A1 |
| 20190042609 | Senthilnathan | Feb 2019 | A1 |
| 20190188188 | Kottomtharayil et al. | Jun 2019 | A1 |
| 20190192978 | Eatedali et al. | Jun 2019 | A1 |
| 20190266139 | Kumarasamy et al. | Aug 2019 | A1 |
| 20190278748 | Amarendran et al. | Sep 2019 | A1 |
| 20200167240 | Haridas et al. | May 2020 | A1 |
| 20200310686 | Truong | Oct 2020 | A1 |
| 20200327017 | Vijayan et al. | Oct 2020 | A1 |
| 20200358621 | Ngo | Nov 2020 | A1 |
| 20210263803 | Attarde et al. | Aug 2021 | A1 |
| 20210374021 | Santhakumar | Dec 2021 | A1 |
| Number | Date | Country |
|---|---|---|
| 0259912 | Mar 1988 | EP |
| 0405926 | Jan 1991 | EP |
| 0467546 | Jan 1992 | EP |
| 0774715 | May 1997 | EP |
| 0809184 | Nov 1997 | EP |
| 0899662 | Mar 1999 | EP |
| 0981090 | Feb 2000 | EP |
| WO 9513580 | May 1995 | WO |
| WO 9912098 | Mar 1999 | WO |
| WO 03027891 | Apr 2003 | WO |
| WO 2006052872 | May 2006 | WO |
| WO 2008070688 | Jun 2008 | WO |
| WO 2008080140 | Jul 2008 | WO |
| Entry |
|---|
| Anonymous, “NTFS Sparse Files (NTFS5 Only)”, Jun. 4, 2002, pp. 1-1, https://web.archive.org/web/20020604013016/http://ntfs.com/ntfs-sparse.htm. |
| Armstead et al., “Implementation of a Campwide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, Sep. 11-14, 1995, pp. 190-199. |
| Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31, 1988-Nov. 3, 1988, pp. 45-50, Monterey, CA. |
| Cabrera et al., “ADSM: A Multi-Platform, Scalable, Backup 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. |
| Commvault Systems, Inc., “Continuous Data Replicator 7.0,” Product Data Sheet, 2007, 6 pages. |
| CommVault Systems, Inc., “Deduplication—How To,”<http://documentation.commvault.com/commvault/release_8_0_0/books_online_1/englis h_US/features/single_instance/single_instance_how_to.htm>, earliest known publication date: Jan. 26, 2009, 7 pages. |
| CommVault Systems, Inc., “Deduplication,” <http://documentation.commvault.com/commvault/release_8_0_0/books_online_1/english_US/features/single_instance/single_instance.htm>, earliest known publication date: Jan. 26, 2009, 9 pages. |
| Computer Hope, “File”, May 13, 2008, pp. 1-1, https://web.archive.org/web/20080513021935/https://www.computerhope.com/. |
| Computer Hope, “File,” May 21, 2008, pp. 1-3, https://web.archive.org/web/20080513021935/https://www.computerhope.com/jargon/f/file.htm. |
| Diligent Technologies “HyperFactor,” <http://www.diligent.com/products:protecTIER-1 :HyperFactor-1>, Internet accessed on Dec. 5, 2008, 2 pages. |
| Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, Jun. 12-16, 1994, pp. 124-126. |
| Enterprise Storage Management, “What Is Hierarchical Storage Management?”, Jun. 19, 2005, pp. 1, http://web.archive.org/web/20050619000521/hhttp://www.enterprisestoragemanagement.com/faq/hierarchical-storage-management-shtml. |
| Enterprise Storage Management, What Is A Incremental Backup?, Oct. 26, 2005, pp. 1-2, http://web.archive.org/web/w0051026010908/http://www.enterprisestoragemanagement.com/faq/incremental-backup.shtml. |
| Federal Information Processing Standards Publication 180-2, “Secure Hash Standard”, Aug. 1, 2002, <http://csrc.nist.gov/publications/fips/fips1 80-2/fips 1 80-2withchangenotice. pdf>, 83 pages. |
| Flexhex, “NTFS Sparse Files for Programmers”, Feb. 22, 2006, pp. 1-4, https://web.archive.org/web/20060222050807/http://www.flexhex.com/docs/articles/sparse-files.phtml. |
| Gait, J., “The Optical File Cabinet: A Random-Access File System For Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (Jun. 1988). |
| Geer, D., “Reducing The Storage Burden Via Data Deduplication,” IEEE, Computer Journal, vol. 41, Issue 12, Dec. 2008, pp. 15-17. |
| Handy, Jim, “The Cache Memory Book: The Authoritative Reference on Cache Design,” Second Edition, 1998, pp. 64-67 and pp. 204-205. |
| Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72. |
| Kornblum, Jesse, “Identifying Almost Identical Files Using Context Triggered Piecewise Hashing,” www.sciencedirect.com, Digital Investigation 3S (2006), pp. S91-S97. |
| Kulkarni P. et al., “Redundancy elimination within large collections of files,” Proceedings of the Usenix Annual Technical Conference, Jul. 2, 2004, pp. 59-72. |
| Lortu Software Development, “Kondar Technology-Deduplication,” <http://www.lortu.com/en/deduplication.asp>, Internet accessed on Dec. 5, 2008, 3 pages. |
| Menezes et al., “Handbook Of Applied Cryptography”, CRC Press, 1996, <http://www.cacr.math.uwaterloo.ca/hac/aboutlchap9.pdf>, 64 pages. |
| Microsoft, “Computer Dictionary”, p. 249, Fifth Edition, 2002, 3 pages. |
| Microsoft, “Computer Dictionary”, pp. 142, 150, 192, and 538, Fifth Edition, 2002, 6 pages. |
| Microsoft, “Computer Dictionary,” Fifth Edition, 2002, p. 220. |
| Overland Storage, “Data Deduplication,” <http://www.overlandstorage.com/topics/data_deduplication.html>, Internet accessed on Dec. 5, 2008, 2 pages. |
| Quantum Corporation, “Data De-Duplication Background: A Technical White Paper,” May 2008, 13 pages. |
| Rosenblum et al., “The Design and Implementation of a Log-Structured File System,” Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991). |
| Searchstorage, “File System”, Nov. 1998, <http://searchstorage.techtarget.com/definition/file-system>, 10 pages. |
| Sharif, A., “Cache Memory,” Sep. 2005, http://searchstorage.techtarget.com/definition/cache-memory, pp. 1-26. |
| Techterms.com, “File,” May 17, 2008, 1 page, <https://web.archive.org/web/20080517102848/https://techterms.com/definition/file>. |
| Webopedia, “Cache,” Apr. 11, 2001, http://web.archive.org/web/20010411033304/http://www.webopedia.com/TERM/c/cache.html pp. 1-4. |
| Webopedia, “Data Duplication”, Aug. 31, 2006, <http://web.archive.org/web/20060913030559/http://www.webopedia.com/TERMID/data_deduplication.html>, 2 pages. |
| Webopedia, “File,” May 21, 2008, pp. 1-3, <https://web.archive.org/web/20080521094529/https://www.webopedia.com/TERM/F/file.html>. |
| Webopedia, “Folder”, Aug. 9, 2002, <https://web.archive.org/web/20020809211001/http://www.webopedia.com/TERM/F/folder.html> pp. 1-2. |
| Webopedia, “Logical Drive”, Aug. 13, 2004, pp. 1-2, https://web.archive.org/web/20040813033834/http://www.webopedia.com/TERM/L/logical_drive.html. |
| Webopedia, “LPAR”, Aug. 8, 2002, pp. 1-2, https://web.archive.org/web/20020808140639/http://www.webopedia.com/TERM/L/LPAR.html. |
| Webopedia, “Metadata”, Apr. 5, 2001, <https://web.archive.org/web/20010405235507/http://www.webopedia.com/TERM/M/metadata.html>, pp. 1-2. |
| Webopedia, “header”, Jul. 21, 2005, pp. 1-2, https://web.archive.org/web/20080503033941/https://www.webopedia.com/TERM/H/header.html (Year: 2005). |
| Techterms.com, “File”, May 17, 2008, pp. 1-1, https://web.archive.org/web/20080517102848/https://techterms.com/definition/ file (Year: 2008). |
| Extended European Search Report for EP07865192.4; dated May 2, 2013, 7 pages. |
| International Preliminary Report on Patentability and Written Opinion for PCT/US2007/086421, dated Jun. 18, 2009, 8 pages. |
| International Preliminary Report on Patentability and Written Opinion for PCT/US2011/054378, dated Apr. 11, 2013, 5 pages. |
| International Search Report and Written Opinion for PCT/US07/86421, dated Apr. 18, 2008, 9 pages. |
| International Search Report for Application No. PCT/US09/58137, dated Dec. 23, 2009, 14 pages. |
| International Search Report for Application No. PCT/US10/34676, dated Nov. 29, 2010, 9 pages. |
| International Search Report for Application No. PCT/US11/54378, dated May 2, 2012, 8 pages. |
| Australian Examination Report dated Feb. 14, 2012 for Australian Application No. 2009296695 in 3 pages. |
| Australian Examination Report dated Jun. 7, 2013 for Australian Application No. 2009296695 in 3 pages. |
| Australian Examination Report dated Sep. 12, 2013 for Australian Application No. 2009296695 in 6 pages. |
| Australian Examination Report dated Oct. 2, 2014 for Australian Application No. 2013206404 in 2 pages. |
| Canadian Examination Report dated Nov. 7, 2014 for Canadian Application No. 2729078 in 5 pages. |
| European Examination Report dated Jan. 13, 2020 for European Application No. 09816825.5 in 7 pages. |
| Partial Supplementary European Search Report dated Apr. 15, 2015 for European Application No. 09816825.5 in 6 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20220382643 A1 | Dec 2022 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61180791 | May 2009 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14049463 | Oct 2013 | US |
| Child | 14668450 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17169257 | Feb 2021 | US |
| Child | 17884482 | US | |
| Parent | 16228726 | Dec 2018 | US |
| Child | 17169257 | US | |
| Parent | 14668450 | Mar 2015 | US |
| Child | 16228726 | US | |
| Parent | 12647906 | Dec 2009 | US |
| Child | 14049463 | US |
