公开(公告)号：US20150205663A1

公开(公告)日：2015-07-23

申请号：US14157828

申请日：2014-01-17

Applicant: NetApp, Inc.

Inventor： Rajesh Sundaram ,  Bharat Baddepudi ,  Jeffrey S. Kimmel

IPC: G06F11/10

CPC classification number: G06F11/108 ,  G06F11/2033 ,  G06F11/2035 ,  G06F11/2094 ,  G06F2211/1028

Abstract: In one embodiment, a node of a cluster having a plurality of nodes, executes a storage input/output (I/O) stack having a redundant array of independent disks (RAID) layer. The RAID layer organizes solid state drives (SSDs) within one or more storage arrays as a plurality of RAID groups associated with one or more extent stores. The RAID groups are formed from slices of storage spaces of the SSDs instead of entire storage spaces of the SSDs. This provides for RAID groups to co-exist on a same set of the SSDs.

Abstract translation: 在一个实施例中，具有多个节点的集群的节点执行具有独立磁盘冗余阵列（RAID）层的存储输入/输出（I / O）堆栈。 RAID层将一个或多个存储阵列中的固态驱动器（SSD）组织为与一个或多个扩展存储区相关联的多个RAID组。 RAID组由SSD的存储空间片而不是SSD的整个存储空间形成。 这提供了RAID组在同一组SSD上共存。

公开(公告)号：US09087068B1

公开(公告)日：2015-07-21

申请号：US12414605

申请日：2009-03-30

Applicant: Mehul S. Shah ,  J. Eric Mowat ,  Szu-Wen Kuo

Inventor： Mehul S. Shah ,  J. Eric Mowat ,  Szu-Wen Kuo

IPC: G06F17/30

CPC classification number: G06F17/30153 ,  H04L67/1002 ,  H04L67/1014 ,  H04L67/1021 ,  H04L67/1038 ,  H04L67/18 ,  H04L67/2814 ,  H04L69/04 ,  H04W4/02 ,  Y10S707/99936 ,  Y10S707/99942

Abstract: Information representing a plurality of clients on a network is stored in a data structure. The data structure may be stored within a server or agent in a content delivery network and may include client network address information. The data structure is dynamically compressed based on network proximity information relating to the clients.

公开(公告)号：US20150201003A1

公开(公告)日：2015-07-16

申请号：US14155229

申请日：2014-01-14

Applicant: NetApp, Inc.

Inventor： Gary King

IPC: H04L29/08 ,  G06F17/22

CPC classification number: H04L67/10 ,  H04L67/02 ,  H04L67/34

Abstract: A client application is installed on a computing device. The client application is operable to implement a set of services for use with an enterprise network. The computing device accesses the enterprise network using the client application, and receives and processes script logic from the enterprise network. The script logic is executed through the client application to provide at least one of a user-interface or workflow for the set of services.

Abstract translation: 客户端应用程序安装在计算设备上。 客户端应用程序可操作以实现与企业网络一起使用的一组服务。 计算设备使用客户端应用访问企业网络，并从企业网络接收和处理脚本逻辑。 脚本逻辑通过客户端应用程序执行，以提供服务集合的用户界面或工作流中的至少一个。

公开(公告)号：US20150199354A1

公开(公告)日：2015-07-16

申请号：US14669400

申请日：2015-03-26

Applicant: NETAPP, INC.

Inventor： Richard Parvin Jernigan, IV ,  Robert Wyckoff Hyer, JR.

IPC: G06F17/30

CPC classification number: G06F17/3033 ,  G06F3/06 ,  G06F17/30097

Abstract: Machine implemented method and system for adding a directory entry to an existing directory data structure maintained by a storage system for storing a plurality of directory entries are provided. A first level storage block is used for storing a pointer to a first hash value from among a plurality of hash values. A new third level storage block is allocated when a second level storage block has reached a threshold level for storing pointers to hash values for the plurality of directory entries. A group of pointers including a pointer to a second hash value from among the plurality of hash values is selected. The group of pointers is stored in the third level storage block with a pointer to a third hash value from among the plurality of hash values such that the directory entry can be searched using the plurality of hash values.

Abstract translation: 提供了一种用于将目录条目添加到由用于存储多个目录条目的存储系统维护的现有目录数据结构的机器实现方法和系统。 第一级存储块用于从多个散列值中存储指向第一散列值的指针。 当第二级存储块已经达到用于存储多个目录条目的散列值的指针的阈值级别时，分配新的第三级存储块。 选择包括从多个哈希值中的第二哈希值的指针的指针组。 所述指针组被存储在所述第三级存储块中，其具有指向所述多个散列值中的第三散列值的指针，使得可以使用所述多个散列值来搜索所述目录条目。

公开(公告)号：US20150193156A1

公开(公告)日：2015-07-09

申请号：US14151443

申请日：2014-01-09

Applicant: NetApp, Inc.

Inventor： Kayuri H. Patel ,  Hari Shankar

IPC: G06F3/06

CPC classification number: G06F3/0619 ,  G06F3/065 ,  G06F3/0659 ,  G06F3/0688 ,  G06F11/1441 ,  G06F11/1471 ,  G06F12/0246 ,  G06F2211/1038

Abstract: In one embodiment, a node coupled to a plurality of solid state drives (SSDs) executes a storage input/output (I/O) stack having a plurality of layers. Write data associated with one or more write requests to the SSDs is stored in a volatile log. The write data is organized into one or more extents that are copied to the SSDs. The volatile log has a front-end and a set of records with metadata. The metadata includes a head offset referencing an initial record and a tail offset referencing a final record. A portion of the one or more write requests including the write data is copied to a non-volatile log maintained in a non-volatile random access memory (NVRAM). The front-end and the set of records from the volatile log are copied, but the head offset and the tail offset are not, to reduce an amount of metadata copied to the NVRAM.

Abstract translation: 在一个实施例中，耦合到多个固态驱动器（SSD）的节点执行具有多个层的存储输入/输出（I / O）堆栈。 将与一个或多个写请求相关联的数据写入SSD被存储在易失性日志中。 写入数据被组织成一个或多个被复制到SSD的盘区。 易失性日志具有前端和一组具有元数据的记录。 元数据包括引用初始记录的头部偏移和引用最终记录的尾部偏移。 包括写入数据的一个或多个写请求的一部分被复制到维护在非易失性随机存取存储器（NVRAM）中的非易失性日志。 来自易失性日志的前端和一组记录被复制，但是头偏移和尾部偏移量不是，以减少复制到NVRAM的元数据量。

公开(公告)号：US09069710B1

公开(公告)日：2015-06-30

申请号：US13433157

申请日：2012-03-28

Applicant: Kiran K. Modukuri ,  Logan R. Jennings

Inventor： Kiran K. Modukuri ,  Logan R. Jennings

IPC: G06F11/14 ,  G06F11/20

CPC classification number: G06F11/1456 ,  G06F3/06 ,  G06F11/2051 ,  G06F11/2071 ,  G06F11/2074 ,  G06F11/2082 ,  G06F11/2094 ,  G06F11/2097 ,  G06F2201/84

Abstract: Machine implemented method for generating and accessing a point in time copy of an expandable storage volume in a network storage system is provided. The expandable storage volume includes a namespace for storing information for accessing data objects stored at a plurality of data constituent volumes managed by a plurality of nodes of the storage system. The method includes initiating a logical fence first for the namespace and then for the data constituent volumes for generating the point in time copy of the expandable storage volume. The logical fence filters out any information written after the fence is initiated from the point in time copy of the expandable storage volume.

Abstract translation: 提供了一种用于生成和访问网络存储系统中的可扩展存储卷的时间点副本的机器实现方法。 可扩展存储卷包括用于存储用于访问由存储系统的多个节点管理的多个数据构成卷存储的数据对象的信息的命名空间。 该方法包括首先为命名空间启动逻辑围栏，然后为数据组成卷启动可扩展存储卷的时间点副本。 逻辑围栏过滤出从可扩展存储卷的时间点复制之后的栅栏启动后写入的任何信息。

公开(公告)号：US09069680B2

公开(公告)日：2015-06-30

申请号：US13963875

申请日：2013-08-09

Applicant: NetApp, Inc.

Inventor： Gokul Soundararajan ,  Lakshmi Narayanan Bairavasundaram ,  Vipul Mathur

IPC: G06F12/08

CPC classification number: G06F12/0873 ,  G06F11/34 ,  G06F11/3442 ,  G06F12/0811 ,  G06F12/0871 ,  G06F12/0897 ,  G06F2201/88 ,  G06F2201/885 ,  G06F2212/1048 ,  G06F2212/601

Abstract: Technology for operating a cache sizing system is disclosed. In various embodiments, the technology monitors input/output (IO) accesses to a storage system within a monitor period; tracks an access map for storage addresses within the storage system during the monitor period; and counts a particular access condition of the IO accesses based on the access map during the monitor period. When sizing a cache of the storage system that enables the storage system to provide a specified level of service, the counting is for computing a working set size (WSS) estimate of the storage system.

Abstract translation: 公开了用于操作缓存大小调整系统的技术。 在各种实施例中，技术监视在监视周期内对存储系统的输入/输出（IO）访问; 在监视期间跟踪存储系统内存储地址的访问地图; 并在监视期间根据访问映射计算IO访问的特定访问条件。 当确定使存储系统能够提供指定级别的服务的存储系统的高速缓存时，计数用于计算存储系统的工作集大小（WSS）估计。

公开(公告)号：US20150169625A1

公开(公告)日：2015-06-18

申请号：US14524033

申请日：2014-10-27

Applicant: NETAPP, INC.

Inventor： David Slik ,  Oliver Seiler ,  Pey Silvester

IPC: G06F17/30

CPC classification number: G06F17/30215 ,  G06F17/30082 ,  G06F17/30584

Abstract: A system and method for specifying the placement of and managing the placement of objects on a distributed networked grid. Some embodiments of the invention comprise a user interface for specifying rules for the placement of objects on the grid and an execution module that places objects on the grid based on the rules specified. Rules may comprise a matching criteria specification, which determines whether a rule applies to a particular object, and a placement specification, which directs the locations at which an object will be placed under the rule.

Abstract translation: 一种用于指定分布式网络上的对象的放置和管理布局的系统和方法。 本发明的一些实施例包括用于指定用于在网格上放置对象的规则的用户界面以及基于规定的规则将对象放置在网格上的执行模块。 规则可以包括匹配标准规范，其确定规则是否适用于特定对象，以及指定将被放置在规则下的对象的位置的布局规范。

公开(公告)号：US20150169415A1

公开(公告)日：2015-06-18

申请号：US14526975

申请日：2014-10-29

Applicant: NETAPP, INC.

Inventor： John Hildebrand ,  Geoffrey Stewart Brown ,  Nathan Baker ,  John Meneghini ,  Frederick Knight ,  Santosh Rao

IPC: G06F11/20

CPC classification number: G06F3/0644 ,  G06F3/0604 ,  G06F3/0617 ,  G06F3/0635 ,  G06F3/067 ,  G06F11/1425 ,  G06F11/201 ,  G06F11/2089 ,  G06F11/2094

Abstract: Techniques to managing non-disruptive SAN availability in a partitioned cluster comprising one or more components configured to determine whether to separate a cluster into two or more partitions, notify one or more responsive cluster nodes to separate the cluster into a first partition and a second partition, update one or more access states, notify the host that access states of one or more network paths has been updated, and provide the one or more access states. Other embodiments are described and claimed.

Abstract translation: 在分区集群中管理非破坏性SAN可用性的技术，包括被配置为确定是否将集群分离成两个或更多个分区的一个或多个组件，通知一个或多个响应群集节点将所述集群分离成第一分区和第二分区 更新一个或多个访问状态，通知主机访问一个或多个网络路径的状态已被更新，并提供一个或多个访问状态。 描述和要求保护其他实施例。

公开(公告)号：US20150149416A1

公开(公告)日：2015-05-28

申请号：US14088196

申请日：2013-11-22

Applicant: NETAPP, INC.

Inventor： Poonam DHAVALE ,  Manish Bhuwania ,  Arun Ramachandran ,  Herman M. Mutiso

IPC: G06F17/30

CPC classification number: G06F17/30348

Abstract: A system and method of negotiated takeover of storage objects includes one or more processors, a storage controller, and memory coupled to the one or more processors. The memory stores a data structure that includes information about a plurality of storage objects manageable by the storage controller. The storage controller is configured to assume, one by one, current ownership of a first subset of the storage objects and assume, concurrently, current ownership of a second subset of the storage objects. The first subset of storage objects and the second subset of storage objects are currently owned by a second storage server coupled to the storage server. In some embodiments, current ownership of the first subset of storage objects is transferred by iteratively detecting a particular storage object from the first subset of the storage objects whose current ownership can be assumed and bringing the particular storage object online.

Abstract translation: 协商接管存储对象的系统和方法包括耦合到一个或多个处理器的一个或多个处理器，存储控制器和存储器。 存储器存储包括关于由存储控制器可管理的多个存储对象的信息的数据结构。 存储控制器被配置为逐个地假设存储对象的第一子集的当前所有权并同时假设存储对象的第二子集的当前所有权。 存储对象的第一子集和存储对象的第二子集目前由耦合到存储服务器的第二存储服务器所拥有。 在一些实施例中，存储对象的第一子集的当前所有权通过迭代地从存储对象的第一子集迭代地检测特定存储对象来传送，该存储对象的当前所有权可以被假设并且使特定存储对象在线。