公开(公告)号：US20150095346A1

公开(公告)日：2015-04-02

申请号：US14044624

申请日：2013-10-02

Applicant: NetApp, Inc.

Inventor： Jeffrey S. Kimmel ,  Blake H. Lewis

IPC: G06F17/30

CPC classification number: G06F17/3033 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/067 ,  G06F17/30097 ,  G06F17/30949

Abstract: In one embodiment, a technique is provided for distributing data and associated metadata within a distributed storage architecture. A set of hash tables that embody mappings of cluster-wide identifiers associated with storage locations are stored for write data of write requests organized into extents. A hash value is generated from a hash function applied to each extent. The hash value is overloaded and used for multiple purposes within the distributed storage architecture, including (i) a remainder computation on the hash value to select a bucket of a plurality of buckets representative of the extents, (ii) a hash table selector of the hash value to select a hash table from the set of hash tables, and (iii) a hash table index computed from the hash value to select an entry from a plurality of entries of the selected hash table having a cluster-wide identifier identifying a storage location for the extent.

Abstract translation: 在一个实施例中，提供了用于在分布式存储架构内分发数据和相关元数据的技术。 存储与存储位置相关联的集群范围标识符的映射的一组哈希表，用于组织到扩展区中的写入请求的写入数据。 从应用于每个区段的散列函数生成哈希值。 散列值被重载并用于分布式存储体系结构中的多个目的，包括（i）散列值的余数计算，以选择代表范围的多个存储桶的桶，（ii）哈希表选择器 散列值以从所述散列表集合中选择散列表，以及（iii）根据所述散列值计算的散列表索引，以从所述选定的散列表的多个条目中选择具有标识存储器的集群范围标识符的条目 位置的程度。

公开(公告)号：US20140337565A1

公开(公告)日：2014-11-13

申请号：US14341541

申请日：2014-07-25

Applicant: NetApp, Inc.

Inventor： Jeffrey S. Kimmel

IPC: G06F3/06

CPC classification number: G06F3/065 ,  G06F3/0614 ,  G06F3/0619 ,  G06F3/0626 ,  G06F3/0655 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0679 ,  G06F3/0685 ,  G06F3/0689 ,  G06F12/00 ,  G06F2206/1014

Abstract: A storage server receives a write request from a client system including new data and a location to store the new data. The storage server transmits a copy instruction to a storage subsystem to relocate old data at the location and transmits a write instruction to the storage subsystem to overwrite the old data with the new data. The storage subsystem includes fast stable storage in which the copy instruction and the write instruction are stored. After receiving each instruction, the storage subsystem sends an acknowledgement to the storage server. When both instructions have been acknowledged, the storage server sends an acknowledgement to the client system. The storage subsystem performs the instructions asynchronously from the client system's write request.

Abstract translation: 存储服务器从包括新数据和存储新数据的位置的客户端系统接收写入请求。 存储服务器将复制指令发送到存储子系统以重新定位该位置处的旧数据，并向存储子系统发送写指令以用新数据覆盖旧数据。 存储子系统包括存储复制指令和写指令的快速稳定存储。 收到每条指令后，存储子系统向存储服务器发送确认。 当两个指令都被确认时，存储服务器向客户端系统发送确认。 存储子系统从客户端系统的写请求异步执行指令。

公开(公告)号：US20140181377A1

公开(公告)日：2014-06-26

申请号：US14087557

申请日：2013-11-22

Applicant: NetApp, Inc.

Inventor： Jeffrey S. Kimmel ,  Randy Pafford ,  Rajesh S. Sundaram

IPC: G06F12/12 ,  G06F12/02

CPC classification number: G06F12/12 ,  G06F12/0246 ,  G06F2212/222 ,  G06F2212/7211

Abstract: Described is a technique for managing the content of a nonvolatile solid-state memory data cache to improve cache performance while at the same time, and in a complementary manner, providing for automatic wear leveling. A modified circular first-in first-out (FIFO) log/algorithm is generally used to determine cache content replacement. The algorithm is used as the default mechanism for determining cache content to be replaced when the cache is full but is subject to modification in some instances. In particular, data are categorized according to different data classes prior to being written to the cache, based on usage. Once cached, data belonging to certain classes are treated differently than the circular FIFO replacement algorithm would dictate. Further, data belonging to each class are localized to designated regions within the cache.

Abstract translation: 描述了一种用于管理非易失性固态存储器数据高速缓存的内容以提高高速缓存性能的技术，同时以互补的方式提供自动磨损均衡。 修改的循环先进先出（FIFO）日志/算法通常用于确定高速缓存内容替换。 该算法用作在高速缓存已满的情况下确定要替换的缓存内容的默认机制，但在某些情况下可能会进行修改。 特别地，根据使用情况，在写入缓存之前，根据不同的数据类对数据进行分类。 一旦缓存，属于某些类的数据的处理方式与循环FIFO替换算法将会有所不同。 此外，属于每个类的数据被定位到高速缓存内的指定区域。

公开(公告)号：US20140149515A1

公开(公告)日：2014-05-29

申请号：US14101078

申请日：2013-12-09

Applicant: NetApp, Inc.

Inventor： David Grunwald ,  Jeffrey S. Kimmel

IPC: H04L29/08

CPC classification number: H04L67/1087 ,  G06F9/5011 ,  G06F9/526 ,  G06F17/30224 ,  G06F2209/506

Abstract: A technique is described for improving throughput in a processing system, such as a network storage server. The technique provides multiple levels (e.g., a hierarchy) of parallelism of process execution within a single mutual exclusion domain, in a manner which allows certain operations on metadata to be parallelized as well as certain operations on user data. The specific parallelization scheme used in any given embodiment is based at least partly on the underlying metadata structures used by the processing system. Consequently, a high degree of parallelization possible, which improves the throughput of the processing system.

Abstract translation: 描述了一种用于提高诸如网络存储服务器的处理系统中的吞吐量的技术。 该技术以允许对元数据进行某些操作并行化以及对用户数据的某些操作的方式在单个互斥域内提供过程执行的并行性的多个级别（例如，层级）。 在任何给定实施例中使用的特定并行化方案至少部分地基于处理系统使用的底层元数据结构。 因此，可以进行高度并行化，这提高了处理系统的吞吐量。

公开(公告)号：US20130346810A1

公开(公告)日：2013-12-26

申请号：US13918428

申请日：2013-06-14

Applicant: NetApp. Inc.

Inventor： Jeffrey S. Kimmel ,  Sunitha S. Sankar ,  Rajesh Sundaram ,  Nitin Muppalaneni ,  Emily W. Eng ,  Eric C. Hamilton

IPC: G06F11/07

CPC classification number: G06F11/073 ,  G06F11/1076 ,  G06F2211/1007 ,  G06F2211/104

Abstract: A storage system, such as a file server, receives a request to perform a write operation that affects a data block. In response, the storage system writes to a storage device the data block together with context information which uniquely identifies the write operation with respect to the data block. When the data block is subsequently read from the storage device together with the context information, the context information that was read with the data block is used to determine whether a previous write of the data block was lost.

Abstract translation: 诸如文件服务器的存储系统接收到执行影响数据块的写入操作的请求。 作为响应，存储系统与数据块一起写入存储设备以及唯一地标识关于数据块的写入操作的上下文信息。 当数据块随后与上下文信息一起从存储设备读取时，使用数据块读取的上下文信息用于确定数据块的先前写入是否丢失。