-
公开(公告)号:US20200183587A1
公开(公告)日:2020-06-11
申请号:US16359658
申请日:2019-03-20
Applicant: NetApp, Inc.
Inventor: Raymond Yu Shun Mak , Aditya Kalyanakrishnan , Song Guen Yoon , Emalayan Vairavanathan , Dheeraj Sangamkar , Chia-Chen Chu
Abstract: A system, method, and machine-readable storage medium for analyzing a state of a data object are provided. In some embodiments, the method includes receiving, at a storage device, a metadata request for the data object from a client. The data object is composed of a plurality of segments. The method also includes selecting a subset of the plurality of segments and obtaining a segment state for each segment of the subset. Each segment state indicates whether the respective segment is accessible via a backing store. The method further includes determining a most restrictive state of the one or more segment states and sending state information to the client in response to the metadata request, the state information being derived from the most restrictive state.
-
公开(公告)号:US20170242770A1
公开(公告)日:2017-08-24
申请号:US15589872
申请日:2017-05-08
Applicant: NetApp, Inc.
Inventor: Dheeraj Raghavender Sangamkar , Song Guen Yoon , Emalayan Vairavanathan , Yi Zhang
CPC classification number: G06F11/2092 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F3/1234 , G06F9/5038 , G06F11/1076 , G06F11/1402 , G06F11/1471 , G06F11/1489 , G06F11/20 , G06F11/2069 , G06F2201/805 , G06F2201/85 , G06F2211/1028 , H03M13/154 , H04L67/1097 , H04L69/40
Abstract: To ensure that there is an elected manager among storage nodes of an erasure coding group (“ECG”), an ECG manager (“ECGM”) election process is periodically performed among available storage nodes that are configured with the software to perform the services of an ECGM. When a storage node is activated, an ECGM process of the storage node begins executing and is assigned a process identifier (“PID”). A storage node can utilize a service query framework to identify other available storage nodes and retrieve their ECGM PIDs. The storage node then selects a PID according to a criterion and elects the storage node corresponding to the selected PID to be the acting ECGM. This process is performed periodically, so even if the acting ECGM storage node fails, a new ECGM is eventually selected from the available storage nodes.
-
公开(公告)号:US10929043B2
公开(公告)日:2021-02-23
申请号:US16505339
申请日:2019-07-08
Applicant: NETAPP, INC.
Inventor: Tymoteusz Altman , Yi Zhang , Dheeraj Raghavender Sangamkar , Emalayan Vairavanathan
IPC: G06F3/06
Abstract: Techniques are described for reserving space on a destination node or volume for increasing the likelihood of a successful data transfer in a distributed storage environment. A reservation may be retried at one or more destinations if the reservation fails at a first destination. In some embodiments, the data-transfer process can be paused or terminated prior to data being transferred to one or more destinations if a reservation fails. Reserving space on a destination node or volume can increase the likelihood of a successful data transfer, which can increase the likelihood of efficient resources usage in a storage system.
-
公开(公告)号:US20200278913A1
公开(公告)日:2020-09-03
申请号:US16878220
申请日:2020-05-19
Applicant: NetApp, Inc.
Inventor: Ajay Bakre , Vishnu Vardhan Chandra Kumaran , Alvin Lam , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi , Vladimir Avram , Dheeraj Raghavender Sangamkar , Oliver Seiler , Carmen Lum
Abstract: A storage management computing device obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.
-
公开(公告)号:US20200034256A1
公开(公告)日:2020-01-30
申请号:US16460404
申请日:2019-07-02
Applicant: NetApp, Inc.
Inventor: Emalayan Vairavanathan , Dheeraj Raghavender Sangamkar , Song Guen Yoon , Yi Zhang
IPC: G06F11/20 , G06F11/10 , H04L29/08 , G06F3/06 , G06F11/14 , G06F3/12 , H04L29/14 , H03M13/15 , G06F9/50
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.
-
公开(公告)号:US10152377B2
公开(公告)日:2018-12-11
申请号:US15890913
申请日:2018-02-07
Applicant: NetApp, Inc.
Inventor: Dheeraj Raghavender Sangamkar , Ajay Bakre , Vladimir Radu Avram , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi
Abstract: Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node (“node”) is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.
-
公开(公告)号:US09921910B2
公开(公告)日:2018-03-20
申请号:US14696001
申请日:2015-04-24
Applicant: NetApp, Inc.
Inventor: Dheeraj Raghavender Sangamkar , Ajay Bakre , Vladimir Radu Avram , Emalayan Vairavanathan , Viswanath Chandrasekara Bharathi
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F3/1234 , G06F11/1402 , G06F11/1471 , G06F11/1489 , G06F2211/1028 , H04L67/1097
Abstract: Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node (“node”) is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.
-
公开(公告)号:US09830091B2
公开(公告)日:2017-11-28
申请号:US14627034
申请日:2015-02-20
Applicant: NetApp, Inc.
Inventor: Vivek Venkatesan , Alvin Lam , Varun Ganesh , Emalayan Vairavanathan
IPC: G06F3/06
CPC classification number: G06F3/0619 , G06F3/0605 , G06F3/0649 , G06F3/065 , G06F3/067 , G06F3/0685
Abstract: A storage platform computing apparatus obtains a lifecycle management policy and configuration information for a cloud repository identified in the lifecycle management policy. The configuration information includes at least one access parameter for the cloud repository. The lifecycle management policy is applied to determine when an object is required to be replicated to the cloud repository in response to a received write request. A request to store the object in the cloud repository is generated, when the object is determined to be required to be stored in the cloud repository, wherein the request includes the access parameter. The request is sent to the cloud repository using a representational state transfer (REST) interface associated with the cloud repository.
-
公开(公告)号:US20170161148A1
公开(公告)日:2017-06-08
申请号:US15275046
申请日:2016-09-23
Applicant: NetApp, Inc.
CPC classification number: G06F11/1435 , G06F11/1004 , G06F11/1076 , G06F2211/109
Abstract: Techniques are disclosed for detection of loss or corruption among data chunks (i.e. silent data loss) corresponding to an object stored in an erasure-coded storage system. In one embodiment, one of the data chunks stored in a storage node is selected for integrity verification. The storage node computes a current checksum for the selected data chunk. The integrity of the data chunk is determined based upon a comparison of the current checksum for the data chunk with a stored checksum for the data chunk. In response to the checksums differing, the storage node requests recovery of the data chunk from the erasure-coded storage system. The data chunk is stored by the storage node if the data chunk is recovered.
-
公开(公告)号:US20170160982A1
公开(公告)日:2017-06-08
申请号:US15338077
申请日:2016-10-28
Applicant: NetApp, Inc.
Inventor: Tymoteusz Altman , Yi Zhang , Dheeraj Raghavender Sangamkar , Emalayan Vairavanathan
IPC: G06F3/06
CPC classification number: G06F3/0644 , G06F3/061 , G06F3/0631 , G06F3/067
Abstract: Techniques are described for reserving space on a destination node or volume for increasing the likelihood of a successful data transfer in a distributed storage environment. A reservation may be retried at one or more destinations if the reservation fails at a first destination. In some embodiments, the data-transfer process can be paused or terminated prior to data being transferred to one or more destinations if a reservation fails. Reserving space on a destination node or volume can increase the likelihood of a successful data transfer, which can increase the likelihood of efficient resources usage in a storage system.
-
-
-
-
-
-
-
-
-