公开(公告)号：US20180316758A1

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

申请号：US16010888

申请日：2018-06-18

Applicant: NETAPP, INC.

Inventor： AMIT GOLANDER ,  YIGAL KORMAN ,  SAGI MANOLE ,  BOAZ HARROSH

IPC: H04L29/08 ,  H04L12/24 ,  G06F17/30

CPC classification number: H04L67/1095 ,  G06F17/30 ,  H04L41/084 ,  H04L41/20

Abstract: Logical minoring of an initiator server running a memory aware file system to a multi-tiered target server by receiving at a first tier of the target server data that was modified at the initiator server and retaining at the first tier of the target server a first subset of the data and moving to a second tier of the target server a second subset of the data to efficiently utilize the multi-tiered target server.

公开(公告)号：US20180314551A1

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

申请号：US15583932

申请日：2017-05-01

Applicant: NETAPP, INC.

Inventor： Vinay DEVADAS ,  Matthew CURTIS-MAURY ,  Aditya KULKARNI

IPC: G06F9/48

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for optimizing thread assignment to schedulers, avoid starvation of individual data partitions, and maximize parallelism in the presence of hierarchical data partitioning are disclosed, which include: partitioning, by a network storage server, a scheduler servicing a data partitioned system into a plurality of autonomous schedulers; determining what fraction of thread resources in the data partitioned system at least one of the plurality of autonomous schedulers is to receive; and determining, with minimal synchronization, when it is time to allow the at least one of the plurality of autonomous schedulers servicing a coarse hierarchy to run.

公开(公告)号：US20180314449A1

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

申请号：US15581369

申请日：2017-04-28

Applicant: NetApp Inc.

Inventor： Ganga Bhavani Kondapalli ,  Kevin Daniel Varghese ,  Ananthan Subramanian ,  Cheryl Marie Thompson ,  Anil Paul Thoppil

IPC: G06F3/06

Abstract: Techniques are provided for multi-tier write allocation. A storage system may store data within a multi-tier storage environment comprising a first storage tier (e.g., storage devices maintained by the storage system), a second storage tier (e.g., a remote object store provided by a third party storage provider), and/or other storage tiers. A determination is made that data (e.g., data of a write request received by the storage system) is to be stored within the second storage tier. The data is stored into a staging area of the first storage tier. A second storage tier location identifier, for referencing the data according to a format utilized by the second storage tier, is assigned to the data and provided to a file system hosting the data. The data is then destaged from the staging area into the second storage tier, such as within an object stored within the remote object store.

公开(公告)号：US20180309852A1

公开(公告)日：2018-10-25

申请号：US16016455

申请日：2018-06-22

Applicant: NetApp Inc.

Inventor： Deepak Raghu KENCHAMMANA-HOSEKOTE ,  Michael R. EISLER ,  Arthur F. LENT ,  Rohul IYER ,  Shravan GAONKAR

IPC: H04L29/06 ,  H04L29/08 ,  G06F3/06 ,  G06F12/0866

Abstract: I/O bandwidth reduction using storage-level common page information is implemented by a storage server, in response to receiving a request from a client for a page stored at a first virtual address, determining that the first virtual address maps to a page that is a duplicate of a page stored at a second virtual address or that the first and second virtual addresses map to a deduplicated page within a storage system, and transmitting metadata to the client mapping the first virtual address to a second virtual address that also maps to the deduplicated page. For one embodiment, the metadata is transmitted in anticipation of a request for the redundant/deduplicated page via the second virtual address. For an alternate embodiment, the metadata is sent in response to a determination that a page that maps to the second virtual address was previously sent to the client.

公开(公告)号：US20180267874A1

公开(公告)日：2018-09-20

申请号：US15988345

申请日：2018-05-24

Applicant: NetApp Inc.

Inventor： Hrishikesh Keremane ,  Vijay Singh ,  David Andrew Allender

IPC: G06F11/20 ,  G06F3/06

CPC classification number: G06F11/2092 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0629 ,  G06F3/0683 ,  G06F11/2069 ,  G06F11/2071 ,  G06F2201/805

Abstract: One or more techniques and/or computing devices are provided for communicating storage controller failures utilizing service processor traps. A first storage controller, of a first storage cluster, has a disaster recovery relationship with a second storage controller of a second storage cluster. The first storage controller comprise a first service processor configured to monitor health of the first storage controller. Responsive to identifying a failure of the first storage controller, the first service processor uses stored communication configuration of a second service processor of the second storage controller to send a service processor trap to the second service processor. In this way, the second service processor initiates a switchover operation by the second storage controller to provide clients with failover access to data previously available through the first storage controller before the failure. Proactive notification of storage controller failures utilizing service processor traps reduces client data access disruptions.

公开(公告)号：US10078473B2

公开(公告)日：2018-09-18

申请号：US15057952

申请日：2016-03-01

Applicant: NETAPP, INC.

Inventor： Reyaz Ahmed ,  Mayank Saxena ,  Todd Jason Mills ,  Aleksandr Khasymski

IPC: G06F15/16 ,  G06F3/06 ,  H04L29/08

CPC classification number: G06F3/067 ,  G06F3/061 ,  G06F3/0659 ,  H04L29/08072 ,  H04L69/329

Abstract: Methods and systems for a storage environment are provided. A policy for an input/output (I/O) stream having a plurality of I/O requests for accessing storage at a storage device of the storage sub-system is translated into flow attributes so that the I/O stream can be assigned to one of a plurality of queues maintained for placing I/O requests based on varying priorities defined by set polices. When an I/O request for the associated policy is received by the storage sub-system; the storage sub-system determines a flow attribute associated with the I/O request and the policy; selects a queue for staging the I/O request, such that the selected queue is of either higher priority than what is indicated by the flow attribute or at least of a same priority as indicated by the flow attribute; and allocates storage sub-system resource for processing the received I/O request.

公开(公告)号：US10031822B2

公开(公告)日：2018-07-24

申请号：US15141357

申请日：2016-04-28

Applicant: NETAPP, INC.

Inventor： Alma Dimnaku ,  Curtis Hrischuk ,  Kevin Faulkner

IPC: G06F11/00 ,  G06F11/20

Abstract: Various embodiments are generally directed to techniques for determining whether one node of a HA group is able to take over for another. An apparatus includes a model derivation component to derive a model correlating node usage level to node data propagation latency through and to node resource utilization from a first model of a first node of a storage cluster system and a second model of a second node of the storage cluster system, the first model based on a first usage level of the first node under a first usage type, and the second model based on a second usage level of the second node under a second usage type; and an analysis component to determine whether the first node is able to take over for the second node based on applying to the derived model a total usage level derived from the first and second usage levels.

公开(公告)号：US10031682B1

公开(公告)日：2018-07-24

申请号：US15581742

申请日：2017-04-28

Applicant: NetApp, Inc.

Inventor： Tijin George ,  Cheryl Thompson ,  Ananthan Subramanian

IPC: G06F3/06

Abstract: A method, non-transitory computer readable medium, and computing device that receives metadata for a block associated with an object from a source storage node. The metadata comprises a source object identifier and the object is associated with a source volume of a source aggregate owned by the source storage node. A determination is made when another block associated with the object has been previously received. A destination object identifier is obtained based on the source object identifier, when the determining indicates that the other block associated with the object has been previously received. A new aggregate block number is assigned to the block based on the destination object identifier and another portion of the metadata. Ownership of the source volume is transferred upon receipt of an indication of a cutover from the source storage node in order to migrate the source volume to a destination volume of a destination aggregate.

公开(公告)号：US10013311B2

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

申请号：US15166600

申请日：2016-05-27

Applicant: NetApp, Inc.

Inventor： Rajesh Sundaram ,  Bharat Baddepudi ,  Jeffrey S. Kimmel ,  T. Byron Rakitzis

IPC: G06F11/10 ,  G06F3/06 ,  G06F17/30 ,  G11C29/52

CPC classification number: G06F11/1084 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/0653 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1008 ,  G06F11/1068 ,  G06F11/1076 ,  G06F11/108 ,  G06F11/1092 ,  G06F11/1096 ,  G06F16/1847 ,  G06F2211/1057 ,  G11C29/52

Abstract: Embodiments described herein are directed to a file system driven RAID rebuild technique. A layered file system may organize storage of data as segments spanning one or more sets of storage devices, such as solid state drives (SSDs), of a storage array, wherein each set of SSDs may form a RAID group configured to provide data redundancy for a segment. The file system may then drive (i.e., initiate) rebuild of a RAID configuration of the SSDs on a segment-by-segment basis in response to cleaning of the segment (i.e., segment cleaning). Each segment may include one or more RAID stripes that provide a level of data redundancy (e.g., single parity RAID 5 or double parity RAID 6) as well as RAID organization (i.e., distribution of data and parity) for the segment. Notably, the level of data redundancy and RAID organization may differ among the segments of the array.

公开(公告)号：US10002098B2

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

申请号：US14510859

申请日：2014-10-09

Applicant: NETAPP, INC.

Inventor： Amit Kumar Singh ,  Michael M. Loebig

IPC: G06F13/40 ,  G06F13/42

CPC classification number: G06F13/4031 ,  G06F13/4282

Abstract: Methods and systems for sharing access to a computer resource accessible by a bus between two controllers are provided. For example, a machine implemented method of sharing access to computer resources includes requesting access to a bus from a processor of a first controller to access a device shared with a processor of a second controller; waiting for a positive response from the second controller; when the positive response is received, accessing the bus for less than a first timeout period; resetting a timer before the timer reaches the first timeout period to extend access to the bus, when access is not complete and a total access time is less than a second timeout period; and releasing the bus when access is complete or the second timeout period has been reached.