Netapp, Inc.

Cisco Technology, Inc.

Narayan Venkat

Kenny Speer

Joshua B Gahm

David Lively

Vivek Venkatesan

John George Apostolopoulos

David R Oran

Frederick Knight

Marton Akos Sipos

Márton Ákos Sipos

Congestion aware load balancing for distributed storage may be provided. First, a read request for data may be received. The data may have redundancy through coding or through copying. Then it may be determined which K of M possible storage nodes to direct the received read request. K and M may be integers and M may be greater than K. In response to determining which K of M possible storage nodes to direct the received read request, the received read request may be copied into K read requests respectively corresponding to the determined K of M possible storage nodes. The copied K read requests may then be transmitted to the determined respective K storage nodes. And, in response to transmitting the copied K read requests, a client may receive data replies from each of the determined respective K storage nodes.

Congestion aware load balancing for distributed storage

In an example, there is disclosed a computing apparatus, having one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive failure scenario; identifying at least one repair &#x3be;for the failure scenario; determining that &#x3be;is feasible; and logging &#x3be;to a feasible repair log. When a node failure occurs, a network cost may be computed for each repair in the feasible repair log, and an optimal repair may be selected.

Network-aware storage repairs

A controller device is configured to communicate with storage nodes of a distributed storage system (DSS) in which erasure codes are used to encode source data onto the storage nodes and ranks of matrices containing coding coefficients associated with the erasure codes indicate whether repairs of failed storage nodes of the DSS are feasible. A decomposition structure is generated to be used as a guide for transforming the matrices to upper triangle form (UTF) for use in computing the ranks of the matrices. While the DSS is operating to perform repairs of the failed storage nodes, as part of determining feasible repair strategies that will preserve subsequent repairs of failed storage nodes, the ranks of the matrices are computed by transforming the matrices to UTF using operations on the submatrices according to the decomposition structure.

Efficient repair of erasure coded data based on coefficient matrix decomposition

Method and system for detecting migration of a virtual machine are provided. The method detects that a first identifier for identifying a virtual machine and a second identifier identifying a source computing system hosting the virtual machine that accesses a storage space via a logical object have changed, when the virtual machine is migrated from the source computing system to a destination computing system. Thereafter, a storage device at the destination computing system is initialized to operate as a caching device for the migrated virtual machine.

Method and system for detecting virtual machine migration

A method and system of persistent cache invalidation ensures cache durability. A storage filter driver of a storage input/output (I/O) stack of a server may be used to capture (i.e., track) write requests made to storage devices prior to the persistent cache becoming operational. Entries in the cache having overlapping address ranges with the tracked write requests may be invalidated before the cache is deemed operational. In this manner, the cache remains consistent with the backing store across the administrative actions or failure event (albeit with less valid entries). Notably, the filter driver tracks (i.e., captures) metadata of the write request (i.e., address range and size of the request) to support invalidation of matching cache entries. As such, the filter driver need not store (record) data associated with the write request.

Method to persistent invalidation to ensure cache durability

Described herein is a system and method for maintaining cache coherency. The system and method may maintain coherency for a cache memory that is coupled to a plurality of primary storage devices. The system and method may write data to the cache memory and associate the data with a cache generation identification (ID). A different cache generation ID may be associated with each new set of data that is written to the cache memory. The cache generation ID may be written to the primary storage devices. A backup restore operation may be performed on one of the primary storage devices and a backup restore notification may be received. In response to the notification, the system and method may compare the cache generation ID with the generation ID stored on the restored primary storage device and invalidate data stored on the cache memory for the restored primary storage device.

System and method for maintaining cache coherency

A system and method of emulating a shared storage device includes determining a storage unit identifier (SUID) associated with a first local storage device in a first node of a distributed computing system, updating a first path handler to intercept storage requests including the SUID and being made on the first node and forwarding the storage requests to drivers for an emulated shared storage device, associating a second local storage device in a second node of the distributed computing system with the SUID, updating a second path handler to intercept storage requests including the SUID and being made on the second node and forwarding the storage requests to the drivers for the emulated shared storage device, and intercepting storage requests including the SUID and being made on the second node and forwarding the storage requests to the drivers for the emulated shared storage device.

Growing community of inventors

Westford, MA, United States of America

Narayan Venkat