Reconstruction of dense tree volume metadata state across crash recovery

US9501359B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9501359-B2
Application numberUS-201414482618-A
CountryUS
Kind codeB2
Filing dateSep 10, 2014
Priority dateSep 10, 2014
Publication dateNov 22, 2016
Grant dateNov 22, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Embodiments herein are directed to efficient crash recovery of persistent metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. Volume metadata managed by the volume layer is organized as a multi-level dense tree, wherein each level of the dense tree includes volume metadata entries for storing the volume metadata. When a level of the dense tree is full, the volume metadata entries of the level are merged with the next lower level of the dense tree. During a merge operation, two sets of generation IDs may be used in accordance with a double buffer arrangement: a first generation ID for the append buffer that is full (i.e., a merge staging buffer) and a second, incremented generation ID for the append buffer that accepts new volume metadata entries. Upon completion of the merge operation, the lower level (e.g., level 1) to which the merge is directed is assigned the generation ID of the merge staging buffer.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: receiving a write request directed towards a logical unit (LUN), the write request having data, a logical block address (LBA) and a first length representing a first address range of the LUN, the write request processed at a storage system having a memory; associating a key with the data; determining whether a first metadata structure exceeds an occupancy threshold to store a first data entry having the key, a first offset and the first length representing the first address range of the LUN, the first metadata structure assigned a first generation identifier (ID); in response to determining that the first metadata structure exceeds the occupancy threshold, storing the first data entry in a second metadata structure, the second metadata structure assigned a second generation ID different from the first generation ID; merging a second data entry of a first level 0 of the first metadata structure with a third data entry of a level 1 of the first metadata structure to form a fourth data entry, the second data entry having a second offset and a second length representing a second address range, the third data entry having a third offset and a third length representing a third address range, the fourth data entry representing a merge of the second address range with the third address range; and storing the fourth data entry in a storage array of solid state drives (SSDs) attached to the storage system. 2. The method of claim 1 wherein the first data entry is stored in a second level 0 of the second metadata structure, wherein the level 1 of the first metadata structure is shared with the second metadata structure, wherein the first and second level 0s are stored in the memory, and wherein the level 1 is stored on the storage array. 3. The method of claim 2 further comprising: storing the first generation ID and second generation ID on the storage array; performing a merge operation of the first level 0 of the first metadata structure with the level 1 of the first metadata structure; incrementing the first generation ID; and storing the incremented first generation ID in the level 1 of the first metadata structure on the storage array. 4. The method of claim 1 further comprising: logging the first data entry in a log entry of a persistent log, the log entry associated with the second generation ID. 5. The method of claim 2 further comprising: recovering the first level 0 of the first metadata structure from the storage array; disregarding the fourth data entry stored on the storage array; and restarting the merging of the second data entry of the first level of the first metadata structure with the third data entry of the second level of the first metadata structure. 6. The method of claim 4 further comprising: replaying the log entry of the persistent log; and recovering the second level 0 of the second metadata structure from the storage array. 7. The method of claim 5 wherein the restart of the merge is in response to comparing first and second fields of the level 0 stored on storage array, and wherein the first field includes the first generation ID and the second field includes the second generation ID. 8. The method of claim 2 further comprising: assigning a default generation ID to the first level 0 of the first metadata structure, thereby indicating the first level 0 is empty. 9. The method of claim 1 wherein the fourth data entry is associated with level 1 of the first metadata structure. 10. A method comprising: receiving a write request directed towards a logical unit (LUN), the write request having data, a logical block address (LBA) and a length representing a first address range of the LUN, the write request processed at a storage system having a memory; associating a key with the data; adding a first data entry to a level 0 of a first metadata structure stored in the memory, the first data entry representing the first address range of the LUN, the first metadata structure representing a second address range of the LUN overlapping the first address range, the first data entry having the key, wherein adding the first data entry renders the level 0 of the first metadata structure full, wherein the first metadata structure is assigned a first generation identifier (ID); creating a second metadata structure assigned a second generation ID different from the first generation ID; merging the level 0 of the first metadata structure with a level 1 of the first metadata structure stored in a storage array of solid state drives (SSDs) attached to the storage system, the level 1 of the first metadata structure shared with the second metadata structure; and storing a result of the merging in the level 1 of the first metadata structure in a storage array of solid state drives (SSDs) attached to the storage system. 11. A system comprising: a storage system having a memory connected to a processor via a bus; a storage array coupled to the storage system and having one or more solid state drives (SSDs); a storage I/O stack executing on the processor of the storage system, the storage I/O stack when executed operable to: receive a write request directed towards a logical unit (LUN), the write request having data, a logical block address (LBA) and a first length representing a first address range of the LUN, the write request processed at a storage system having a memory; associate a key with the data; determine whether a first metadata structure exceeds an occupancy threshold to store a first data entry having the key, a first offset and the first length representing the first address range of the LUN, the first metadata structure assigned a first generation identifier (ID); in response to determining that the first metadata structure exceeds the occupancy threshold, store the first data entry in a second metadata structure, the second metadata structure assigned a second generation ID different from the first generation ID; merge a second data entry of a first level 0 of the first metadata structure with a third data entry of a level 1 of the first metadata structure to form a fourth data entry, the second data entry having a second offset and a second length representing a second address range, the third data entry having a third offset and a third length representing a third address range, the fourth data entry representing a merge of the second address range with the third address range; and store the fourth data entry in a storage array of solid state drives (SSDs) attached to the storage system. 12. The system of claim 11 wherein the first data entry is stored in a second level 0 of the second metadata structure, wherein the level 1 of the first metadata structure is shared with the second metadata structure, wherein in the first and second level 0s are stored in the memory and wherein the level 1 is stored on the storage array. 13. The system of claim 12 wherein the storage I/O stack is further operable to: store the first generation ID and second generation ID on the storage array; perform a merge operation of the first level 0 of the first metadata structure with the level 1 of the first metadata structure; increment the first generation ID; and store the incremented first generation ID in the level 1 of the first metadata structure on the storage array. 14. The system of claim 11 wherein the storage I/O stack is further operable to: log the first data entry in a log entry of a persistent log, the log entry associated with the second generation ID. 15. The system of claim 12 wherein the storage I/O stack is fur

Assignees

Inventors

Classifications

  • Using snapshots, i.e. a logical point-in-time copy of the data · CPC title

  • by selection of backup contents · CPC title

  • Management of state, configuration or failover · CPC title

  • Reconstruction on already foreseen single or plurality of spare disks · CPC title

  • Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9501359B2 cover?
Embodiments herein are directed to efficient crash recovery of persistent metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. Volume metadata managed by the volume layer is organized as a multi-level dense tree, wherein each level of the dense tree includes volume metadata entries for storing the volume metadata. When a level of …
Who is the assignee on this patent?
Netapp Inc
What technology area does this patent fall under?
Primary CPC classification G06F11/1088. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Nov 22 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).