Ling Y Zheng

US Patent:

20170010939, Jan 12, 2017

Filed:

Sep 22, 2016

Appl. No.:

15/272971

Inventors:

- Sunnyvale CA, US
Janice D'Sa - Bellevue WA, US
Srinath Krishnamachari - Mountain View CA, US
Ling Zheng - Saratoga CA, US

International Classification:

G06F 11/14
G06F 7/32
G06F 3/06
G06F 17/30

Abstract:

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.

US Patent:

20160070618, Mar 10, 2016

Filed:

Sep 10, 2014

Appl. No.:

14/482618

Inventors:

- Sunnyvale CA, US
Janice D'Sa - Bellevue WA, US
Srinath Krishnamachari - Mountain View CA, US
Ling Zheng - Saratoga CA, US

International Classification:

G06F 11/10
G06F 11/14
G06F 11/20

Abstract:

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.