METHODS FOR COMBINING ACCESS HISTORY AND SEQUENTIALITY FOR INTELLIGENT PREFETCHING AND DEVICES THEREOF
    51.
    发明申请
    METHODS FOR COMBINING ACCESS HISTORY AND SEQUENTIALITY FOR INTELLIGENT PREFETCHING AND DEVICES THEREOF 审中-公开
    用于组合智能预购的访问历史和顺序的方法及其装置

    公开(公告)号:WO2015112249A1

    公开(公告)日:2015-07-30

    申请号:PCT/US2014/066593

    申请日:2014-11-20

    Applicant: NETAPP, INC.

    Abstract: A method, non-transitory computer readable medium, and device that prefetchs includes identifying a candidate data block from one of one or more immediate successor data blocks. The identified candidate data block has a historical access probability value from an initial accessed data block which is higher than a historical access probability value for each of the other immediate successor data blocks and is above a prefetch threshold value. The identifying is repeated until a next identified candidate data block has the historical access probability value below the prefetch threshold value. In the repeating, the identifying next immediate successor data blocks is from the previously identified candidate data block and the historical access probability value for each of the next immediate successor data blocks is determined from the orginally accessed data block. The identified candidate data block with the historical access probability value above the prefetch threshold value is fetched.

    Abstract translation: 一种方法,非暂时性计算机可读介质和预取装置包括从一个或多个立即后继数据块中的一个标识候选数据块。 所识别的候选数据块具有来自初始访问数据块的历史访问概率值,该访问概率值高于其他立即后继数据块中的每一个的历史访问概率值,并且高于预取阈值。 重复该识别,直到下一个所识别的候选数据块具有低于预取阈值的历史访问概率值。 在重复中,识别下一个即时后续数据块来自先前识别的候选数据块,并且从原始访问的数据块确定下一个立即后继数据块中的每一个的历史访问概率值。 获取具有高于预取阈值的历史访问概率值的所识别的候选数据块。

    GLOBAL IN-LINE EXTENT-BASED DEDUPLICATION
    52.
    发明申请
    GLOBAL IN-LINE EXTENT-BASED DEDUPLICATION 审中-公开
    全球在线基于广泛的配套

    公开(公告)号:WO2015105665A1

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

    申请号:PCT/US2014/071465

    申请日:2014-12-19

    Applicant: NETAPP, INC.

    Abstract: In one embodiment, a layered file system of a storage input/output (I/O) stack executes on one or more nodes of a cluster. The layered file system includes a flash-optimized, log-structured layer configured to provide sequential storage of data and metadata (i.e., a log-structured layout) on solid state drives (SSDs) of storage arrays in the cluster to reduce write amplification, while leveraging a data de-duplication feature of the storage I/O stack. An extent store layer of the file system performs and maintains mappings of the extent keys to SSD storage locations, while a volume layer of the file system performs and maintains mappings of the LUN offset ranges to the extent keys. Separation of the mapping functions between the volume and extent store layers enables different volumes with different offset ranges to reference a same extent key (and thus a same extent).

    Abstract translation: 在一个实施例中,存储输入/输出(I / O)堆栈的分层文件系统在集群的一个或多个节点上执行。 分层文件系统包括闪存优化的日志结构化层,其被配置为在集群中的存储阵列的固态驱动器(SSD)上提供对数据和元数据的顺序存储(即,日志结构化布局),以减少写入放大, 同时利用存储I / O堆栈的重复数据删除功能。 文件系统的扩展存储层执行并维护扩展密钥到SSD存储位置的映射,而文件系统的卷层执行并维护LUN偏移范围到扩展密钥的映射。 卷和卷存储层之间的映射函数的分离使得具有不同偏移范围的不同卷可以引用相同的扩展密钥(并因此相同的扩展)。

    TECHNIQUES FOR POLICY-BASED DATA PROTECTION SERVICES
    53.
    发明申请
    TECHNIQUES FOR POLICY-BASED DATA PROTECTION SERVICES 审中-公开
    基于政策数据保护服务的技术

    公开(公告)号:WO2015073563A1

    公开(公告)日:2015-05-21

    申请号:PCT/US2014/065274

    申请日:2014-11-12

    CPC classification number: G06F11/1469 G06F11/1456 G06F11/1464

    Abstract: Examples are disclosed for a data protection service available to a tenant having access to a shared pool of configurable computing resources that may be included in a cloud computing network. In some examples, the tenant may be able to view backups and/or recover backed up data based on the one or more policies for the data protection service. The one or more policies may be generic to an application, a system or a configuration for the tenant to access and/or utilize the shared pool of configurable computing resources. Other examples are described and claimed.

    Abstract translation: 公开了用于可访问可以包括在云计算网络中的可配置计算资源的共享池的租户的数据保护服务的示例。 在一些示例中,租户可以基于用于数据保护服务的一个或多个策略来查看备份和/或恢复备份的数据。 所述一个或多个策略对于租户访问和/或利用可配置计算资源的共享池的应用,系统或配置可以是通用的。 其他的例子被描述和要求保护。

    MANAGEMENT OF EXTENT BASED METADATA WITH DENSE TREE STRUCTURES WITHIN A DISTRIBUTED STORAGE ARCHITECTURE
    54.
    发明申请
    MANAGEMENT OF EXTENT BASED METADATA WITH DENSE TREE STRUCTURES WITHIN A DISTRIBUTED STORAGE ARCHITECTURE 审中-公开
    在分布式存储架构中管理具有DENSE TREE结构的基于元素的元数据

    公开(公告)号:WO2015038741A1

    公开(公告)日:2015-03-19

    申请号:PCT/US2014/055138

    申请日:2014-09-11

    Applicant: NETAPP, INC.

    Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer. The volume layer manages volume metadata embodied as mappings from offsets of a logical unit (LUN) to extent keys associated with storage locations for extents on the one or more storage devices. Volume metadata is maintained as a dense tree metadata structure representing successive points in time. The dense tree metadata structure has multiple levels, wherein a top level of the dense tree metadata structure represents newer volume metadata changes and descending levels of the dense tree metadata structure represent older volume metadata changes. The node accesses a latest version of changes to the volume metadata by searching from the top level to the descending levels in the dense tree metadata structure.

    Abstract translation: 在一个实施例中,耦合到一个或多个存储设备的节点执行具有体积层的存储输入/输出(I / O)堆栈。 卷层管理体现为从逻辑单元(LUN)的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次,其中密集树元数据结构的顶层表示较新的卷元数据更改,密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。

    METHOD AND SYSTEM FOR MIGRATING A VIRTUAL STORAGE SYSTEM
    55.
    发明申请
    METHOD AND SYSTEM FOR MIGRATING A VIRTUAL STORAGE SYSTEM 审中-公开
    虚拟存储系统移植的方法和系统

    公开(公告)号:WO2014193695A1

    公开(公告)日:2014-12-04

    申请号:PCT/US2014/038730

    申请日:2014-05-20

    Applicant: NETAPP, INC.

    Abstract: Method and system for a non-disruptive migration of a source virtual storage system from a source cluster to a destination cluster is provided. The method includes monitoring a current transfer rate for migrating information from the source cluster to the destination cluster during a migration operation; iteratively reducing a rate at which I/O requests are processed until a transfer rate for transferring the information from the source cluster to the destination cluster within the duration is reached; and entering a cutover phase for the migration operation when the virtual storage system presented by the source cluster is taken offline for the duration and after the information is migrated to the destination cluster, the virtual storage system is presented by the destination cluster.

    Abstract translation: 提供了源虚拟存储系统从源集群到目标集群的非中断迁移的方法和系统。 该方法包括监视在迁移操作期间将信息从源集群迁移到目的地集群的当前传输速率; 迭代地减少处理I / O请求的速率,直到达到在持续时间内将信息从源集群传送到目标集群的传输速率; 并且当由源集群呈现的虚拟存储系统在持续时间内脱机并且在将信息迁移到目的地集群之后,进入迁移操作的切换阶段,则由目的地集群呈现虚拟存储系统。

    EFFICIENT STORAGE OF SMALL RANDOM CHANGES TO DATA ON DISK
    56.
    发明申请
    EFFICIENT STORAGE OF SMALL RANDOM CHANGES TO DATA ON DISK 审中-公开
    小型随机变化对磁盘数据的有效存储

    公开(公告)号:WO2014190143A1

    公开(公告)日:2014-11-27

    申请号:PCT/US2014/039120

    申请日:2014-05-22

    Applicant: NETAPP, INC.

    Abstract: The embodiments described herein provide a system and method for efficiently storing small, random modifications or changes to data on one or more storage devices, such as disks, of storage servers coupled to a host computer in a network environment. Illustratively, the data is stored in a region of a byte-addressable, persistent memory of the host computer and is replicated (i.e., copied) as changed data of the region on the disks at the granularity at which it was modified, e.g., at the byte-addressable granularity. To that end, each storage server employs a data structure (e.g., a Fibonacci array) that is configured to efficiently accumulate the small, random data changes into one or more large blocks of changed data for storage on the disks in a manner that realizes the streaming bandwidth of the disk

    Abstract translation: 这里描述的实施例提供了一种用于在网络环境中有效地存储耦合到主计算机的存储服务器的一个或多个存储设备(例如磁盘)上的数据的小的,随机的修改或改变的系统和方法。 说明性地,数据被存储在主计算机的可以字节寻址的永久存储器的区域中,并且被复制(即复制)作为在其被修改的粒度的磁盘上的区域的改变的数据,例如, 字节可寻址粒度。 为此,每个存储服务器采用数据结构(例如,斐波纳契数组),其被配置为有效地将小的随机数据变化累加到一个或多个更改数据的大块中,以便以实现该方式的方式存储在磁盘上 流媒体带宽的磁盘

    SYSTEM AND METHOD FOR AN EFFICIENT CACHE WARM-UP
    57.
    发明申请
    SYSTEM AND METHOD FOR AN EFFICIENT CACHE WARM-UP 审中-公开
    用于高效缓存的系统和方法

    公开(公告)号:WO2014100253A1

    公开(公告)日:2014-06-26

    申请号:PCT/US2013/076257

    申请日:2013-12-18

    Applicant: NETAPP, INC

    CPC classification number: G06F12/0862

    Abstract: Described herein is a system and method for an efficient cache warm-up. The system and method may copy data blocks from a primary storage device to a cache memory device. The system and method may identify a subset of data blocks stored on the primary storage device as candidate data blocks for copying to the cache memory device during a cache warm-up period. A cost effectiveness for copying the candidate data blocks to the cache memory device may be determined. In some embodiments, the cost effectiveness may be calculated based on one or more latency values associated with the primary storage device and the cache memory device. The candidate data blocks may be copied to the cache memory device based on the cost effectiveness.

    Abstract translation: 这里描述了一种用于高效缓存预热的系统和方法。 系统和方法可以将数据块从主存储设备复制到高速缓冲存储器设备。 该系统和方法可以将存储在主存储设备上的数据块的子集识别为用于在高速缓存预热期间复制到高速缓冲存储器设备的候选数据块。 可以确定将候选数据块复制到高速缓冲存储器件的成本效益。 在一些实施例中,可以基于与主存储设备和高速缓冲存储器设备相关联的一个或多个等待时间值来计算成本效益。 可以基于成本效益将候选数据块复制到高速缓冲存储器设备。

    DECOUPLED RELIABILITY GROUPS
    58.
    发明申请
    DECOUPLED RELIABILITY GROUPS 审中-公开
    解除可靠性组

    公开(公告)号:WO2014089413A1

    公开(公告)日:2014-06-12

    申请号:PCT/US2013/073537

    申请日:2013-12-06

    Applicant: NETAPP, INC.

    Abstract: Methods and apparatuses for updating members of a data storage reliability group are provided. In one exemplary method, a reliability group includes a data zone in a first storage node and a checksum zone in a second data storage node. The method includes updating a version counter associated with the data zone in response to destaging a data object from a staging area of the data zone to a store area of the data zone without synchronizing the destaging with the state of the checksum zone. The method further includes transmitting, from the data zone to the checksum zone, an update message indicating completion of the destaging of the data object, wherein the update message includes a current value of the version counter.

    Abstract translation: 提供了更新数据存储可靠性组的成员的方法和装置。 在一个示例性方法中,可靠性组包括第一存储节点中的数据区和第二数据存储节点中的校验和区。 该方法包括更新与数据区域相关联的版本计数器,以响应于将数据对象从数据区域的暂存区域降级到数据区域的存储区域,而不使分级与校验和区域的状态同步。 所述方法还包括从所述数据区向所述校验和区发送指示所述数据对象的分级的完成的更新消息,其中所述更新消息包括所述版本计数器的当前值。

    STORAGE ARCHITECTURE FOR SERVER FLASH AND STORAGE ARRAY OPERATION
    59.
    发明申请
    STORAGE ARCHITECTURE FOR SERVER FLASH AND STORAGE ARRAY OPERATION 审中-公开
    用于服务器闪存和存储阵列操作的存储架构

    公开(公告)号:WO2014051639A1

    公开(公告)日:2014-04-03

    申请号:PCT/US2012/062544

    申请日:2012-10-30

    Applicant: NETAPP, INC.

    CPC classification number: G06F3/0613 G06F3/0656 G06F3/0685 G06F12/0866

    Abstract: A storage architecture of a storage system environment has a storage connector interface configured to exchange data directly between flash storage devices on a server and a storage array of the environment so as to bypass main memory and a system bus of the server. According to one or more embodiments, the storage connector interface includes control logic configured to implement the data exchange in accordance with one of a plurality of operational modes that deploy and synchronize the data on the flash storage devices and the storage array. Advantageously, the storage connector interface obviates latencies and bandwidth consumption associated with prior data exchanges over the main memory and bus, thereby enhancing storage architecture performance.

    Abstract translation: 存储系统环境的存储架构具有被配置为在服务器上的闪存存储设备与环境的存储阵列之间直接交换数据的存储连接器接口,以便绕过主存储器和服务器的系统总线。 根据一个或多个实施例,存储连接器接口包括控制逻辑,其被配置为根据在闪存存储设备和存储阵列上部署和同步数据的多种操作模式中的一种来实现数据交换。 有利地,存储连接器接口消除与主存储器和总线上的先前数据交换相关联的延迟和带宽消耗,从而增强存储架构性能。

    EFFICIENT DATA OBJECT STORAGE AND RETRIEVAL
    60.
    发明申请
    EFFICIENT DATA OBJECT STORAGE AND RETRIEVAL 审中-公开
    有效的数据对象存储和检索

    公开(公告)号:WO2013162954A1

    公开(公告)日:2013-10-31

    申请号:PCT/US2013/036832

    申请日:2013-04-16

    Applicant: NETAPP, INC.

    Abstract: A data storage system includes a processor, a system memory, and logical extents. Blocks of storage in one or more physical storage devices are allocated to each of the logical extents. The processor maintains a logical container for data objects and the volume includes one or more of the logical extents. The processor stores data objects that are uniquely identified by object identifiers in the logical extents. The processor also maintains a first index that is stored in the system memory and maps a range of the object identifiers to a second index. The second index is also stored in a logical extent and indicates storage locations of the data objects associated with the range of the object identifiers.

    Abstract translation: 数据存储系统包括处理器,系统存储器和逻辑盘区。 一个或多个物理存储设备中的存储块被分配给每个逻辑盘区。 处理器维护数据对象的逻辑容器,卷包含一个或多个逻辑扩展区。 处理器存储由逻辑盘区中的对象标识符唯一标识的数据对象。 处理器还维护存储在系统存储器中的第一索引,并将对象标识符的范围映射到第二索引。 第二个索引也存储在逻辑区段中,并指示与对象标识符的范围相关联的数据对象的存储位置。

Patent Agency Ranking