A computer readable medium includes executable instructions for resilvering a hierarchical block tree in a storage pool. Resilvering the hierarchical block tree involves traversing a branch of the hierarchical block tree only if a birth time of a parent block of the branch is greater than or equal to a lowest birth time on a dirty time log (DTL). Resilvering the hierarchical block tree further involves resilvering a child block in the branch only if the DTL comprises a birth time of the child block.
|
1. A computer readable medium comprising executable instructions for resilvering a hierarchical block tree in a storage pool by:
selectively traversing a branch of the hierarchical block tree when a birth time of a parent block of the branch is greater than or equal to a lowest birth time on a dirty time log (DTL), wherein the DTL is configured to:
track when one or more i/O requests are not successfully completed, and
store birth times for the one or more i/O requests that are not successfully completed, wherein the stored birth times are equivalent to birth times that would have been associated with a successful write to disk; and
resilvering a child block of a plurality of child blocks in the branch when the DTL comprises a birth time of the child block, wherein a birth time of each child block of the plurality of child blocks is less than or equal to the birth time of the parent block,
wherein the parent block comprises the birth time of the child block, and
wherein the DTL is updated only once when more than one i/O request for the child block and the parent block fail at a same birth time.
13. A computer system comprising:
a processor;
a memory;
a hierarchical block tree in a storage pool, comprising:
a parent block of a branch of the hierarchical block tree; and
a child block of a plurality of child blocks in the branch, wherein a birth time of each child block of the plurality of child blocks is less than or equal to a birth time of the parent block;
a dirty time log (DTL) configured to:
track when one or more i/O requests are not successfully completed, and
store birth times for the one or more i/O requests that are not successfully completed, wherein the stored birth times are equivalent to birth times that would have been associated with a successful write to disk; and
a file system, wherein at least a portion of the file system is resident in the memory and operating under control of the processor, configured to:
selectively traverse the branch when the birth time of the parent block is greater than or equal to a lowest birth time on the DTL; and
resilver the child block when the DTL comprises a birth time of the child block,
wherein the parent block comprises the birth time of the child block, and
wherein the DTL is updated only once when more than one i/O request for the child block and the parent block fail at a same birth time.
7. A method for resilvering a hierarchical block tree in a storage pool, the method comprising:
obtaining, using a processor, a birth time of each child block of a plurality of child blocks referenced by a parent block in the hierarchical block tree, wherein the birth time of each child block of the plurality of child blocks is less than or equal to a birth time of the parent block; and
for each child block:
a) resilvering, using the processor, the child block when a dirty time log (DTL) comprises the birth time of the child block, wherein the DTL is configured to:
track when one or more i/O requests are not successfully completed, and
store birth times for the one or more i/O requests that are not successfully completed, wherein the birth times are equivalent to birth times that would have been associated with a successful write to disk; and
b) when the birth time of the child block is greater than or equal to a lowest birth time on the DTL:
selectively traversing, using the processor, the hierarchical block tree to obtain a birth time of each grandchild block referenced by the child block, when the child block is an indirect block; and
repeating a) and b) for each grandchild block, if the child block is an indirect block,
wherein the parent block comprises the birth time of the child block, and
wherein the DTL is updated only once when more than one i/O request for the child block and the parent block fail at a same birth time.
2. The computer readable medium of
3. The computer readable medium of
4. The computer readable medium of
5. The computer readable medium of
6. The computer readable medium of
resilvering the parent block only if the DTL comprises the birth time of the parent block.
8. The method of
10. The method of
11. The method of
12. The method of
14. The computer system of
15. The computer system of
16. The computer system of
17. The computer system of
|
|||||||||||||||||||||||||||
This application claims benefit of U.S. Provisional Application Ser. No. 60/734,023 filed on Nov. 4, 2005, entitled “DIRTY TIME LOGGING AND RESILVERING” in the names of William H. Moore and Jeffrey S. Bonwick.
This application is related to U.S. Pat. No. 7,925,827, filed on Apr. 19, 2006 and entitled “Method and System for Dirty Time Logging,” U.S. Pat. No. 7,930,495, filed on Apr. 19, 2006 and entitled “Method and System for Dirty Time Log Directed Resilvering,” and copending U.S. patent application Ser. No. 11/407,719, filed on Apr. 19, 2006 and entitled “Method and System for Metadata-Based Resilvering,” the entire contents of which are incorporated herein by reference. All the above referenced applications are co-owned by the same assignee.
The present application contains subject matter that may be related to the subject matter in the following U.S. Patents, which are all assigned to a common assignee: “Method and Apparatus for Self-Validating Checksums in a File System” (U.S. Pat. No. 7,603,568) filed on Apr. 24, 2004; “Method and Apparatus for Dynamic Striping” (U.S. Pat. No. 7,424,574) filed on Apr. 21, 2004; “Method and Apparatus for Vectored Block-Level Checksum for File System Data Integrity” (U.S. Pat. No. 7,415,653) filed on Apr. 21, 2004; “Method and Apparatus for Identifying Tampering of Data in a File System” (U.S. Pat. No. 7,412,450) filed on May 26, 2004; “Method and System for Detecting and Correcting Data Errors Using Checksums and Replication” (U.S. Pat. No. 7,526,622) filed on May 26, 2004; “Method and System for Detecting and Correcting Data Errors Using Data Permutations” (U.S. Pat. No. 7,281,188) filed on May 26, 2004; “Method and Apparatus for Compressing Data in a File System” (U.S. Pat. No. 7,496,586) filed on May 26, 2004; “Gang Blocks” (U.S. Pat. No. 7,437,528) filed on Aug. 17, 2004; “Method and Apparatus for Enabling Adaptive Endianness” (U.S. Pat. No. 7,533,225) filed on Aug. 17, 2004; and “Automatic Conversion of All-Zero Data Storage Blocks into File Holes” (U.S. Pat. No. 7,225,314) filed on May 26, 2004.
Typical computer systems include a file system for storing and accessing files. In addition to storing system files (operating system files, device driver files, etc.), the file system provides storage and access of user data files. If any of these files (system files and/or user files) contain critical data, then it becomes advantageous to employ a data backup scheme to ensure that critical data are not lost if a file storage device fails. One data backup scheme that is commonly employed is mirroring. Mirroring involves maintaining two or more copies of a file, where each copy of the file is located on a separate file storage device (e.g., a local hard disk, a networked hard disk, a network file server, etc.).
When one or more file storage devices fails for any length of time, the file storage device(s) may become unsynchronized. However, when employing a mirroring scheme, it is of critical importance to ensure that the mirrors are synchronized (i.e., that the contents of each mirror are the same). If a mirror becomes unsynchronized, the simplest recovery scheme involves copying all of the data from a synchronized mirror to the unsynchronized mirror. However, copying all data from one file storage device to another file storage device may take a long time and reduce performance of the file storage devices significantly during the resynchronization process.
Alternatively, dirty region logging (DRL) may be used to facilitate resynchronization. DRL involves dividing each mirror into a number of “regions.” Depending on the implementation, the region may be as small as a single disk sector or larger than 256 kilobytes (KB). Prior to modifying the content of a region—for example, when there is a write operation on data within the region—a DRL entry for the region is created in the DRL. In most cases, the DRL entry merely identifies the region where the modification will be attempted. If the region is modified successfully, then the DRL entry is cleared. If the region is not modified successfully, then the DRL entry remains in the DRL. Thus, during a resynchronization process, the DRL may be used to identify which specific regions require resynchronization, rather than resynchronizing the entire file storage device.
Dirty region logging may be more time-efficient then resynchronizing an entire file storage device. However, it also includes system overhead with each modification to a region, since the DRL must be updated prior to each modification to the region. Clearly, this overhead increases with smaller region sizes. Conversely, if the regions are large, there may be significant overhead involved in resynchronizing an entire region, even though only a single disk sector in that region may have been modified.
In general, in one aspect, the invention relates to a computer readable medium comprising executable instructions for resilvering a hierarchical block tree in a storage pool by traversing a branch of the hierarchical block tree only if a birth time of a parent block of the branch is greater than or equal to a lowest birth time on a dirty time log (DTL), and resilvering a child block in the branch only if the DTL comprises a birth time of the child block.
In general, in one aspect, the invention relates to a computer readable medium comprising executable instructions for resilvering a hierarchical block tree in a storage pool by obtaining a birth time of each child block referenced by a parent block in the hierarchical block tree, and for each child block a) resilvering the child block if a dirty time log (DTL) comprises the birth time of the child block, and b) if the birth time of the child block is greater than or equal to a lowest birth time on the DTL, obtaining a birth time of each grandchild block referenced by the child block, if the child block is an indirect block, and repeating a) and b) for each grandchild block, if the child block is an indirect block.
In general, in one aspect, the invention relates to a system. The system comprises a hierarchical block tree in a storage pool, comprising a parent block of a branch of the hierarchical block tree, and a child block in the branch. The system further comprises a dirty time log (DTL), and a file system configured to traverse the branch only if a birth time of the parent block is greater than or equal to a lowest birth time on the DTL, and resilver the child block only if the DTL comprises a birth time of the child block.
Other aspects of the invention will be apparent from the following description and the appended claims.
Specific embodiments of the invention will now be described in detail with reference to the accompanying figures. Like elements in the various figures are denoted by like reference numerals for consistency.
In the following detailed description of embodiments of the invention, numerous specific details are set forth in order to provide a more thorough understanding of the invention. However, it will be apparent to one of ordinary skill in the art that the invention may be practiced without these specific details. In other instances, well-known features have not been described in detail to avoid unnecessarily complicating the description.
In general, embodiments of the invention provide a method and system to resilver a hierarchical block tree in a storage system. Specifically, embodiments of the invention relate to resilvering a hierarchical block tree by only traversing those branches of the tree that could potentially include blocks requiring resilvering (i.e., blocks having a birth time listed in a dirty time log).
The operating system (103) typically interfaces with the file system (100) via a system call interface (102). The operating system (103) provides operations (101) for users to access files within the file system (100). These operations (101) may include read, write, open, close, etc. In one embodiment of the invention, the file system (100) is an object-based file system (i.e., both data and metadata are stored as objects). More specifically, the file system (100) includes functionality to store both data and corresponding metadata in the storage pool (108). Thus, the aforementioned operations (101) provided by the operating system (103) correspond to operations on objects.
More specifically, in one embodiment of the invention, a request to perform a particular operation (101) (i.e., a transaction) is forwarded from the operating system (103), via the system call interface (102), to the DMU (104). In one embodiment of the invention, the DMU (104) translates the request to perform an operation on an object directly to a request to perform a read or write operation at a physical location within the storage pool (108). More specifically, the DMU (104) represents the objects as data blocks and indirect blocks as described in
In one embodiment of the invention, the storage pool (108) includes one or more physical disks (disks (110A, 110N)). Further, in one embodiment of the invention, the storage capacity of the storage pool (108) may increase and decrease dynamically as physical disks are added and removed from the storage pool (108). In one embodiment of the invention, the storage space available in the storage pool (108) is managed by the SPA (106).
As shown in
As an alternative to storing the actual time that the disk (e.g., 110A, 110N) was offline, each I/O request issued to the storage pool (108) may be associated with a transaction group number. Thus, instead of storing the actual time the disk (e.g., 110A, 110N) was offline, the DTL (e.g., 115A, 115N) may store the transaction group number(s) during which the disk (e.g., 110A, 110N) was offline. More specifically, the DTL (e.g., 115A, 115N) may store the transaction group number(s) during which I/O requests were not successfully completed for the disk (e.g., 110A, 110N). Accordingly, the use of “birth time” in the following descriptions may refer to either a time or a transaction group number.
Those skilled in the art will appreciate that a single DTL may be maintained for the entire storage pool (108), where each entry identifies the particular disk (e.g., 110A, 110N) and when the disk (e.g., 110A, 110N) was offline. In addition, those skilled in the art will appreciate that the DTLs (e.g., 115A, 115N) may be stored in any location in the system (e.g., in the storage pool (108), in memory, etc.). In one embodiment of the invention, the SPA (106) manages the DTL (e.g., 115A, 115N) (i.e., updates the contents of the DTL (e.g., 115A, 115N), etc.).
As noted above, the SPA (106) receives transactions from the DMU (104). More specifically, the I/O management module (200), within the SPA (106), receives transactions from the DMU (104) and groups the transactions into transaction groups, in accordance with one embodiment of the invention. The compression module (201) provides functionality to compress larger logical blocks (i.e., data blocks and indirect blocks) into smaller segments, where a segment is a region of physical disk space. For example, a logical block size of 8 KB may be compressed to a size of 2 KB for efficient storage. Further, in one embodiment of the invention, the encryption module (202) provides various data encryption algorithms. The data encryption algorithms may be used, for example, to prevent unauthorized access. In one embodiment of the invention, the checksum module (203) includes functionality to calculate a checksum for data (i.e., data stored in a data block) and metadata (i.e., data stored in an indirect block) within the storage pool (108). The checksum may be used, for example, to ensure data has not been corrupted.
As discussed above, the SPA (106) provides an interface to the storage pool (108) and manages allocation of storage space within the storage pool (108). More specifically, in one embodiment of the invention, the SPA (106) uses the metaslab allocator (204) to manage the allocation of storage space in the storage pool (108).
In one embodiment of the invention, the storage space in the storage pool (108) is divided into contiguous regions of data, i.e., metaslabs. The metaslabs may in turn be divided into segments (i.e., portions of the metaslab). The segments may all be the same size, or alternatively, may be a range of sizes. The metaslab allocator (204) includes functionality to allocate large or small segments to store data blocks and indirect blocks. In one embodiment of the invention, allocation of the segments within the metaslabs is based on the size of the blocks within the I/O requests. That is, small segments are allocated for small blocks, while large segments are allocated for large blocks. The allocation of segments based on the size of the blocks may allow for more efficient storage of data and metadata in the storage pool (108) by reducing the amount of unused space within a given metaslab. Further, using large segments for large blocks may allow for more efficient access to data (and metadata) by reducing the number of DMU (104) translations and/or reducing the number of I/O operations. In one embodiment of the invention, the metaslab allocator (204) may include a policy that specifies a method to allocate segments.
As noted above, the storage pool (108) is divided into metaslabs, which are further divided into segments. Each of the segments within the metaslab may then be used to store a data block (i.e., data) or an indirect block (i.e., metadata).
In contrast to the root block (300), indirect blocks (302, 304, 306) and data blocks (308, 310, 312, 314) may be located anywhere in the storage pool. In one embodiment of the invention, the root block (300) and each block pointer (302A, 302B, etc.) include data as shown in the expanded diagram of block pointer (302B). One skilled in the art will appreciate that data blocks (308, 310, 312, 314) do not include this information; rather, data blocks (308, 310, 312, 314) contain actual data of files within the file system (e.g., 100 in
In one embodiment of the invention, each block pointer (e.g., 302A, 302B, etc.) includes a metaslab ID (318), an offset (320) within the metaslab, a birth time (322) of the block (i.e., data block or indirect block) referenced by the block pointer, and a checksum (324) of the data stored in the referenced block. In one embodiment of the invention, the metaslab ID (318) and offset (320) are used to determine the location of the referenced block in the storage pool. The metaslab ID (318) identifies a particular metaslab. More specifically, the metaslab ID (318) may identify the particular disk within the storage pool upon which the metaslab resides and the location on the disk where the metaslab begins. The offset (320) may then be used to reference a particular segment within the metaslab. In one embodiment of the invention, the data within the segment referenced by the particular metaslab ID (318) and offset (320) may correspond to either a data block or an indirect block. If the data corresponds to an indirect block, then the metaslab ID (318) and offset (320) within a block pointer in the indirect block are extracted and used to locate a subsequent data block or indirect block. The tree may be traversed in this manner to eventually retrieve a requested data block.
In one embodiment of the invention, copy-on-write transactions are performed for every data write request to a file. Specifically, all write requests cause new segments to be allocated for the modified data. Therefore, the retrieved data blocks and indirect blocks are never overwritten (until a modified version of the data block and indirect block is committed). More specifically, the DMU writes out all the modified data blocks in the tree to unused segments within the storage pool. Subsequently, the DMU writes out the corresponding block pointers (within indirect blocks) to unused segments in the storage pool. In one embodiment of the invention, fields (i.e., metaslab ID, offset, birth, checksum) for the corresponding block pointers are populated by the DMU prior to sending an I/O request to the SPA. The indirect blocks containing the block pointers are typically written one level at a time. To complete the copy-on-write transaction, the SPA issues a single write that atomically changes the root block to reference the indirect blocks referencing the modified data block.
In one embodiment of the invention, the transaction includes one or more data blocks and/or one or more indirect blocks. As noted above, the file system is stored on disk using a hierarchical structure including data blocks and indirect blocks. Thus, for a given transaction, the initial transaction group includes I/O requests for the data blocks to be written to disk, while subsequent transaction groups include I/O requests corresponding to the indirect blocks containing one or more block pointers. Accordingly, the transaction group referenced in ST104 includes I/O requests to write data blocks.
Continuing with the discussion of
Continuing with the discussion of
Next, the SPA receives and subsequently attempts to write the indirect blocks into the storage pool (ST116). Those skilled in the art will appreciate that if an indirect block is not written successfully, then the birth time of the block may be stored in a dirty time log (DTL), indicating that the write attempt was not successful. Further, those skilled in the art will appreciate that the birth time(s) stored in the DTL may be equivalent to the birth time(s) that would have been associated with a successful write to disk. Further, those skilled in the art will appreciate that if the write attempt fails, an attempt may be made to store the indirect block at another location. If the indirect block is stored in another location, then the DTL may not be updated.
Continuing with the discussion of
Those skilled in the art will appreciate that updating a DTL if a write attempt fails, as described above, offers fast performance and/or low system overhead, because the DTL is only updated if a write fails. Further, the use of birth times in the DTL minimizes the amount of storage space required to maintain the DTL. In addition, if many writes fail with the same birth time, the DTL only has to be updated once.
Turning to the flow chart of
If the birth time of the root block is greater than or equal to the lowest birth time listed in the DTL, then the process continues. Specifically, the root block is resilvered if the birth time of the root block is listed in the DTL (ST194). Regardless of whether the root block is resilvered, a list of all blocks referenced in the root block is subsequently obtained (ST196). The birth time for the first block on the list is then obtained (ST198), and a determination is made about whether the birth time of the block is greater than or equal to the lowest birth time listed in the DTL (ST200). Those skilled in the art will appreciate that if the birth time of the block is greater than or equal to the lowest birth time listed in the DTL, then the block or one of its children (if any exist) may require resilvering.
If the birth time of the block is greater than or equal to the lowest birth time listed in the DTL, then the block is resilvered if the birth time of the block is listed in the DTL (ST202). Regardless of whether the block is resilvered, a determination is then made about whether the block is an indirect block (ST204). If the block is an indirect block, then a list of all blocks referenced in the block is obtained (ST214) and the method proceeds to ST198, using the newly obtained list.
If the block is not an indirect block (i.e., the block is a data block), or if the birth time of the block is determined in ST200 to be lower than the lowest birth time listed in the DTL, then no further examination of the block or its children (if any exist) is required. Accordingly, a determination is then made about whether there are any blocks remaining in the list (i.e., the list obtained in ST198 or ST214) (ST206). If there are any blocks remaining in the list, then a birth time for the next block in the list is obtained (ST208), and the process proceeds to ST200, using the aforementioned next block.
If there aren't any blocks remaining in the list, then a determination is made about whether the most recently examined block is the root block (ST210). If the most recently examined block is the root block, then no further blocks require examining, so the process ends. Alternatively, if the most recently examined block is not the root block, then the process recursively traverses up the tree to the parent block of the most recently examined block (ST212), and the process proceeds to ST206, using the parent block.
Those skilled in the art will appreciate that the process in
Further, those skilled in the art will appreciate that the blocks in
Accordingly, those skilled in the art will appreciate that in a hierarchical data configuration (e.g., the tree of
The following is a description of steps, in accordance with one embodiment of the invention, that may be taken to resilver the hierarchical block tree shown in
Next, the birth times for the blocks referenced by the root block are obtained. In this case, the birth time of indirect block (702) is 40, which is greater than the lowest birth time listed in the DTL, so the resilvering process must continue. However, because 40 is not equal to any of the birth times listed in the DTL, indirect block (702) itself does not require resilvering.
A list of blocks referenced by indirect block (702) is then obtained: namely, indirect blocks (704 and 706). The birth time for indirect block (704) is then obtained (i.e., BT=21) and compared to the birth times listed in the DTL. Since birth time 21 is lower than the lowest birth time listed in the DTL, none of the blocks referenced directly or indirectly by block pointer (702A) require resilvering. More specifically, the birth time of indirect block (704) provides assurance that none of the blocks (704, 708, and 710) in the branch were committed to disk after transaction group 21. Accordingly, none of the blocks (704, 708, and 710) in the branch can possibly have a birth time equal to a birth time listed in the DTL.
The birth time for indirect block (706) is then obtained (i.e., BT=40) and compared to the DTL. In this case, because birth time 40 is greater than the lowest birth time listed in the DTL, the process must continue to traverse the branch that includes indirect block (706). Accordingly, a list of blocks referenced by indirect block (706) is then obtained: namely, data blocks (712 and 714). The birth time for data block (712) is then obtained (i.e., BT=37) and compared to the DTL. Because birth time 37 is listed in the DTL, data block (712) requires resilvering, and is resilvered accordingly.
Because there aren't any blocks below data block (712) in the tree, the resilvering process resumes by obtaining the birth time for data block (714) (i.e., BT=40). Since birth time 40 is not listed in the DTL, data block (714) does not require resilvering. Further, because there aren't any blocks below data block (712) in the tree, and there aren't any additional blocks referenced by indirect block (706) to be examined, no further traversal of this branch of the tree is required.
Subsequently, the process recursively traverses to the parent block of indirect block (706) (i.e., indirect block (702)). A determination is then made about whether there are any additional blocks referenced by indirect block (702) to be examined. Because there aren't any additional blocks referenced by indirect block (702) to be examined, the process recursively traverses to the parent block of indirect block (702) (i.e., the root block (700)). Because the parent block is the root block (700), the resilvering process is complete.
Those skilled in the art will appreciate that by using the process in
The invention may be implemented on virtually any type of computer regardless of the platform being used. For example, as shown in
Further, those skilled in the art will appreciate that one or more elements of the aforementioned computer system (800) may be located at a remote location and connected to the other elements over a network. Further, the invention may be implemented on a distributed system having a plurality of nodes, where each portion of the invention (e.g., operating system, file system, system call interface, DMU, SPA, storage pool, disk, dirty time log, metaslab allocator, I/O management module, compression module, encryption module, checksum module, root block, data block, indirect block, etc.) may be located on a different node within the distributed system. In one embodiment of the invention, the node corresponds to a computer system. Alternatively, the node may correspond to a processor with associated physical memory. The node may alternatively correspond to a processor with shared memory and/or resources. Further, software instructions to perform embodiments of the invention may be stored on a computer readable medium such as a compact disc (CD), a diskette, a tape, a file, or any other computer readable storage device.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this disclosure, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as disclosed herein. Accordingly, the scope of the invention should be limited only by the attached claims.
Ahrens, Matthew A., Bonwick, Jeffrey S., Moore, William H.
| Patent | Priority | Assignee | Title |
| Patent | Priority | Assignee | Title |
| 4144522, | Feb 25 1976 | Tokyo Shibaura Electric Co., Ltd. | Electro-control system for data transmission |
| 4209845, | Jan 25 1977 | International Business Machines Corporation | File qualifying and sorting system |
| 5129085, | Mar 31 1988 | Mitsubishi Denki Kabushiki Kaisha | Computer network with shared memory using bit maps including flags to indicate reserved memory areas and task status |
| 5155847, | Aug 03 1988 | DOT ASSETS NO 9 LLC | Method and apparatus for updating software at remote locations |
| 5274803, | Apr 26 1991 | Sun Microsystems, Inc.; Sun Microsystems, Inc | Method and apparatus for aligning a restored parent environment to its child environments with minimal data loss |
| 5371885, | Aug 29 1989 | Microsoft Technology Licensing, LLC | High performance file system |
| 5403639, | Sep 02 1992 | Storage Technology Corporation | File server having snapshot application data groups |
| 5410667, | Apr 17 1992 | Storage Technology Corporation | Data record copy system for a disk drive array data storage subsystem |
| 5675802, | Mar 31 1995 | IBM Corporation | Version control system for geographically distributed software development |
| 5819292, | Jun 03 1993 | NetApp, Inc | Method for maintaining consistent states of a file system and for creating user-accessible read-only copies of a file system |
| 6209111, | Nov 09 1998 | Microsoft Technology Licensing, LLC | Error correction on a mobile device |
| 6341341, | Dec 16 1999 | RPX Corporation | System and method for disk control with snapshot feature including read-write snapshot half |
| 6536033, | Jan 28 1999 | International Business Machines Corp. | Uniform mechanism for building containment hierarchies |
| 6745284, | Oct 02 2000 | Oracle America, Inc | Data storage subsystem including a storage disk array employing dynamic data striping |
| 6745305, | Dec 13 2000 | TERADATA US, INC | Zeroed block optimization in disk mirroring applications |
| 6795966, | Feb 15 1998 | VMware, Inc.; VMWARE, INC | Mechanism for restoring, porting, replicating and checkpointing computer systems using state extraction |
| 6820098, | Mar 15 2002 | Hewlett Packard Enterprise Development LP | System and method for efficient and trackable asynchronous file replication |
| 6829617, | Feb 15 2002 | SAP SE | Providing a snapshot of a subset of a file system |
| 6842834, | Jun 24 1997 | International Business Machines Corporation | Synchronization and resynchronization of loosely-coupled copy operations between a primary and a remote secondary DASD volume under concurrent updating |
| 6857001, | Jun 07 2002 | NetApp, Inc | Multiple concurrent active file systems |
| 6880051, | Mar 14 2002 | International Business Machines Corporation | Method, system, and program for maintaining backup copies of files in a backup storage device |
| 6892211, | Jun 03 1993 | Network Appliance, Inc. | Copy on write file system consistency and block usage |
| 6981114, | Oct 16 2002 | Veritas Technologies LLC | Snapshot reconstruction from an existing snapshot and one or more modification logs |
| 7007196, | Jun 10 2002 | Oracle America, Inc | Data storage system using 3-party hand-off protocol to facilitate failure recovery |
| 7032154, | Jun 05 2000 | Tyco Electronics Subsea Communications LLC | Concatenated forward error correction decoder |
| 7039661, | Dec 29 2003 | Veritas Technologies LLC | Coordinated dirty block tracking |
| 7043677, | Jul 19 2001 | Cisco Technology, Inc | Apparatus and method for separating corrupted data from non-corrupted data within a packet |
| 7133964, | Mar 20 2002 | Network Appliance, Inc | Raid assimilation method and apparatus |
| 7162486, | Jun 25 2001 | Network Appliance, Inc. | System and method for representing named data streams within an on-disk structure of a file system |
| 7174352, | Jun 03 1993 | NetApp, Inc | File system image transfer |
| 7200715, | Mar 21 2002 | NetApp, Inc | Method for writing contiguous arrays of stripes in a RAID storage system using mapped block writes |
| 7340640, | May 02 2003 | Veritas Technologies LLC | System and method for recoverable mirroring in a storage environment employing asymmetric distributed block virtualization |
| 20020004883, | |||
| 20020055942, | |||
| 20020087788, | |||
| 20020161972, | |||
| 20030033477, | |||
| 20030084242, | |||
| 20030126107, | |||
| 20030145167, | |||
| 20040024973, | |||
| 20040030822, | |||
| 20040098720, | |||
| 20040107314, | |||
| 20040123063, | |||
| 20040143713, | |||
| 20040225834, | |||
| 20040234000, | |||
| 20040268068, | |||
| 20050010620, | |||
| 20050097270, | |||
| 20050235154, | |||
| 20060168409, | |||
| 20060218644, | |||
| 20060256965, |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Apr 11 2006 | MOORE, WILLIAM H | Sun Microsystems, Inc | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 017816 | /0876 | |
| Apr 11 2006 | BONWICK, JEFFREY S | Sun Microsystems, Inc | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 017816 | /0876 | |
| Apr 11 2006 | AHRENS, MATTHEW A | Sun Microsystems, Inc | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 017816 | /0876 | |
| Apr 19 2006 | Oracle America, Inc. | (assignment on the face of the patent) | / | |||
| Feb 12 2010 | ORACLE USA, INC | Oracle America, Inc | MERGER AND CHANGE OF NAME SEE DOCUMENT FOR DETAILS | 037311 | /0233 | |
| Feb 12 2010 | Sun Microsystems, Inc | Oracle America, Inc | MERGER AND CHANGE OF NAME SEE DOCUMENT FOR DETAILS | 037311 | /0233 | |
| Feb 12 2010 | Oracle America, Inc | Oracle America, Inc | MERGER AND CHANGE OF NAME SEE DOCUMENT FOR DETAILS | 037311 | /0233 |
| Date | Maintenance Fee Events |
| Jul 06 2017 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
| Jul 07 2021 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
| Date | Maintenance Schedule |
| Jan 21 2017 | 4 years fee payment window open |
| Jul 21 2017 | 6 months grace period start (w surcharge) |
| Jan 21 2018 | patent expiry (for year 4) |
| Jan 21 2020 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Jan 21 2021 | 8 years fee payment window open |
| Jul 21 2021 | 6 months grace period start (w surcharge) |
| Jan 21 2022 | patent expiry (for year 8) |
| Jan 21 2024 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Jan 21 2025 | 12 years fee payment window open |
| Jul 21 2025 | 6 months grace period start (w surcharge) |
| Jan 21 2026 | patent expiry (for year 12) |
| Jan 21 2028 | 2 years to revive unintentionally abandoned end. (for year 12) |