公开(公告)号：US10360119B2

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

申请号：US14876063

申请日：2015-10-06

Applicant: NetApp, Inc.

Inventor： Martin Jess ,  Joseph Moore ,  Ziling Huang

IPC: G06F11/10 ,  G06F11/20

Abstract: A system, method, and machine-readable storage medium for recovering data in a distributed storage system are provided. In some embodiments, the method includes identifying a failing storage device of a first storage node having an inaccessible data segment. When it is determined that the inaccessible data segment cannot be recovered using a first data protection scheme, a first chunk of data associated with the inaccessible data segment is identified and a group associated with the first chunk of data is identified. A second chunk of data associated with the group is selectively retrieved from a second storage node such that data associated with an accessible data segment of the first storage node is not retrieved. The inaccessible data segment is recovered by recovering the first chunk of data using a second data protection scheme and the second chunk of data.

公开(公告)号：US20190220195A1

公开(公告)日：2019-07-18

申请号：US16359088

申请日：2019-03-20

Applicant: NETAPP, INC.

Inventor： Jayalakshmi Pattabiraman ,  Nikhil Mattankot ,  Deekshith Belchapada ,  Blake H. Lewis ,  Subramaniam Periyagaram ,  Satya Suresh Chouta Naga Veera ,  Rohit Singh ,  Rajesh Khandelwal ,  James Robert Morefield

IPC: G06F3/06 ,  G06F12/02 ,  G06F7/06

CPC classification number: G06F3/064 ,  G06F3/0613 ,  G06F3/0616 ,  G06F3/0683 ,  G06F7/06 ,  G06F12/02 ,  G06F12/023 ,  G06F2212/1016

Abstract: A first plurality of block identifiers is sorted based, at least in part, on a measure of spatial locality. A second plurality of block identifiers is sorted based, at least in part, on the measure of spatial locality. At least the first plurality of block identifiers and the second plurality of block identifiers are incrementally merged into a third plurality of block identifiers based, at least in part, on the measure of spatial locality. A block of data corresponding to metadata associated with a plurality of block identifiers of the third plurality of block identifiers is updated.

公开(公告)号：US10353740B2

公开(公告)日：2019-07-16

申请号：US15589909

申请日：2017-05-08

Applicant: NetApp, Inc.

Inventor： Emalayan Vairavanathan ,  Dheeraj Raghavender Sangamkar ,  Song Guen Yoon ,  Yi Zhang

IPC: G06F9/50 ,  G06F11/20 ,  G06F11/10 ,  G06F3/06 ,  H04L29/08 ,  H04L29/14

Abstract: To efficiently recover from a multiple storage node failure, a storage node concurrently restores data fragments to the multiple failed storage nodes, as opposed to restoring each node individually. In the VCS based storage technique, storage nodes are restored as part of an ECG repair process. For each ECG being repaired, a storage node performing the restoration process reads data fragments from active nodes in the ECG and generates new data fragments to replace any lost data fragments. The node then stores one of the new data fragments across each of the failed storage nodes. By concurrently restoring data fragments to each failed storage node, the data fragments needed to repair each ECG are only read once, thereby preserving disk operations and network bandwidth.

公开(公告)号：US10353642B2

公开(公告)日：2019-07-16

申请号：US15583946

申请日：2017-05-01

Applicant: NetApp, Inc.

Inventor： Ratnesh Gupta

IPC: G06F11/00 ,  G06F3/06 ,  G06F11/10

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for selectively limiting the amount of data in a file system, which include: determining a reparity bit value for a write disk block range, wherein the reparity bit is configured to track a number of writes in progress to a stripe range; determining the reparity bit value; updating a threshold written disk block number as a highest disk block number of the reparity bit value; and initiating a RAID operation until it reaches the threshold written disk block number, wherein the threshold written disk block number comprises a maximum written disk block number representing the last disk block number written.

公开(公告)号：US10348562B2

公开(公告)日：2019-07-09

申请号：US14992249

申请日：2016-01-11

Applicant: NETAPP, INC.

Inventor： Karthick Radhakrishnan ,  Jacob Abraham ,  Krithi BG ,  Nirdosh Kumar Chouhan

IPC: H04L12/24 ,  H04L29/08

Abstract: Methods and systems for a networked storage environment are provided. One method includes storing at a storage device by a processor a data structure with information regarding a plurality of compatible software and hardware components configured to operate in a plurality of configurations as part of a storage solution for using resources at a networked storage environment for storing data; obtaining by a processor executable configuration advisor information regarding a plurality of deployed components of a deployed configuration from among the plurality of configurations; comparing the deployed configuration with a latest configuration having the plurality of deployed components from among the plurality of configurations stored at the data structure; and recommending a change in at least one of the plurality of deployed components to upgrade the deployed configuration, when the deployed configuration is not the latest configuration.

公开(公告)号：US10346354B2

公开(公告)日：2019-07-09

申请号：US15338272

申请日：2016-10-28

Applicant: NetApp, Inc.

Inventor： Ajay Pratap Singh Kushwah ,  Ling Zheng ,  Sharad Jain

IPC: G06F16/11 ,  G06F16/13 ,  H04L29/08 ,  G06F12/121 ,  G06F11/14

Abstract: With a forever incremental snapshot configuration and a typical caching policy (e.g., least recently used), a storage appliance may evict stable data blocks of an older snapshot, perhaps unchanged data blocks of the snapshot baseline. If stable data blocks have been evicted, restore of a recent snapshot will suffer the time penalty of downloading the stable blocks for restoring the recent snapshot. Creating synthetic baseline snapshots and refreshing eviction data of stable data blocks can avoid eviction of stable data blocks and reduce the risk of violating a recovery time objective.

公开(公告)号：US10346254B2

公开(公告)日：2019-07-09

申请号：US15722114

申请日：2017-10-02

Applicant: NetApp Inc.

Inventor： Stephen Wu ,  Prathamesh Deshpande ,  Manan Patel

IPC: G06F12/00 ,  G06F11/14 ,  G06F3/06 ,  G06F11/07

Abstract: An application may store data to a dataset comprising a plurality of volumes stored on a plurality of storage systems. The application may request a dataset image of the dataset, the dataset image comprising a volume image of each volume of the dataset. A dataset image manager operates with a plurality of volume image managers in parallel to produce the dataset image, each volume image manager executing on a storage system. The plurality of volume image managers respond by performing requested operations and sending responses to the dataset image manager in parallel. Each volume image manager on a storage system may manage and produce a volume image for each volume of the dataset stored to the storage system. If a volume image for any volume of the dataset fails, or a timeout period expires, a cleanup procedure is performed to delete any successful volume images.

公开(公告)号：US20190179679A1

公开(公告)日：2019-06-13

申请号：US16275649

申请日：2019-02-14

Applicant: NETAPP, INC.

Inventor： Alma Dimnaku ,  Jeffrey Scott MacFarland

IPC: G06F9/50 ,  H04L29/08

Abstract: Methods and systems for a networked storage system are provided. One method includes determining by a processor, a demand pattern for a first workload that is assigned a service level objective (SLO) for using a resource of a networked storage system. The SLO is defined by an allotted performance parameter, and the demand pattern identifies a first duration when a SLO allotment for the first workload is underutilized, and a second duration when the SLO allotment is being utilized. The SLO allotment is dynamically adjusted for the first duration by modifying a parameter associated with the performance parameter, while maintaining the SLO allotment for the second duration. This makes additional performance capacity of the resource available for re-allocation. The additional available performance capacity is dynamically allocated for an identified second workload that needs an increase in SLO allotment for a certain duration and/or for provisioning a new workload.

公开(公告)号：US10313439B2

公开(公告)日：2019-06-04

申请号：US14868755

申请日：2015-09-29

Applicant: NETAPP, INC.

Inventor： Subhabrata Sen ,  Deepthi Shetty

IPC: H04L12/24 ,  H04L29/08

Abstract: Methods and systems for a networked storage system are provided. One method includes registering a resource model by a processor having a plurality of objects, each object representing a plurality of resources of a networked storage system in a same format for storing attributes of any resource type. The resource model includes a plurality of relationship objects identifying relationship types for related resources of the plurality of resources. The method includes using the resource model by the processor, to generate an empty output array for the plurality of resources by iteratively processing the relationship objects of the resource model; and dynamically populating the empty output array by the processor, in response to an application programming interface (API) request for information regarding a resource, by updating the placeholder link providing a link to the resource identified by the request.

公开(公告)号：US10313251B2

公开(公告)日：2019-06-04

申请号：US15011919

申请日：2016-02-01

Applicant: NETAPP, INC.

Inventor： Dean Alan Kalman ,  John Alexander Scott ,  Sudha Sundaram

IPC: G06F15/173 ,  H04L12/851 ,  H04L12/26 ,  H04L29/08 ,  H04L12/24 ,  G06F3/06

Abstract: Methods and systems for a networked storage system are provided. One method includes assigning a quality of service (QOS) parameter for a storage volume of a networked storage environment having a first storage node and a second storage node, where the QOS parameter is defined by a throughput value that defines a maximum data transfer rate and a number of input/output (I/O) operations executed within a time period (IOPS); distributing the QOS parameter between the first storage node and the second storage node; determining that throughput credit is available for processing an I/O request for using the storage volume; determining that IOPS credit is available for processing the request by the first storage node; and processing the I/O request when both the throughput credit and the IOPS credit is available.