公开(公告)号：US20140201168A1

公开(公告)日：2014-07-17

申请号：US14087345

申请日：2013-11-22

Applicant: NetApp, Inc.

Inventor： Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake Lewis ,  Rickard E. Faith ,  Ashish Prakash ,  Ram Kesavan ,  Ananthan Subramanian

IPC: G06F17/30

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

Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

Abstract translation: 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。

公开(公告)号：US20140172928A1

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

申请号：US13968117

申请日：2013-08-15

Applicant: NetApp. Inc.

Inventor： Richard E. Faith ,  Subramaniam Perivagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis ,  Jeff Kimmel ,  Steve Daniel

IPC: G06F3/06 ,  G06F17/30

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30203

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.

Abstract translation: 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

公开(公告)号：US20190155793A1

公开(公告)日：2019-05-23

申请号：US16254921

申请日：2019-01-23

Applicant: NetApp Inc.

Inventor： Blake Lewis ,  John K. Edwards ,  Vijay Deshmukh ,  Kapil Kumar ,  Rajesh Desai

IPC: G06F16/182 ,  G06F3/06

Abstract: A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.

公开(公告)号：US09928249B2

公开(公告)日：2018-03-27

申请号：US15410789

申请日：2017-01-20

Applicant: NetApp, Inc.

Inventor： Blake Lewis ,  Ling Zheng ,  Craig Johnston ,  Vinod Daga

IPC: G06F17/00 ,  G06F17/30 ,  G06F3/06

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0659 ,  G06F3/067

Abstract: A system can maintain multiple queues for deduplication requests of different priorities. The system can also designate priority of storage units. The scheduling priority of a deduplication request is based on the priority of the storage unit indicated in the deduplication request and a trigger for the deduplication request.

公开(公告)号：US08924440B2

公开(公告)日：2014-12-30

申请号：US13968117

申请日：2013-08-15

Applicant: NetApp, Inc.

Inventor： Rickard E. Faith ,  Subramaniam Perivagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis ,  Jeffrey S. Kimmel ,  Stephen Daniel

IPC: G06F17/30 ,  G06F13/00 ,  G06F3/06

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30203

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.

Abstract translation: 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

公开(公告)号：US20160034489A1

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

申请号：US14880183

申请日：2015-10-09

Applicant: NetApp, Inc.

Inventor： Blake Lewis ,  Ling Zheng ,  Craig Johnston ,  Vinod Daga

IPC: G06F17/30

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0659 ,  G06F3/067

Abstract: A system can maintain multiple queues for deduplication requests of different priorities. The system can also designate priority of storage units. The scheduling priority of a deduplication request is based on the priority of the storage unit indicated in the deduplication request and a trigger for the deduplication request.

Abstract translation: 系统可以为不同优先级的重复数据删除请求维护多个队列。 系统还可以指定存储单元的优先级。 重复数据消除请求的调度优先级是基于重复数据消除请求中指示的存储单元的优先级和重复数据删除请求的触发。

公开(公告)号：US09043287B2

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

申请号：US14087345

申请日：2013-11-22

Applicant: NetApp, Inc.

Inventor： Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake Lewis ,  Rickard E. Faith ,  Ashish Prakash ,  Ram Kesavan ,  Ananthan Subramanian

IPC: G06F17/30 ,  G06F3/06

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

Abstract: It is determined that a first data block contains the same data as a second data block. The first data block is associated with a first extent and the second data block is associated with a second extent. In response to determining that the first data block contains the same data as the second data block, the second data block is associated with the first extent and the first data block is disassociated with the second extent.

Abstract translation: 确定第一数据块包含与第二数据块相同的数据。 第一数据块与第一范围相关联，并且第二数据块与第二范围相关联。 响应于确定第一数据块包含与第二数据块相同的数据，第二数据块与第一扩展区相关联，并且第一数据块与第二扩展区分离。

公开(公告)号：US09569140B2

公开(公告)日：2017-02-14

申请号：US14880183

申请日：2015-10-09

Applicant: NetApp, Inc.

Inventor： Blake Lewis ,  Ling Zheng ,  Craig Johnston ,  Vinod Daga

IPC: G06F17/00 ,  G06F3/06 ,  G06F17/30

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0659 ,  G06F3/067

Abstract: A system can maintain multiple queues for deduplication requests of different priorities. The system can also designate priority of storage units. The scheduling priority of a deduplication request is based on the priority of the storage unit indicated in the deduplication request and a trigger for the deduplication request.

Abstract translation: 系统可以为不同优先级的重复数据删除请求维护多个队列。 系统还可以指定存储单元的优先级。 重复数据消除请求的调度优先级是基于重复数据消除请求中指示的存储单元的优先级和重复数据删除请求的触发。

公开(公告)号：US20140258648A1

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

申请号：US14286900

申请日：2014-05-23

Applicant: NetApp, Inc.

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

IPC: G06F3/06

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30153 ,  G06F2211/1014 ,  G06F2212/401

Abstract: Overwriting part of compressed data without decompressing on-disk compressed data is includes by receiving a write request for a block of data in a compression group from a client, wherein the compression group comprises a group of data blocks that is compressed, wherein the block of data is uncompressed. The storage server partially overwrites the compression group, wherein the compression group remains compressed while the partial overwriting is performed. The storage server determines whether the partially overwritten compression group including the uncompressed block of data should be compressed. The storage server defers compression of the partially overwritten compression group if the partially overwritten compression group should not be compressed. The storage server compresses the partially overwritten compression group if the partially overwritten compression group should be compressed.

Abstract translation: 在不解压缩磁盘压缩数据的情况下覆盖压缩数据的一部分包括通过从客户端接收对压缩组中的数据块的写请求，其中压缩组包括被压缩的一组数据块，其中， 数据未压缩。 存储服务器部分地覆盖压缩组，其中在执行部分重写的同时，压缩组保持压缩。 存储服务器确定是否应压缩包括未压缩数据块的部分覆盖压缩组。 如果部分覆盖的压缩组不应被压缩，则存储服务器会延迟部分覆盖压缩组的压缩。 如果部分覆盖的压缩组应该被压缩，存储服务器会压缩部分覆盖的压缩组。

公开(公告)号：US11169972B2

公开(公告)日：2021-11-09

申请号：US16254921

申请日：2019-01-23

Applicant: NetApp Inc.

Inventor： Blake Lewis ,  John K. Edwards ,  Vijay Deshmukh ,  Kapil Kumar ,  Rajesh Desai

IPC: G06F16/182 ,  G06F3/06 ,  G06F11/20

Abstract: A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.