公开(公告)号：WO2018005041A1

公开(公告)日：2018-01-04

申请号：PCT/US2017/036680

申请日：2017-06-09

Applicant: NETAPP INC.

Inventor： DRONAMRAJU, Ravikanth ,  GUPTA, Shivali ,  STERLING, Kyle ,  GOEL, Atul

IPC: G06F12/02

Abstract: A method, non-transitory computer readable medium, and device that assists with reducing memory fragmentation in solid state devices includes identifying an allocation area within an address range to write data from a cache. Next, the identified allocation area is determined for including previously stored data. The previously stored data is read from the identified allocation area when it is determined that the identified allocation area comprises previously stored data. Next, both the write data from the cache and the read previously stored data are written back into the identified allocation area sequentially through the address range.

Abstract translation: 帮助减少固态设备中的存储器碎片的方法，非暂时性计算机可读介质和设备包括识别地址范围内的分配区域以从高速缓存写入数据。 接下来，所确定的分配区域被确定为包括先前存储的数据。 当确定所识别的分配区域包括先前存储的数据时，从识别的分配区域读取先前存储的数据。 接下来，来自高速缓存的写入数据和先前存储的读取数据都通过地址范围顺序写回到所标识的分配区域中。

公开(公告)号：WO2015013144A1

公开(公告)日：2015-01-29

申请号：PCT/US2014/047299

申请日：2014-07-18

Applicant: NETAPP, INC.

Inventor： MILLS, Todd ,  URKUDE, Suhas ,  STERLING, Kyle ,  GOEL, Atul

IPC: G06F11/07 ,  G06F13/14

CPC classification number: G06F11/079 ,  G06F11/0727 ,  G06F11/0751 ,  G06F11/0793 ,  G06F11/2094 ,  G06F2201/805

Abstract: The disclosed embodiments relate to systems and methods for coordinating management of a shared disk storage between nodes. Particularly, a messaging protocol may be used to communicate notifications regarding each node's perception of the shared storage's state. The nodes may use the messaging protocol to achieve consensus when recovering from a storage device failure. Some embodiments provide for recovery when localized failures, such as failures at an adapter on a node, occur.

Abstract translation: 所公开的实施例涉及用于协调节点之间的共享磁盘存储的管理的系统和方法。 特别地，可以使用消息传递协议来传达关于每个节点对共享存储器的状态的感知的通知。 当从存储设备故障恢复时，节点可以使用消息传递协议来达成一致。 当发生局部化故障（例如节点上的适配器的故障）时，一些实施例提供恢复。

公开(公告)号：WO2011037629A1

公开(公告)日：2011-03-31

申请号：PCT/US2010/002600

申请日：2010-09-23

Applicant: NETAPP, INC. ,  GOEL, Atul ,  CORBETT, Peter, F.

Inventor： GOEL, Atul ,  CORBETT, Peter, F.

IPC: G06F11/10

CPC classification number: G06F11/1076

Abstract: An n-way parity protection technique enables recovery of up to n storage device (e.g., disk) failures in a parity group of a storage array encoded to protect against n-way disk failures. The storage array is created by first configuring the array with m data disks, where m=p-l and p is a prime number and a row parity disk, n-1 diagonal parity disks are then added to the array. Each diagonal parity set (i.e., diagonal) is associated with a slope that defines the data and row parity blocks of the array that are included in the diagonal. All diagonals having a common slope within a parity group are organized as a diagonal parity class. For each diagonal parity class, a diagonal parity storage disk is provided to store the diagonal parity.

Abstract translation: n路奇偶校验保护技术使得能够恢复存储阵列的奇偶校验组中的多达n个存储设备（例如，磁盘）故障，其被编码以防止n路盘故障。 存储阵列是通过首先使用m个数据磁盘配置阵列来创建的，其中m = p-1，p是素数和行奇偶校验磁盘，然后将n-1个对角线奇偶校验磁盘添加到阵列中。 每个对角奇偶校验集（即对角线）与定义包括在对角线中的阵列的数据和行奇偶校验块的斜率相关联。 在奇偶校验组内具有公共斜率的所有对角线被组织为对角奇偶校验类。 对于每个对角奇偶校验类，提供对角奇偶校验存储盘以存储对角奇偶校验。

公开(公告)号：EP2470992B1

公开(公告)日：2016-04-13

申请号：EP10769094.3

申请日：2010-09-23

Applicant: NetApp, Inc.

Inventor： GOEL, Atul ,  CORBETT, Peter, F.

IPC: G06F11/10

CPC classification number: G06F11/1076

公开(公告)号：EP2470992A1

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

申请号：EP10769094.3

申请日：2010-09-23

Applicant: Netapp, Inc.

Inventor： GOEL, Atul ,  CORBETT, Peter, F.

IPC: G06F11/10

CPC classification number: G06F11/1076

Abstract: An n-way parity protection technique enables recovery of up to n storage device (e.g., disk) failures in a parity group of a storage array encoded to protect against n-way disk failures. The storage array is created by first configuring the array with m data disks, where m=p-l and p is a prime number and a row parity disk, n-1 diagonal parity disks are then added to the array. Each diagonal parity set (i.e., diagonal) is associated with a slope that defines the data and row parity blocks of the array that are included in the diagonal. All diagonals having a common slope within a parity group are organized as a diagonal parity class. For each diagonal parity class, a diagonal parity storage disk is provided to store the diagonal parity.