公开(公告)号：WO2012173858A2

公开(公告)日：2012-12-20

申请号：PCT/US2012041297

申请日：2012-06-07

Applicant: NETAPP INC ,  YASA GIRIDHAR APPAJI NAG ,  CHANDRASEKARASASTRY NAGESH PANYAM

Inventor： YASA GIRIDHAR APPAJI NAG ,  CHANDRASEKARASASTRY NAGESH PANYAM

IPC: G06F12/00 ,  G06F15/16

CPC classification number: G06F17/30156

Abstract: The technique introduced here includes a system and method for identifying and mapping duplicate data objects referenced by data objects. The technique illustratively utilizes a hierarchical tree of fingerprints for each data object to compare the data objects and identify duplicate data blocks referenced by the data objects. A progressive comparison of the hierarchical trees starts from a top layer of the hierarchical trees and proceeds toward a base layer. Between the compared data objects (i.e., the compared hierarchical trees), the technique maps matching fingerprints only at the top-most layer of the hierarchical trees at which the fingerprints match. Lower layer matching fingerprints are neither compared nor mapped. Data blocks corresponding to the matching fingerprints are then deleted. Such an identification and mapping technique substantially reduces the amount of mapping metadata stored in data objects that have been subject to deduplication.

Abstract translation: 这里介绍的技术包括用于识别和映射数据对象引用的重复数据对象的系统和方法。 该技术说明性地利用每个数据对象的指纹分层树来比较数据对象并识别由数据对象引用的重复数据块。 层次树的渐进比较从分层树的顶层开始，并朝向基本层进行。 在比较的数据对象（即，比较的分层树）之间，技术仅在指纹匹配的分层树的最顶层映射匹配指纹。 下层匹配指纹既不比较也不映射。 然后删除与匹配指纹对应的数据块。 这样的识别和映射技术大大减少了存储在已经重复数据删除的数据对象中的映射元数据量。

公开(公告)号：WO2012061255A3

公开(公告)日：2012-07-19

申请号：PCT/US2011058464

申请日：2011-10-28

Applicant: NETAPP INC ,  THAKUR NEELESH ,  PARTHASARATHI KUMAR ,  BAPPANADU VANI ,  LOLAYEKAR SANTOSH ,  PALAIAH BALAMURALI ,  TETERIN BORIS

Inventor： THAKUR NEELESH ,  PARTHASARATHI KUMAR ,  BAPPANADU VANI ,  LOLAYEKAR SANTOSH ,  PALAIAH BALAMURALI ,  TETERIN BORIS

IPC: G06F12/00 ,  G06F9/44

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

公开(公告)号：WO2012092267A2

公开(公告)日：2012-07-05

申请号：PCT/US2011/067378

申请日：2011-12-27

Applicant: NETAPP, INC. ,  SHANKAR, Hari ,  LIU, Huadong ,  LI, Hua

Inventor： SHANKAR, Hari ,  LIU, Huadong ,  LI, Hua

IPC: G06F11/34

CPC classification number: H04L41/0654 ,  G06F11/2028 ,  G06F11/2038 ,  G06F11/2046 ,  G06F11/2097

Abstract: A novel RDMA connection failover technique that minimizes disruption to upper subsystem modules (executed on a computer node), which create requests for data transfer. A new failover virtual layer performs failover of an RDMA connection in error so that the upper subsystem that created a request does not have knowledge of an error (which is recoverable in software and hardware), or of a failure on the RDMA connection due to the error. Since the upper subsystem does not have knowledge of a failure on the RDMA connection or of a performed failover of the RDMA connection, the upper subsystem continues providing requests to the failover virtual layer without interruption, thereby minimizing downtime of the data transfer activity.

Abstract translation: 一种新颖的RDMA连接故障切换技术，可最大限度地减少上层子系统模块（在计算机节点上执行）的干扰，从而创建数据传输请求。 新的故障转移虚拟层错误地执行RDMA连接的故障转移，以便创建请求的上级子系统不知道错误（可在软件和硬件中恢复）或RDMA连接发生故障，因为 错误。 由于上级子系统不知道RDMA连接上的故障或RDMA连接的已执行故障转移，上级子系统会继续向故障转移虚拟层提供请求，而不会中断，从而最大限度地减少数据传输活动的停机时间。

公开(公告)号：WO2012083085A1

公开(公告)日：2012-06-21

申请号：PCT/US2011/065292

申请日：2011-12-15

Applicant: NETAPP, INC. ,  SHARMA, Alok ,  KILLAMSETTI, Praveen ,  SINGH, Satbir

Inventor： SHARMA, Alok ,  KILLAMSETTI, Praveen ,  SINGH, Satbir

IPC: G06F17/30

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0683 ,  G06F17/3015

Abstract: A storage server is coupled to a storage device that stores blocks of data, and generates a fingerprint for each data block stored on the storage device. The storage server creates a fingerprints datastore that is divided into a primary datastore and a secondary datastore. The primary datastore comprises a single entry for each unique fingerprint and the secondary datastore comprises an entry having an identical fingerprint as an entry in the primary datastore. The storage server merges entries in a changelog with the entries in the primary datastore to identify duplicate data blocks in the storage device and frees the identified duplicate data blocks in the storage device. The storage server stores the entries that correspond to the freed data blocks to a third datastore and overwrites the primary datastore with the entries from the merged data that correspond to the unique fingerprints to create an updated primary datastore.

Abstract translation: 存储服务器耦合到存储数据块的存储设备，并且为存储在存储设备上的每个数据块生成指纹。 存储服务器创建一个指纹数据存储区，分为主数据存储和辅助数据存储。 主数据存储区包括每个唯一指纹的单个条目，辅助数据存储区包括具有与主数据存储区中的条目相同的指纹的条目。 存储服务器将更改日志中的条目与主数据存储中的条目合并，以识别存储设备中的重复数据块，并释放存储设备中标识的重复数据块。 存储服务器将与释放的数据块对应的条目存储到第三个数据存储，并使用与唯一指纹对应的合并数据中的条目覆盖主数据存储，以创建更新的主数据存储。

公开(公告)号：WO2012058151A1

公开(公告)日：2012-05-03

申请号：PCT/US2011/057481

申请日：2011-10-24

Applicant: NETAPP, INC. ,  HANSEN, Robert ,  ASTER, Radek ,  EMAMI, Tim, K.

Inventor： HANSEN, Robert ,  ASTER, Radek ,  EMAMI, Tim, K.

IPC: G06F3/06 ,  G06F13/42

CPC classification number: G06F3/0646 ,  G06F3/0604 ,  G06F3/0626 ,  G06F3/0635 ,  G06F3/0658 ,  G06F3/067 ,  G06F3/0689

Abstract: One or more techniques and/or systems are disclosed for enabling communication between a SAS communication port of a SAS communication component and multiple storage devices. In a first example, a first SAS to SATA bridge chip and a second SAS to SATA bridge chip may be configured to route data from a SAS communication component to multiple storage devices. In a second example, a SAS to SATA bridge chip and a port multiplier may be configured to route data from a SAS communication component to multiple storage devices. In a third example, a four port SAS to SATA bridge comprising two SAS ports and two SATA ports may be configured to route data from a SAS communication component to multiple storage devices. Supporting two or more storage devices with a single SAS communication port allows storage enclosures to increase storage capacity, while decreasing cost per slot.

Abstract translation: 公开了一种或多种技术和/或系统，用于实现SAS通信组件的SAS通信端口与多个存储设备之间的通信。 在第一示例中，第一SAS至SATA桥芯片和第二SAS至SATA桥接芯片可以被配置为将数据从SAS通信组件路由到多个存储设备。 在第二个例子中，SAS到SATA桥芯片和端口倍增器可以被配置为将数据从SAS通信组件路由到多个存储设备。 在第三个例子中，可以将包括两个SAS端口和两个SATA端口的四端口SAS至SATA桥接器配置为将数据从SAS通信组件路由到多个存储设备。 使用单个SAS通信端口支持两个或多个存储设备允许存储机柜增加存储容量，同时降低每个插槽的成本。

公开(公告)号：WO2012009501A1

公开(公告)日：2012-01-19

申请号：PCT/US2011/043947

申请日：2011-07-14

Applicant: NETAPP, INC. ,  WEBER, Bret ,  NOSSOKOFF, Mark ,  PEMBLE, Bret

Inventor： WEBER, Bret ,  NOSSOKOFF, Mark ,  PEMBLE, Bret

IPC: G06F3/06 ,  H04L29/08

CPC classification number: G06F3/0631 ,  G06F3/0607 ,  G06F3/067

Abstract: The present invention is directed to an architecture for promoting improved cloud computing. The architecture includes a plurality of diskless server nodes. The architecture further includes a plurality of Serial Attached Small Computer System Interface (SAS) switches, the plurality of SAS switches being connected to the plurality of diskless server nodes. The architecture further includes a storage system, the storage system configured for being communicatively coupled to the plurality of servers via the plurality of SAS switches. Further, the storage system is configured for implementing Controlled Replication Under Scalable Hashing (CRUSH) redundancy. Still further, the architecture is configured for dynamically mapping data stores of the storage system to the diskless server nodes.

Abstract translation: 本发明涉及用于促进改进的云计算的架构。 该架构包括多个无盘服务器节点。 该架构还包括多个串行连接小型计算机系统接口（SAS）交换机，多个SAS交换机连接到多个无盘服务器节点。 所述架构还包括存储系统，所述存储系统被配置为经由所述多个SAS交换机通信地耦合到所述多个服务器。 此外，存储系统被配置为实现可扩展哈希（CRUSH）冗余下的受控复制。 此外，该架构被配置为将存储系统的数据存储器动态地映射到无盘服务器节点。

公开(公告)号：WO2010127092A3

公开(公告)日：2010-11-04

申请号：PCT/US2010/032938

申请日：2010-04-29

Applicant: NETAPP, INC. ,  RABII, Faramarz ,  STRUNK, John ,  KIMMEL, Jeffrey, S.

Inventor： RABII, Faramarz ,  STRUNK, John ,  KIMMEL, Jeffrey, S.

IPC: G06F15/16 ,  G06F3/06 ,  G06F12/06 ,  G06F12/08

Abstract: At least certain embodiments disclose a method, system and apparatus for relocating data between tiers of storage media in a hybrid storage aggregate encompassing multiple tiers of heterogeneous physical storage media including a file system to automatically relocate the data between tiers. The hybrid storage aggregate includes one or more volumes, each volume including a volume block number space spanning at least a first-tier of storage media and a second tier of storage media of the multiple tiers of heterogeneous physical storage media and the hybrid storage aggregate further includes a control module to cooperatively manage the tiers of the multiple tiers of heterogeneous physical storage media and a file system coupled with the control module, the file system including a policy module configured to make policy decisions based on a set of one or more policies and configured to automatically relocate data between different tiers of the multiple tiers of heterogeneous physical storage media based on the set of policies.

公开(公告)号：WO2010077972A3

公开(公告)日：2010-10-28

申请号：PCT/US2009068300

申请日：2009-12-16

Applicant: NETAPP INC ,  MUNTZ DANIEL ALAN

Inventor： MUNTZ DANIEL ALAN

IPC: G06F15/16 ,  G06F12/08

CPC classification number: H04L67/1097 ,  G06F17/30132 ,  G06F17/30224 ,  H04L67/2842 ,  H04L67/2885

Abstract: A method implements a hierarchical cache system with a parallel Network File System (pNFS) configuration for a storage system. Upon receiving a request by the hierarchical cache system to access data stored in the storage system, the method divides the data into a plurality of data segments and distributes the plurality of data segments to a plurality of cache servers of the cache system. The method responds to the request a metadata layout for the plurality of data segments distributed among the plurality of cache servers. Based on the metadata layout, the plurality of data segments can be concurrently retrieved from the plurality of cache servers.

Abstract translation: 一种方法实现了具有用于存储系统的并行网络文件系统（pNFS）配置的分级高速缓存系统。 一旦接收到分级高速缓存系统访问存储在存储系统中的数据的请求，该方法将数据划分为多个数据段并将多个数据段分配给高速缓存系统的多个高速缓存服务器。 该方法响应该请求，分配在多个缓存服务器中分布的多个数据段的元数据布局。 基于元数据布局，可以从多个高速缓存服务器中同时检索多个数据段。

公开(公告)号：WO2010042627A3

公开(公告)日：2010-08-12

申请号：PCT/US2009059853

申请日：2009-10-07

Applicant: NETAPP INC ,  RAMA HARISH KUMAR SAMPANGI ,  PALSULE ANURAG ,  PONNAPUR ANIL KUMAR

Inventor： RAMA HARISH KUMAR SAMPANGI ,  PALSULE ANURAG ,  PONNAPUR ANIL KUMAR

IPC: G06F15/16 ,  G06F9/06

CPC classification number: G06F9/4843 ,  G06F9/5011 ,  G06F2209/504 ,  Y02D10/22

Abstract: A network storage server implements a method to limit simultaneous data transfers and efficient throttle management. The number of processes that can be simultaneously performed in the network storage server is limited. For the processes that do not exceed the limiting number, and are therefore allowed to be simultaneously performed, a throttle control is implemented on each of the processes to limit the amount of system resources that can be allocated to each of the processes. The processes are performed on the network storage server, and a total amount of system resources allocated to these processes does not exceed the available system resources of the network storage server.

Abstract translation: 网络存储服务器实现一种方法来限制同时进行的数据传输和有效的节流管理。 可以在网络存储服务器中同时执行的进程数量有限。 对于不超过限制数量并因此允许同时执行的处理，在每个进程上实施节流控制，以限制可以分配给每个进程的系统资源的数量。 这些进程在网络存储服务器上执行，并且分配给这些进程的系统资源的总量不超过网络存储服务器的可用系统资源。

公开(公告)号：WO2010040078A3

公开(公告)日：2010-06-10

申请号：PCT/US2009059416

申请日：2009-10-02

Applicant: NETAPP INC ,  PERIYAGARAM SUBRAMANIAN ,  KHONA RAHUL ,  PAWAR DNYANESHWAR ,  YADAV SANDEEP

Inventor： PERIYAGARAM SUBRAMANIAN ,  KHONA RAHUL ,  PAWAR DNYANESHWAR ,  YADAV SANDEEP

IPC: G06F21/00 ,  G06F3/06 ,  G06F12/00 ,  G06F15/16 ,  H04L12/56

CPC classification number: G06F17/30159 ,  G06F3/061 ,  G06F3/0641 ,  G06F3/067 ,  G06F11/1453 ,  G06F17/30203 ,  H04L67/1097 ,  H04L67/2842

Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple "chunks", where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.

Abstract translation: 用于组织数据以便于重复数据删除的技术包括将基于块的数据集划分成多个“块”，其中块边界独立于块边界（由于散列算法）。 数据集的元数据（例如用于定位数据的块指针）被存储在包括多个级别的树结构中，每个级别包括至少一个节点。 树的最低级别包括多个节点，每个节点包含与数据集块大小相关的块元数据。 在缓冲树的最低级别的每个节点中，其中包含的块元数据标识至少一个块。 块（用户级数据）存储在与缓冲树分开的一个或多个系统文件中，并且对用户不可见。