首页> 外国专利> Reconstruction of dense tree volume metadata state across crash recovery

Reconstruction of dense tree volume metadata state across crash recovery

机译:跨崩溃恢复重建密集树卷元数据状态

摘要

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.
机译:本文的实施例针对由在群集的一个或多个节点上执行的存储输入/输出(I / O)堆栈的卷层管理的持久元数据的有效崩溃恢复。由卷层管理的卷元数据被组织为多层密集树,其中,密集树的每个级别包括用于存储体积元数据的体积元数据条目。当密集树的某个级别已满时,该级别的卷元数据条目将与该密集树的下一个较低级别合并。在合并操作期间,可以根据双缓冲区安排使用两组生成ID:充满的附加缓冲区的第一代ID(即合并分段缓冲区)和附加的第二递增生成ID接受新的卷元数据条目的缓冲区。在合并操作完成时,将合并所指向的较低级别(例如,级别1)分配给合并登台缓冲器的生成ID。

著录项

  • 公开/公告号US9501359B2

    专利类型

  • 公开/公告日2016-11-22

    原文格式PDF

  • 申请/专利权人 NETAPP INC.;

    申请/专利号US201414482618

  • 申请日2014-09-10

  • 分类号G06F17/30;G06F11/10;G06F11/20;G06F11/14;

  • 国家 US

  • 入库时间 2022-08-21 13:41:47

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号