Method and system for pruned resilvering using a dirty time log

• US 20070106677A1
• Filed: 04/19/2006
• Published: 05/10/2007
• Est. Priority Date: 11/04/2005
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Ahrens, Matthew, Moore, William, Bonwick, Jeffrey
• Granted Patent: US 8,635,190 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1435 using file system or storage system metadata
• CPC Class Codes: G06F 11/2082 Data synchronisation

Abstract

A computer readable medium includes 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.

Claims

1. 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.

2. The computer readable medium of claim 1, wherein the parent block comprises the birth time of the child block.

3. The computer readable medium of claim 1, wherein the birth time of the parent block corresponds to a transaction group associated with an input/output (I/O) request to store the parent block.

4. The computer readable medium of claim 1, wherein the birth time of the child block corresponds to a transaction group associated with an input/output (I/O) request to store the child block.

5. The computer readable medium of claim 1, wherein the DTL is associated with a first disk in the storage pool, and wherein resilvering the child block comprises updating the child block using data from a second disk in the storage pool.

6. The computer readable medium of claim 1, wherein the traversing comprises performing a depth-first traversal of the branch.

7. The computer readable medium of claim 1, further comprising executable instructions for resilvering a hierarchical block tree in a storage pool by:

resilvering the parent block only if the DTL comprises the birth time of the parent block.

8. 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.

9. The computer readable medium of claim 8, wherein the parent block comprises the birth time of the child block.

10. The computer readable medium of claim 8, wherein the birth time of the child block corresponds to a transaction group associated with an input/output (I/O) request to store the child block.

11. The computer readable medium of claim 8, wherein the grandchild block is a data block.

12. The computer readable medium of claim 8, wherein the DTL is associated with a first disk in the storage pool, and wherein resilvering the child block comprises updating the child block using data from a second disk in the storage pool.

13. The computer readable medium of claim 8, wherein the birth time of each child block is obtained only if the birth time of the parent block is greater than or equal to the lowest birth time on the DTL.

14. The computer readable medium of claim 8, wherein the hierarchical block tree corresponds to a file in a file system.

15. A system comprising:

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;

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.

16. The system of claim 15, wherein the parent block comprises the birth time of the child block.

17. The system of claim 15, wherein the birth time of the parent block corresponds to a transaction group associated with an input/output (I/O) request to store the parent block.

18. The system of claim 15, wherein the birth time of the child block corresponds to a transaction group associated with an input/output (I/O) request to store the child block.

19. The system of claim 15, wherein the DTL is associated with a first disk in the storage pool, and wherein resilvering the child block comprises updating the child block using data from a second disk in the storage pool.

20. The system of claim 15, wherein the file system is configured to traverse the branch by performing a depth-first traversal of the branch.