公开(公告)号：US20160077745A1

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

申请号：US14484565

申请日：2014-09-12

Applicant: NetApp, Inc.

Inventor： Dhaval Patel ,  Manish Swaminathan ,  Edward D. McClanahan ,  John Muth

IPC: G06F3/06 ,  G06F12/02

CPC classification number: G06F12/0253 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/0641 ,  G06F3/0656 ,  G06F3/0688 ,  G06F12/0246 ,  G06F2212/1016 ,  G06F2212/1024 ,  G06F2212/1044 ,  G06F2212/702 ,  G06F2212/7201 ,  G06F2212/7205

Abstract: A rate matching technique may be configured to adjust a rate of cleaning of one or more selected segments of the storage array to accommodate a variable rate of incoming workload processed by a storage input/output (I/O) stack executing on one or more nodes of a cluster. An extent store layer of the storage I/O stack may clean a segment in accordance with segment cleaning which, illustratively, may be embodied as a segment cleaning process. The rate matching technique may be implemented as a feedback control mechanism configured to adjust the segment cleaning process based on the incoming workload. Components of the feedback control mechanism may include one or more weight schedulers and various accounting data structures, e.g., counters, configured to track the progress of segment cleaning and free space usage. The counters may also be used to balance the rates of segment cleaning and incoming I/O workload, which may change depending upon an incoming I/O rate. When the incoming I/O rate changes, the rate of segment cleaning may be adjusted accordingly to ensure that rates are substantially balanced.

Abstract translation: 速率匹配技术可以被配置为调整存储阵列的一个或多个所选段的清理速率，以适应由在一个或多个节点上执行的存储输入/输出（I / O）栈处理的进入工作负载的可变速率 的集群。 存储I / O堆栈的盘区存储层可以根据段清洁来清洁段，其示例性地可以被实现为段清理过程。 速率匹配技术可以被实现为反馈控制机制，其被配置为基于输入的工作负载来调整段清除过程。 反馈控制机构的组件可以包括一个或多个权重调度器和各种会计数据结构，例如计数器，其被配置为跟踪段清洁和可用空间使用的进度。 这些计数器也可用于平衡段清除和输入I / O工作负载的速率，这可能会根据传入的I / O速率而改变。 当进入的I / O速率变化时，可以相应地调节段清洁的速率，以确保速率基本平衡。

公开(公告)号：US20160077741A1

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

申请号：US14488003

申请日：2014-09-16

Applicant: NetApp, Inc.

Inventor： Lewis Newby, JR. ,  Kelly Hemphill

IPC: G06F3/06

CPC classification number: G06F3/0604 ,  G06F3/0605 ,  G06F3/0613 ,  G06F3/0631 ,  G06F3/0647 ,  G06F3/0653 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0685 ,  G06F17/3053 ,  H04L41/0896 ,  H04L41/142 ,  H04L41/5003 ,  H04L43/0888

Abstract: Workload on an aggregation of storage devices can be quantified in terms of demand on the aggregation of storage devices and demand on logical storage containers configured on the aggregation of storage devices. The demand on the aggregation of storage devices and the demand on logical storage containers thereon are calculated in a manner that captures demand on both storage capacity and performance capability. Capturing demand on both storage capacity and performance capability facilitates intelligent management that accounts for the relationship between storage capacity and performance capability. This allows the owner/operator of the storage equipment to use storage capacity at a desired (or requested) performance

Abstract translation: 可以根据对存储设备聚合的需求和对存储设备聚合上配置的逻辑存储容器的需求量化存储设备聚合的工作量。 以存储容量和性能能力的需求的方式计算存储设备的聚集需求和对其上的逻辑存储容器的需求。 捕获存储容量和性能能力的需求有助于实现存储容量和性能能力之间关系的智能管理。 这允许存储设备的所有者/操作者以期望的（或请求的）性能来使用存储容量

公开(公告)号：US20160070766A1

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

申请号：US14480151

申请日：2014-09-08

Applicant: NetApp, Inc.

Inventor： Atish Kathpal ,  Giridhar Appaji Nag Yasa

IPC: G06F17/30

CPC classification number: G06F17/30073

Abstract: A method, non-transitory computer readable medium, and archive node computing device that receives an indication of each of a plurality of archived files required to service a job from one of a plurality of compute node computing devices of an analytics tier. An optimized schedule for retrieving the archived files from one or more archive storage devices of an archive tier is generated. The optimized schedule is provided to the one of the plurality of compute node computing devices. Requests for the archived files received from the one of the plurality of compute node computing device and at least one other of the plurality of compute node computing devices, wherein the requests are sent according to the optimized schedule.

Abstract translation: 一种方法，非暂时性计算机可读介质和归档节点计算设备，其接收从分析层的多个计算节点计算设备之一服务作业所需的多个归档文件中的每一个的指示。 生成从归档层的一个或多个归档存储设备检索归档文件的优化计划。 将优化的调度提供给多个计算节点计算设备中的一个。 从多个计算节点计算设备中的一个计算设备和多个计算节点计算设备中的至少一个计算设备接收的归档文件的请求，其中根据优化的调度发送请求。

公开(公告)号：US20160070714A1

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

申请号：US14483012

申请日：2014-09-10

Applicant: NetApp, Inc.

Inventor： Janice D'Sa ,  Anshul Pundir ,  Srinath Krishnamachari ,  Ling Zheng

IPC: G06F17/30

CPC classification number: G06F16/1748 ,  G06F11/1471 ,  G06F16/2246

Abstract: A low-overhead merge technique enables restart of a merge operation with minimal logging of state information relating to progress of the merge operation by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The technique enables restart of the merge operation by ensuring that metadata, i.e., metadata pages, generated during the merge operation is not subject to de-duplication by providing a unique value in each metadata page that distinguishes the page, i.e., renders the page distinct or “unique”, from other metadata pages in an extent store. In addition, the technique ensures that a reference count on each metadata page is a value denoting a lack of de-duplication. To that end, the extent store layer is configured to not increment the reference count for a metadata page if, during the merge operation, the page is identical (and thus subject to deduplication) to an existing metadata page in the extent store.

Abstract translation: 低开销合并技术使得可以通过对在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层进行合并操作的进展的状态信息的最小记录来重新启动合并操作。 。 该技术通过确保在合并操作期间生成的元数据页面不受重复数据删除的影响，从而通过在每个元数据页面中提供唯一的值来区分页面，即，使页面不同 或“唯一”，从范围存储中的其他元数据页面。 此外，该技术确保每个元数据页面上的引用计数是表示缺少重复数据删除的值。 为此，如果在合并操作期间页面与扩展存储区中的现有元数据页面相同（因此遭受重复数据删除），则扩展区存储层被配置为不递增元数据页面的引用计数。

公开(公告)号：US20160070495A1

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

申请号：US14929018

申请日：2015-10-30

Applicant: NetApp, Inc.

Inventor： Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake H. Lewis ,  Rickard E. Faith

IPC: G06F3/06 ,  G06F12/02 ,  G06F12/12

CPC classification number: G06F3/0619 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0641 ,  G06F3/065 ,  G06F3/067 ,  G06F3/0689 ,  G06F11/00 ,  G06F11/2056 ,  G06F12/023 ,  G06F12/121 ,  G06F2211/1014 ,  G06F2212/1044 ,  G06F2212/401 ,  H04L67/1097

Abstract: A system and method for logically organizing compressed data. In one aspect, a destination storage server receives a write request that includes multiple data blocks and specifies corresponding file block numbers. An extent-based file system executing on the storage server accesses intermediate block entries that each associates one of the file block numbers with a respective extent block number. The file system, in cooperation with a compression engine, compresses the data blocks into a set of one or more compressed data blocks. The file system stores the compressed data blocks at physical locations corresponding to physical block numbers and allocates, within an extent map, pointers from an extent ID to the extent block numbers, and pointers from the extent ID to the physical block numbers.

Abstract translation: 一种用于逻辑组织压缩数据的系统和方法。 一方面，目的地存储服务器接收包含多个数据块的写请求，并指定相应的文件块号。 在存储服务器上执行的基于范围的文件系统访问中间块条目，每个条目将文件块号码之一与相应的扩展块号码相关联。 与压缩引擎协作的文件系统将数据块压缩成一组一个或多个压缩数据块。 文件系统将压缩数据块存储在对应于物理块号码的物理位置处，并且在盘区图中分配从盘区ID到块号码的指针，以及从盘区ID到物理块号的指针。

公开(公告)号：US20160070480A1

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

申请号：US14482863

申请日：2014-09-10

Applicant: NetApp, Inc.

Inventor： Sriranjani Babu ,  Janice D'Sa

IPC: G06F3/06

CPC classification number: G06F12/0253 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0619 ,  G06F3/0638 ,  G06F3/064 ,  G06F3/0641 ,  G06F3/0643 ,  G06F3/0665 ,  G06F3/0683 ,  G06F3/0688 ,  G06F3/0689 ,  G06F12/10 ,  G06F17/30327 ,  G06F2212/1044 ,  G06F2212/65

Abstract: A technique quantifies logical storage space trapped in an extent store due to overlapping write requests associated with volume metadata managed by the volume layer. The volume metadata is illustratively organized as a multi-level dense tree metadata structure, wherein each level of the dense tree metadata structure (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 a next lower level of the dense tree in accordance with a merge operation. Illustratively, the technique may be invoked during the merge operation to examine the volume metadata entries at each level of the dense tree involved in the merge and determine the LBA range overlap of the entries. To that end, the technique may include an algorithm configured to calculate the overlapping space per level and then aggregate the overlapping space of all levels involved in the merge operation to arrive at a result that quantifies the logical storage space trapped in the extent store.

Abstract translation: 由于与由卷层管理的卷元数据相关联的写入请求重叠，技术可以量化存储在存储区中的逻辑存储空间。 卷元数据被示意性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 当密集树的级别满时，根据合并操作，级别的卷元数据条目与密集树的下一个较低级别合并。 说明性地，可以在合并操作期间调用该技术来检查在合并中涉及的密集树的每个级别的卷元数据条目，并确定条目的LBA范围重叠。 为此，该技术可以包括被配置为计算每个级别的重叠空间并且然后聚合合并操作中涉及的所有级别的重叠空间的算法，以得到量化在范围存储中被捕获的逻辑存储空间的结果的算法。

公开(公告)号：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: 存储系统包括用于缓存数据块的高速缓存和用于存储块的存储装置。 存储操作系统可以基于重复数据删除要求对存储设备上的冗余块进行重复数据删除。 缓存中的块通常基于存储设备上的重复数据删除来重复数据删除。 不符合存储设备重复数据删除要求且尚未在存储设备和缓存中进行重复数据删除的冗余块的集合将针对进一步的重复数据消除处理。 可以根据高速缓存中的受欢迎程度（访问次数）进一步对冗余块进行重复数据删除。 如果高速缓存中的一组冗余块被确定为具有大于预定阈值访问次数的组合数量的访问，那么该冗余块被确定为“受欢迎”。选择流行的冗余块组用于重复数据删除 缓存和存储设备。

公开(公告)号：US20160065670A1

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

申请号：US14473621

申请日：2014-08-29

Applicant: NetApp, Inc.

Inventor： Jeffrey S. Kimmel ,  Susan M. Coatney ,  Yuedong Mu ,  Santosh Rao

IPC: H04L29/08

CPC classification number: H04L67/1095 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/067 ,  G06F17/30215 ,  H04L67/1097

Abstract: Data consistency and availability can be provided at the granularity of logical storage objects in storage solutions that use storage virtualization in clustered storage environments. To ensure consistency of data across different storage elements, synchronization is performed across the different storage elements. Changes to data are synchronized across storage elements in different clusters by propagating the changes from a primary logical storage object to a secondary logical storage object. To satisfy the strictest RPOs while maintaining performance, change requests are intercepted prior to being sent to a filesystem that hosts the primary logical storage object and propagated to a different managing storage element associated with the secondary logical storage object.

Abstract translation: 可以在集群存储环境中使用存储虚拟化的存储解决方案中的逻辑存储对象的粒度提供数据一致性和可用性。 为了确保不同存储元件之间的数据的一致性，跨不同存储元件执行同步。 通过将更改从主逻辑存储对象传播到辅助逻辑存储对象，对数据的更改在不同群集中的存储元素之间进行同步。 为了在维护性能的同时满足最严格的RPO，在发送到托管主逻辑存储对象的文件系统之前，更改请求将被拦截，并传播到与辅助逻辑存储对象关联的其他管理存储元素。