公开(公告)号：US20160062836A1

公开(公告)日：2016-03-03

申请号：US14472885

申请日：2014-08-29

Applicant: NetApp, Inc.

Inventor： Yuedong Mu ,  Manoj V. Sundararajan ,  Ching-Yuk Paul Ngan

IPC: G06F11/10 ,  G06F11/16 ,  G06F11/14 ,  G06F11/20

CPC classification number: G06F11/1451 ,  G06F11/00 ,  G06F11/1658 ,  G06F11/2058 ,  G06F11/2069 ,  G06F2201/84

Abstract: A distributed storage system replicates data for a primary logical storage object on a primary node of the storage system to a secondary logical storage object on a secondary node on the distributed storage system. Failures in writing data to the primary logical storage object or failures in the replication of the data to the secondary logical storage object can cause data that should be synchronized to become divergent. In cases where the data may be divergent, reconciliation operations can be performed to resynchronize the data.

Abstract translation: 分布式存储系统将存储系统的主节点上的主逻辑存储对象的数据复制到分布式存储系统上的辅助节点上的辅助逻辑存储对象。 将数据写入主逻辑存储对象或将数据复制到辅助逻辑存储对象中的故障可能导致应同步的数据变得分歧。 在数据可能不一致的情况下，可以执行协调操作以重新同步数据。

公开(公告)号：US20160062833A1

公开(公告)日：2016-03-03

申请号：US14476620

申请日：2014-09-03

Applicant: NetApp, Inc.

Inventor： David Slik

IPC: G06F11/10 ,  G06F3/06 ,  G06F17/30

CPC classification number: G06F11/1076 ,  G06F3/064 ,  G06F3/0683 ,  G06F3/0689 ,  G06F11/1092 ,  G06F16/22 ,  G06F2003/0692 ,  H04L67/1097

Abstract: Technology is disclosed for a data storage architecture for providing enhanced storage resiliency for a data object. The data storage architecture can be implemented in a single-tier configuration and/or a multi-tier configuration. In the single-tier configuration, a data object is encoded, e.g., based on an erasure coding method, to generate many data fragments, which are stored across many storage devices. In the multi-tier configuration, a data object is encoded, e.g., based on an erasure coding method, to generate many data segments, which are sent to one or more tiers of storage nodes. Each of the storage nodes further encodes the data segment to generate many data fragments representing the data segment, which are stored across many storage devices associated with the storage node. The I/O operations for rebuilding the data in case of device failures is spread across many storage devices, which minimizes the wear of a given storage device.

Abstract translation: 公开了用于为数据对象提供增强的存储弹性的数据存储架构的技术。 数据存储架构可以在单层配置和/或多层配置中实现。 在单层配置中，例如基于擦除编码方法对数据对象进行编码，以生成许多存储在多个存储设备中的数据片段。 在多层配置中，例如基于擦除编码方法对数据对象进行编码，以生成发送到一层或多层存储节点的许多数据段。 每个存储节点进一步对数据段进行编码以生成表示数据段的许多数据片段，其被存储在与存储节点相关联的许多存储设备中。 在设备故障的情况下重建数据的I / O操作分布在许多存储设备中，这样可以最大限度地减少给定存储设备的磨损。

公开(公告)号：US20160062832A1

公开(公告)日：2016-03-03

申请号：US14475376

申请日：2014-09-02

Applicant: NetApp. Inc.

Inventor： David Slik ,  Barry Patrick Benight

IPC: G06F11/10 ,  G06F17/30

CPC classification number: G06F11/1076 ,  G06F3/064 ,  G06F3/0683 ,  G06F3/0689 ,  G06F11/1092 ,  G06F16/22 ,  G06F2003/0692 ,  H04L67/1097

Abstract: Technology is disclosed for a data storage architecture for providing enhanced storage resiliency for a data object. The data storage architecture can be implemented in a single-tier configuration and/or a multi-tier configuration. In the single-tier configuration, a data object is encoded, e.g., based on an erasure coding method, to generate many data fragments, which are stored across many storage devices. In the multi-tier configuration, a data object is encoded, e.g., based on an erasure coding method, to generate many data segments, which are sent to one or more tiers of storage nodes. Each of the storage nodes further encodes the data segment to generate many data fragments representing the data segment, which are stored across many storage devices associated with the storage node. The I/O operations for rebuilding the data in case of device failures is spread across many storage devices, which minimizes the wear of a given storage device.

Abstract translation: 公开了用于为数据对象提供增强的存储弹性的数据存储架构的技术。 数据存储架构可以在单层配置和/或多层配置中实现。 在单层配置中，例如基于擦除编码方法对数据对象进行编码，以生成许多存储在多个存储设备中的数据片段。 在多层配置中，例如基于擦除编码方法对数据对象进行编码，以生成发送到一层或多层存储节点的许多数据段。 每个存储节点进一步对数据段进行编码以生成表示数据段的许多数据片段，其被存储在与存储节点相关联的许多存储设备中。 在设备故障的情况下重建数据的I / O操作分布在许多存储设备中，这样可以最大限度地减少给定存储设备的磨损。

公开(公告)号：US20160062694A1

公开(公告)日：2016-03-03

申请号：US14939760

申请日：2015-11-12

Applicant: NetApp, Inc.

Inventor： Gaurav Makkar ,  Srinivasan Narayanamurthy ,  Kartheek Muthyala ,  Stephen Daniel

IPC: G06F3/06

CPC classification number: G06F3/0629 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0643 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30165

Abstract: Embodiments described herein provide an object store that efficiently manages and services objects for use by clients of a distributed data processing system. Illustratively, the object store may be embodied as a quasi-shared storage system that interacts with nodes of the distributed data processing system to service the objects as blocks of data stored on a plurality of storage devices, such as disks, of the storage system. To that end, an architecture of the object store may include an on-disk layout, e.g., of the storage system, and an incore layout, e.g., of the nodes, that cooperate to illustratively convert the blocks to objects for access by the clients.

Abstract translation: 本文描述的实施例提供了有效地管理和服务对象以供分布式数据处理系统的客户端使用的对象存储。 示例性地，对象存储可以被体现为准共享存储系统，其与分布式数据处理系统的节点进行交互，以将对象作为存储在存储系统的多个存储设备（例如磁盘）上的数据块。 为此，对象商店的架构可以包括例如存储系统的磁盘布局，以及诸如节点之类的布局布局，这些布局协作以示意性地将块转换为对象以供客户端访问 。

公开(公告)号：US09275083B2

公开(公告)日：2016-03-01

申请号：US14163862

申请日：2014-01-24

Applicant: NetApp, Inc.

Inventor： Neelesh M. Thakur ,  Kumar Parthasarathi ,  Vani Bappanadu ,  Santosh C. Lolayekar ,  Balamurali Palaiah ,  Boris Teterin

IPC: G06F17/30 ,  G06F11/14 ,  G06F11/20

CPC classification number: G06F17/30289 ,  G06F11/1458 ,  G06F11/2005 ,  G06F11/2007 ,  G06F11/2012 ,  G06F17/30082 ,  G06F2201/815

Abstract: Described herein are systems and methods for providing data policy management over application objects in a storage system environment. An application object may comprise non-virtual or virtual objects (e.g., non-virtual-based applications, virtual-based applications, or virtual storage components). An application object manager may represent application objects by producing mapping graphs and/or application object data that represent application objects in a standardized manner. A mapping graph for an application object may describe a mapping between the application object and its underlying storage objects on a storage system. Application object data may describe a mapping graph in a standardized format. Application object data representing application objects may be received by an application policy manager that manages data policies on the application objects (including virtual applications and virtual storage components) based on the received application object data. Data policies may include policies for backup, service level objectives, recovery, monitoring and/or reporting.

Abstract translation: 这里描述了用于在存储系统环境中对应用对象提供数据策略管理的系统和方法。 应用对象可以包括非虚拟或虚拟对象（例如，基于非虚拟的应用，基于虚拟的应用或虚拟存储组件）。 应用对象管理器可以通过以标准化的方式产生表示应用对象的映射图和/或应用对象数据来表示应用对象。 应用程序对象的映射图可以描述应用程序对象与存储系统上的底层存储对象之间的映射。 应用对象数据可以以标准格式描述映射图。 表示应用对象的应用对象数据可以由应用策略管理器接收，该应用策略管理器基于所接收的应用对象数据来管理应用对象（包括虚拟应用和虚拟存储组件）上的数据策略。 数据策略可能包括备份策略，服务级别目标，恢复，监控和/或报告。

公开(公告)号：US20160055224A1

公开(公告)日：2016-02-25

申请号：US14526141

申请日：2014-10-28

Applicant: NetApp, Inc.

Inventor： Rithin Shetty ,  Vishwajith Shivappa ,  Paul Lockwood ,  Pawan Saxena ,  Preethi Gopaulakrishnan

IPC: G06F17/30

CPC classification number: G06F11/1469 ,  G06F11/1451 ,  G06F16/128 ,  G06F2201/82

Abstract: A system and method for efficiently restoring one or more data containers is provided. A common persistent consistency point image (PCPI) is identified between a source and a destination storage systems prior to the destination storage system performing a rollback operation to the commonly identified PCPI. Differential data is then transmitted from the source storage system in a line efficient manner to the destination storage system.

Abstract translation: 提供了一种用于有效地恢复一个或多个数据容器的系统和方法。 在目的地存储系统对通常识别的PCPI执行回滚操作之前，在源和目的地存储系统之间识别公共持久一致性点图像（PCPI）。 然后将差分数据以有效的方式从源存储系统发送到目的地存储系统。

公开(公告)号：US09270741B2

公开(公告)日：2016-02-23

申请号：US14141054

申请日：2013-12-26

Applicant: NetApp, Inc.

Inventor： Steven R. Klinkner ,  Brian M. Hackworth

IPC: H04L29/08 ,  G06F17/30 ,  H04L12/911 ,  H04L12/24

CPC classification number: H04L67/1097 ,  G06F17/30091 ,  G06F17/30123 ,  G06F17/30194 ,  G06F17/30203 ,  H04L41/0233 ,  H04L47/70 ,  H04L67/10

Abstract: A namespace and storage management (NSM) application includes an infrastructure configured to enable efficient management of resources in a storage system environment. The NSM application executes on a NSM console and interacts with an NSM server to integrate namespace management and storage management in the storage system environment. The NSM server, in turn, interacts with one or more remote agents installed on host machines in the environment to convey application programming interface (API) function calls that enable remote management of the resources.

Abstract translation: 命名空间和存储管理（NSM）应用程序包括配置为实现存储系统环境中资源的高效管理的基础设施。 NSM应用程序在NSM控制台上执行，并与NSM服务器进行交互，以将命名空间管理和存储管理集成到存储系统环境中。 NSM服务器又与安装在环境中的主机上的一个或多个远程代理进行交互，以传达能够远程管理资源的应用程序编程接口（API）函数调用。

公开(公告)号：US09270537B2

公开(公告)日：2016-02-23

申请号：US14505400

申请日：2014-10-02

Applicant: NetApp, Inc.

Inventor： Gokul Nadathur ,  Anumita Biswas

IPC: G06F15/173 ,  H04L12/24 ,  H04L12/861 ,  H04L29/08

CPC classification number: H04L41/12 ,  H04L49/90 ,  H04L67/142

Abstract: Example embodiments provide various techniques for distributing connections within a connectional parallelism architecture. In one embodiment, a method is provided where resource utilizations of connection groups are measured. Here, each connection group is assigned to one of multiple processors. A probability distribution is accessed that maps probabilities assigned to relative resource utilizations. A relative resource utilization of one of the connection groups is determined based on a resource utilization of the one connection group relative to other resource utilizations of other connection groups. A probability from the probability distribution is identified based on the determined relative resource utilization, and based on the identified probability, a connection is assigned to this connection group for execution by one of the processors assigned to this connection group.

Abstract translation: 示例性实施例提供用于在连接并行架构内分发连接的各种技术。 在一个实施例中，提供了测量连接组的资源利用率的方法。 这里，每个连接组被分配给多个处理器之一。 访问分配给相对资源利用率的概率的概率分布。 基于相对于其他连接组的其他资源利用率的一个连接组的资源利用率来确定连接组之一的相对资源利用率。 基于所确定的相对资源利用率来识别来自概率分布的概率，并且基于所识别的概率，将连接分配给该连接组以供分配给该连接组的处理器之一执行。

公开(公告)号：US09268654B2

公开(公告)日：2016-02-23

申请号：US14589874

申请日：2015-01-05

Applicant: NetApp, Inc.

Inventor： Daniel Holmes ,  Luke Winckelmann ,  Manfred A. Buchmann ,  Alvin Richards

IPC: G06F15/16 ,  G06F11/14 ,  H04L29/08

CPC classification number: G06F11/1464 ,  G06F11/1456 ,  G06F15/16 ,  G06F2201/80 ,  G06F2201/84 ,  H04L67/1097

Abstract: Systems and methods for centralizing database manipulation for a plurality of heterogeneous databases are disclosed. A single or limited number of central servers can be used to manage a plurality of hosted client systems. With such a technique, database consistent backups can be performed without requiring altering of the central server, even when different database engines are used across the hosted client systems.

公开(公告)号：US09268502B2

公开(公告)日：2016-02-23

申请号：US14027994

申请日：2013-09-16

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

IPC: G06F3/06 ,  G06F17/30

CPC classification number: G06F17/30327 ,  G06F3/0611 ,  G06F3/0619 ,  G06F3/0638 ,  G06F3/0641 ,  G06F3/0655 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30 ,  G06F17/30292

Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer. The volume layer manages volume metadata embodied as mappings from offsets of a logical unit (LUN) to extent keys associated with storage locations for extents on the one or more storage devices. Volume metadata is maintained as a dense tree metadata structure representing successive points in time. The dense tree metadata structure has multiple levels, wherein a top level of the dense tree metadata structure represents newer volume metadata changes and descending levels of the dense tree metadata structure represent older volume metadata changes. The node accesses a latest version of changes to the volume metadata by searching from the top level to the descending levels in the dense tree metadata structure.

Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有体积层的存储输入/输出（I / O）堆栈。 卷层管理体现为从逻辑单元（LUN）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。