公开(公告)号：WO2012173859A3

公开(公告)日：2013-04-25

申请号：PCT/US2012041301

申请日：2012-06-07

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

Inventor： YASA GIRIDHAR APPAJI NAG ,  CHANDRASEKARASASTRY NAGESH PANYAM

IPC: G06F12/00 ,  G06F11/00 ,  G06F15/16

CPC classification number: G06F17/30156

Abstract: The technique introduced here includes a system and method for identification of duplicate data directly at a data-object level. The technique illustratively utilizes a hierarchical tree of fingerprints for each data object to compare data objects and identify duplicate data blocks referenced by the data objects. The hierarchical fingerprint trees are constructed in such a manner that a top-level fingerprint (or object-level fingerprint) of the hierarchical tree is representative of all data blocks referenced by a storage system. In embodiments, inline techniques are utilized to generate hierarchical fingerprints for new data objects as they are created, and an object-level fingerprint of the new data object is compared against preexisting object-level fingerprints in the storage system to identify exact or close matches. While exact matches result in complete deduplication of data blocks referenced by the data object, hierarchical comparison methods are used for identifying and mapping duplicate data blocks referenced by closely related data objects.

Abstract translation: 这里介绍的技术包括直接在数据对象层面识别重复数据的系统和方法。 该技术示例性地利用每个数据对象的指纹分层树来比较数据对象并识别由数据对象引用的重复数据块。 层次化指纹树以这样一种方式构成，使得层次树的顶级指纹（或对象级指纹）代表由存储系统引用的所有数据块。 在实施例中，在创建新数据对象时，使用内联技术来生成新数据对象的分层指纹，并将新数据对象的对象级指纹与存储系统中的预先存在的对象级指纹进行比较，以识别精确或近似的匹配。 虽然精确匹配导致数据对象引用的数据块的完全重复数据删除，但层次比较方法用于识别和映射由紧密相关的数据对象引用的重复数据块。

公开(公告)号：WO2013048573A1

公开(公告)日：2013-04-04

申请号：PCT/US2012/034475

申请日：2012-04-20

Applicant: NETAPP, INC. ,  SOUNDARARAJAN, Gokul ,  VORUGANTI, Kaladhar ,  BAIRAVASUNDARAM, Lakshmi, Narayanan ,  SEHGAL, Priya ,  MATHUR, Vipul

Inventor： SOUNDARARAJAN, Gokul ,  VORUGANTI, Kaladhar ,  BAIRAVASUNDARAM, Lakshmi, Narayanan ,  SEHGAL, Priya ,  MATHUR, Vipul

IPC: G06F12/08 ,  G06F15/173

CPC classification number: G06F12/0811 ,  G06F12/0813 ,  G06F12/0888 ,  G06F2212/2515 ,  G06F2212/284 ,  G06F2212/301 ,  G06F2212/601

Abstract: A change in workload characteristics detected at one tier of a multi-tiered cache is communicated to another tier of the multi-tiered cache. Multiple caching elements exist at different tiers, and at least one tier includes a cache element that is dynamically resizable. The communicated change in workload characteristics causes the receiving tier to adjust at least one aspect of cache performance in the multi-tiered cache. In one aspect, at least one dynamically resizable element in the multi-tiered cache is resized responsive to the change in workload characteristics.

Abstract translation: 在多层缓存的一层检测到的工作负载特性的改变被传送到多层高速缓存的另一层。 多个缓存元素存在于不同的层，并且至少一个层包括可动态调整大小的高速缓存元素。 所传达的工作负载特性的改变使得接收层在多层缓存中调整缓存性能的至少一个方面。 在一个方面，响应于工作负载特性的变化来调整多层缓存中的至少一个可动态调整大小的元素。

公开(公告)号：WO2013043439A1

公开(公告)日：2013-03-28

申请号：PCT/US2012/054927

申请日：2012-09-12

Applicant: NETAPP, INC. ,  RAO, Santosh Ananth ,  BROWN, Geoffrey Stewart ,  NATARAJAN, Srikumar ,  PATNAIK, Pranab ,  TAN, Kai ,  CORBETT, Peter Frank ,  VENKATESAN, Vivek

Inventor： RAO, Santosh Ananth ,  BROWN, Geoffrey Stewart ,  NATARAJAN, Srikumar ,  PATNAIK, Pranab ,  TAN, Kai ,  CORBETT, Peter Frank ,  VENKATESAN, Vivek

IPC: G06F15/16 ,  G06F12/00

CPC classification number: H04L67/1097 ,  G06F13/22 ,  H04L29/08549 ,  H04L43/10

Abstract: A storage area network (SAN)-attached storage system architecture is disclosed. The storage system provides strongly consistent distributed storage communication protocol semantics, such as SCSI target semantics. The system includes a mechanism for presenting a single distributed logical unit, comprising one or more logical sub-units, as a single logical unit of storage to a host system by associating each of the logical sub-units that make up the single distributed logical unit with a single host visible identifier that corresponds to the single distributed logical unit. The system further includes mechanisms to maintain consistent context information for each of the logical sub-units such that the logical sub-units are not visible to a host system as separate entities from the single distributed logical unit.

Abstract translation: 公开了一种存储区域网络（SAN）的存储系统结构。 存储系统提供强烈一致的分布式存储通信协议语义，如SCSI目标语义。 该系统包括通过将构成单个分布式逻辑单元的每个逻辑子单元相关联来向主机系统提供包括一个或多个逻辑子单元作为单个逻辑单元的单个分布式逻辑单元的机制 具有对应于单个分布式逻辑单元的单个主机可见标识符。 该系统还包括为每个逻辑子单元维护一致的上下文信息的机制，使得逻辑子单元作为与单个分布式逻辑单元的单独实体不能作为主机系统可见。

公开(公告)号：WO2013032544A1

公开(公告)日：2013-03-07

申请号：PCT/US2012/035302

申请日：2012-04-26

Applicant: NETAPP, INC. ,  Raj, Bipul ,  Sharma, Alok

Inventor： Raj, Bipul ,  Sharma, Alok

IPC: G06F12/02

CPC classification number: G06F3/0619 ,  G06F3/0604 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/065 ,  G06F3/067 ,  G06F9/465 ,  G06F12/02 ,  G06F17/30371 ,  G06F17/30607 ,  G06F2003/0697

Abstract: System and method for retaining deduplication of data blocks of a resulting storage object (e.g., a flexible volume) from a split operation of a clone of a base storage object. The clone may comprise data blocks that are shared with at least one data block of the base storage object and at least one data block that is not shared with at least one data block of the base storage object. The data blocks of the clone that are shared with the base storage object may be indicated to receive a write allocation that may comprise assigning a new pointer to a indicated data block. Each data block may comprise a plurality of pointers comprising a virtual address pointer and a physical address pointer. As such, data blocks of the clone comprising the same virtual address pointer may be assigned a single physical address pointer.

Abstract translation: 用于从基本存储对象的克隆的分离操作中保留所得存储对象（例如，灵活卷）的数据块的重复数据删除的系统和方法。 克隆可以包括与基本存储对象的至少一个数据块共享的数据块和不与基本存储对象的至少一个数据块共享的至少一个数据块。 可以指示与基本存储对象共享的克隆的数据块以接收可以包括向指示的数据块分配新指针的写入分配。 每个数据块可以包括包括虚拟地址指针和物理地址指针的多个指针。 因此，可以为包括相同虚拟地址指针的克隆的数据块分配单个物理地址指针。

公开(公告)号：WO2012149220A2

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

申请号：PCT/US2012/035299

申请日：2012-04-26

Applicant: NETAPP, INC. ,  MUDHIGANTI, Devender ,  KEREMANE, Hrishikesh ,  SOMAVARAPU, Nagender ,  GEORGE, Tijin

Inventor： MUDHIGANTI, Devender ,  KEREMANE, Hrishikesh ,  SOMAVARAPU, Nagender ,  GEORGE, Tijin

IPC: G06F15/16 ,  G06F9/06

CPC classification number: G06F3/0613 ,  G06F3/0608 ,  G06F3/0647 ,  G06F3/067 ,  G06F17/30067 ,  G06F17/30557

Abstract: System and method for migrating data from a source storage site to a destination storage site. The data may be comprised within storage objects (e.g., flexible volumes). A base storage object may comprise a parent storage object and a storage object clone may comprise a storage object that is derived from the base storage object. As such, a hierarchical relationship exists between the base storage object and the storage object clone. The storage object clone may comprise a writable point-in-time image of the parent storage object. If a migration of the base storage object and the storage object clone is performed, then the hierarchical relationship between the base storage object and the storage object clone is retained after the storage objects are migrated from the source storage site to the destination storage site. As such, the system and method for migrating data may enable storage space and network bandwidth savings.

Abstract translation: 将数据从源存储站点迁移到目标存储站点的系统和方法。 数据可以包含在存储对象（例如，灵活的卷）内。 基本存储对象可以包括父存储对象，并且存储对象克隆可以包括从基本存储对象导出的存储对象。 因此，基本存储对象和存储对象克隆之间存在层次关系。 存储对象克隆可以包括父存储对象的可写入时间点图像。 如果执行基本存储对象和存储对象克隆的迁移，则在将存储对象从源存储站点迁移到目标存储站点之后，将保留基本存储对象和存储对象克隆之间的分层关系。 因此，用于迁移数据的系统和方法可以实现存储空间和网络带宽的节省。

公开(公告)号：WO2012083305A1

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

申请号：PCT/US2011/065893

申请日：2011-12-19

Applicant: NETAPP, INC. ,  GAONKAR, Shravan ,  DIXIT, Sagar

Inventor： GAONKAR, Shravan ,  DIXIT, Sagar

IPC: G06F17/40 ,  G06F12/00

CPC classification number: G06F17/303 ,  G06F17/30156

Abstract: Methods and systems for efficiently determining a similarity between two or more datasets. In one embodiment, the similarity is determined based on comparing a subset of sorted frequency-weighted blocks from one dataset to a subset of sorted frequency-weighed blocks from another dataset. Data blocks of a dataset are converted into hash values that are frequency-weighted. These frequency-weighted hash values can be compared to frequency-weighted hash values of another dataset to determine a similarity of the two datasets. In another embodiment, upon a change of a block in a subset of the dataset, the similarity value is re-determined without resorting or hashing the blocks of a dataset other than the blocks of the subset, resulting in an increased performance of a similarity comparison. In another embodiment, blocks of a dataset are excluded based on a block-filtering rule to increase the accuracy of the similarity comparison.

Abstract translation: 用于有效确定两个或多个数据集之间的相似性的方法和系统。 在一个实施例中，基于将来自一个数据集的排序的频率加权块的子集与来自另一数据集的排序的频率加权块的子集进行比较来确定相似性。 数据集的数据块被转换为频率加权的哈希值。 这些频率加权散列值可以与另一数据集的频率加权散列值进行比较，以确定两个数据集的相似性。 在另一个实施例中，在数据集的子集中的块的改变之后，重新确定相似性值，而不必借助或散列数据集的不同于子集的块的块，导致相似性比较的性能增加 。 在另一个实施例中，基于块过滤规则排除数据集的块以增加相似性比较的准确性。

公开(公告)号：WO2009155433A3

公开(公告)日：2010-07-01

申请号：PCT/US2009047818

申请日：2009-06-18

Applicant: NETAPP INC ,  THELEN RANDY ,  GOODSON GARTH RICHARD ,  SRINIVASAN KIRAN ,  SUSARLA SAI

Inventor： THELEN RANDY ,  GOODSON GARTH RICHARD ,  SRINIVASAN KIRAN ,  SUSARLA SAI

IPC: G06F15/16 ,  G06F3/06 ,  G06F12/00 ,  G06F13/14

CPC classification number: G06F3/061 ,  G06F3/0619 ,  G06F3/0647 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0685 ,  G06F9/544 ,  G06F9/545 ,  G06F11/0727 ,  G06F12/023 ,  G06F12/1009 ,  G06F2212/206 ,  G06F2212/262 ,  G06F2212/657

Abstract: Fault isolation capabilities made available by user space can be provided for a embedded network storage system without sacrificing efficiency. By giving user space processes direct access to specific devices (e.g., network interface cards and storage adapters), processes in a user space can initiate Input/Output requests without issuing system calls (and entering kernel mode). The multiple user spaces processes can initiate requests serviced by a user space device driver by sharing a read-only address space that maps the entire physical memory one-to-one. In addition, a user space process can initiate communication with another user space process by use of transmit and receive queues similar to transmit and receive queues used by hardware devices. And, a mechanism of ensuring that virtual addresses that work in one address space reference the same physical page in another address space is used.

Abstract translation: 可以为嵌入式网络存储系统提供用户空间提供的故障隔离功能，而不会牺牲效率。 通过给用户空间处理直接访问特定设备（例如，网络接口卡和存储适配器），用户空间中的进程可以发起输入/输出请求，而不发出系统调用（并进入内核模式）。 多个用户空间进程可以通过共享一个将整个物理存储器映射到一个的只读地址空间来发起由用户空间设备驱动程序服务的请求。 此外，用户空间进程可以通过使用类似于由硬件设备使用的发送和接收队列的发送和接收队列来发起与另一个用户空间进程的通信。 并且，使用一种确保在一个地址空间中工作的虚拟地址引用另一地址空间中的同一物理页面的机制。

公开(公告)号：WO2010056743A1

公开(公告)日：2010-05-20

申请号：PCT/US2009/064025

申请日：2009-11-11

Applicant: NETAPP, INC. ,  NULKAR, Chaitanya ,  MAI, Huynh, Duc

Inventor： NULKAR, Chaitanya ,  MAI, Huynh, Duc

IPC: G06F11/07

CPC classification number: H04L41/0893 ,  H04L41/044 ,  H04L41/0663 ,  H04L41/0695 ,  H04L67/1097

Abstract: A system and method are described for aggregating management of devices connected to a server. In one embodiment, devices connected to a server may be identified by an operating system of the server. The devices may be in communication with one another through a network. The operating system may communicate a network identifier of each device to a service processor of the server. The service processor may aggregately manage the devices independent from the operating system. The service processor may receive management commands from an external source. Each of the management commands may be associated with one of the connected devices, but the connected devices may be incapable of communicating directly with the external source. The service processor may communicate each management command to the device associated with the management command using the network identifier of the associated device. The management command can then be performed on the associated device.

Abstract translation: 描述了用于聚合连接到服务器的设备的管理的系统和方法。 在一个实施例中，连接到服务器的设备可以由服务器的操作系统来识别。 设备可以通过网络彼此通信。 操作系统可以将每个设备的网络标识符传送到服务器的服务处理器。 服务处理器可以集中管理独立于操作系统的设备。 服务处理器可以从外部源接收管理命令。 每个管理命令可以与所连接的设备中的一个相关联，但是所连接的设备可能不能直接与外部源进行通信。 服务处理器可以使用相关联的设备的网络标识符将每个管理命令传送到与管理命令相关联的设备。 然后可以在相关联的设备上执行管理命令。

公开(公告)号：WO2010040078A2

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

申请号：PCT/US2009/059416

申请日：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 ,  G06F15/16 ,  G06F3/06 ,  G06F12/00 ,  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: 用于组织数据以促进重复数据消除的技术包括将基于块的数据集划分为多个“块”，其中块边界独立于块边界（由于散列算法） 。 数据集的元数据（例如用于定位数据的块指针）被存储在包括多个级别的树结构中，其中每个级别都包括至少一个节点。 树的最低级别包括多个节点，每个节点包含与数据集的块有关的块元数据。 在缓冲树的最低级别的每个节点中，其中包含的块元数据标识至少一个块。 块（用户级数据）存储在一个或多个系统文件中，这些文件独立于缓冲区树，对用户不可见。

公开(公告)号：WO2009135065A3

公开(公告)日：2010-02-25

申请号：PCT/US2009042414

申请日：2009-04-30

Applicant: NETAPP INC ,  COATNEY DOUG ,  ASTER RADEK

Inventor： COATNEY DOUG ,  ASTER RADEK

IPC: G06F12/00 ,  G06F12/08 ,  G06F13/10 ,  G06F13/12

CPC classification number: G06F12/0223 ,  G06F3/0605 ,  G06F3/0632 ,  G06F3/0689 ,  G06F11/1092

Abstract: A computer storage system includes multiple disk trays, each disk tray holding two or more physical disks. The disks on a single tray are virtualized into a single logical disk. The single logical disk reports to the RAID (redundant array of inexpensive disks) subsystem, creating the impression that there is one large capacity disk. In one implementation, each disk in the tray is allocated to a different RAID group. By allocating the disks in a tray to different RAID groups, if the tray is removed, only a portion of several different RAID groups are removed. This arrangement permits a simple reconstruction of the RAID groups if a disk tray is removed from the system.

Abstract translation: 计算机存储系统包括多个盘托盘，每个托盘盘托有两个或多个物理盘。 单个托盘上的磁盘虚拟化为单个逻辑磁盘。 单个逻辑磁盘向RAID（廉价磁盘的冗余阵列）子系统报告，从而产生一个大容量磁盘的印象。 在一个实现中，托盘中的每个磁盘分配给不同的RAID组。 通过将托盘中的磁盘分配到不同的RAID组，如果托盘被移除，则只会删除几个不同RAID组的一部分。 如果磁盘托盘从系统中移除，则这种布置允许对RAID组进行简单重建。