公开(公告)号：US09298726B1

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

申请号：US13632892

申请日：2012-10-01

Applicant: NetApp, Inc.

Inventor： Shishir Mondal ,  Praveen Killamsetti

IPC: G06F7/00 ,  G06F17/00 ,  G06F17/30

CPC classification number: G06F17/30159 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/067

Abstract: Techniques for using a bloom filter in deduplication are described herein. A change log comprising a plurality of data blocks may be received. Values associated with the data blocks may be hashed and compared with a bloom filter. The comparison with the bloom filter identifies data blocks from the change log as unique data blocks or potential duplicate data blocks. A bit by bit comparison of the potential duplicate data blocks and previous data blocks may be performed to determine if any of the potential duplicate data blocks are identical to any of previous data blocks. Such data blocks of the change log that are identified as being identical may be deduplicated.

Abstract translation: 本文描述了在重复数据删除中使用布隆过滤器的技术。 可以接收包括多个数据块的改变日志。 与数据块相关联的值可以被散列并与布隆过滤器进行比较。 与bloom过滤器的比较将变更日志中的数据块标识为唯一的数据块或潜在的重复数据块。 可以执行潜在的重复数据块和先前数据块的逐位比较，以确定任何潜在的重复数据块是否与先前数据块中的任何数据块相同。 识别为相同的更改日志的这些数据块可以被重复数据删除。

公开(公告)号：US09298616B2

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

申请号：US14315881

申请日：2014-06-26

Applicant: NetApp, Inc.

Inventor： Gokul Soundararajan ,  Lakshmi Narayanan Bairavasundaram ,  Vipul Mathur ,  Kaladhar Voruganti

IPC: G06F12/00 ,  G06F12/08

CPC classification number: G06F12/0802 ,  G06F12/0888 ,  G06F2212/6042

Abstract: Embodiments of the systems and techniques described here can leverage several insights into the nature of workload access patterns and the working-set behavior to reduce the memory overheads. As a result, various embodiments make it feasible to maintain running estimates of a workload's cacheability in current storage systems with limited resources. For example, some embodiments provide for a method comprising estimating cacheability of a workload based on a first working-set size estimate generated from the workload over a first monitoring interval. Then, based on the cacheability of the workload, a workload cache size can be determined. A cache then can be dynamically allocated (e.g., change, possibly frequently, the cache allocation for the workload when the current allocation and the desired workload cache size differ), within a storage system for example, in accordance with the workload cache size.

Abstract translation: 这里描述的系统和技术的实施例可以利用对工作负载访问模式和工作集行为的性质的几个见解，以减少内存开销。 因此，各种实施例使得可以在有限的资源的当前存储系统中维持工作负载的高速缓存的运行估计。 例如，一些实施例提供了一种方法，其包括基于在第一监视间隔上从工作负载产生的第一工作集大小估计来估计工作负载的可缓存性。 然后，基于工作负载的可缓存性，可以确定工作负载高速缓存大小。 然后可以根据工作负载高速缓存大小来动态地分配高速缓存（例如，当当前分配和期望的工作负载高速缓存大小不同时，可以频繁地改变工作负载的高速缓存分配），例如在存储系统内。

公开(公告)号：US09282049B2

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

申请号：US14690258

申请日：2015-04-17

Applicant: NetApp, Inc.

Inventor： Richard M. Scheffenegger

IPC: H04L12/801 ,  H04L12/825 ,  H04L12/855 ,  H04L12/54 ,  H04L12/70

CPC classification number: H04L47/34 ,  H04L47/00 ,  H04L47/10 ,  H04L47/11 ,  H04L47/12 ,  H04L47/18 ,  H04L47/193 ,  H04L47/2466 ,  H04L47/263

Abstract: A computer program product having a computer readable medium tangibly recording computer program logic for providing feedback in a network, the computer program product including code to receive first data and second data over the network at a receiving device, code to increment a first counter and a second counter in response to the first data and second data, respectively, code to generate a plurality of feedback signals reflecting states of the first and second counters using at least three bits, the bits defining a set of code points mapped to the states of the first and second counters so that each individual code point represents a different one of the states and each one of the states is represented by one code point, and code to transmit the plurality of feedback signals to a sending device in the network.

Abstract translation: 一种计算机程序产品，具有有形地记录用于在网络中提供反馈的计算机程序逻辑的计算机可读介质，所述计算机程序产品包括在接收设备处通过网络接收第一数据和第二数据的代码，用于增加第一计数器的代码和 第二计数器分别响应于第一数据和第二数据，使用至少三位来产生反映第一和第二计数器的状态的多个反馈信号的代码，所述比特定义映射到所述第一数据和第二数据的状态的一组代码点 第一和第二计数器，使得每个单独代码点表示不同的状态，并且每个状态由一个代码点表示，以及用于将多个反馈信号发送到网络中的发送设备的代码。

公开(公告)号：US09280571B2

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

申请号：US14460032

申请日：2014-08-14

Applicant: NetApp, Inc.

Inventor： Vinod Kumar Daga ,  Craig Johnston ,  Ling Zheng

IPC: G06F17/30

CPC classification number: G06F17/30303 ,  G06F17/30079 ,  G06F17/3015 ,  G06F17/30156

Abstract: A method performed in a system that has a plurality of volumes stored to storage hardware, the method including generating, for each of the volumes, a respective space saving potential iteratively over time and scheduling space saving operations among the plurality of volumes by analyzing each of the volumes for space saving potential and assigning priority of resources based at least in part on space saving potential.

Abstract translation: 一种在具有存储到存储硬件的多个卷的系统中执行的方法，所述方法包括针对每个卷生成随时间迭代的相应的空间节省潜力，并且通过分析每个卷中的每个 节省空间的潜力，并至少部分依赖节省空间的潜力来分配资源的优先级。

公开(公告)号：US09280484B2

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

申请号：US14222781

申请日：2014-03-24

Applicant: NetApp, Inc.

Inventor： Manoj Nayak

IPC: G06F12/08 ,  G06F12/12

CPC classification number: G06F12/0893 ,  G06F11/1453 ,  G06F12/0804 ,  G06F12/0873 ,  G06F12/0891 ,  G06F12/12 ,  G06F2212/154 ,  G06F2212/261 ,  G06F2212/313 ,  G06F2212/60 ,  G06F2212/70

Abstract: A storage system comprises a cache for caching data blocks and storage devices for storing blocks. A storage operating system may deduplicate sets of redundant blocks on the storage devices based on a deduplication requirement. Blocks in cache are typically deduplicated based on the deduplication on the storage devices. Sets of redundant blocks that have not met the deduplication requirement for storage devices and have not been deduplicated on the storage devices and cache are targeted for further deduplication processing. Sets of redundant blocks may be further deduplicated based on their popularity (number of accesses) in cache. If a set of redundant blocks in cache is determined to have a combined number of accesses being greater than a predetermined threshold number of accesses, the set of redundant blocks is determined to be “popular.” Popular sets of redundant blocks are selected for deduplication in cache and the storage devices.

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

公开(公告)号：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）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。