-
公开(公告)号:US20170178680A1
公开(公告)日:2017-06-22
申请号:US14978729
申请日:2015-12-22
Applicant: NetApp, Inc.
CPC classification number: G11B20/1217 , G06F3/0619 , G06F3/0644 , G06F3/065 , G06F3/0676 , G11B20/1889 , G11B2020/1893
Abstract: A method includes receiving a write request to write a current data block to a Shingled Magnetic Recording (SMR) storage device. In response, the current data block is written to a current physical block in an open zone of the SMR storage device. A corresponding copy of the current data block is written to a nonvolatile memory. A determination is made of whether a wandering write error occurred during the writing of the data to the open zone. In response to the wandering write error occurring, for each of the number of written physical blocks in the open zone that have the corresponding copy in the nonvolatile memory, the data in the physical block is validated using the corresponding copy. In response to validation, the data in the corresponding copy is written as corrected data for the physical block to a new zone in the SMR storage device.
-
公开(公告)号:US20170123714A1
公开(公告)日:2017-05-04
申请号:US15224255
申请日:2016-07-29
Applicant: NetApp, Inc.
IPC: G06F3/06
CPC classification number: G06F3/0643 , G06F3/0619 , G06F3/0676
Abstract: A durable file system has been designed for storage devices that do not support write in place and/or that are susceptible to errors or failures. The durable file system also facilitates organization and access of large objects (e.g., gigabytes to terabytes in size). Regardless of whether target storage devices are configured with sequential write constraints, the durable file system writes object fragments across a set of sequences or ranges of storage units, such as logical blocks. The durable file system sequentially writes an object fragment into each storage unit sequence along with indexing information for the object fragments. In addition to writing the indexing information for the object fragments into the set of storage unit sequences, the durable file system updates the file system index with the object indexing information.
-
公开(公告)号:US20160336028A1
公开(公告)日:2016-11-17
申请号:US15220650
申请日:2016-07-27
Applicant: NetApp, Inc.
Inventor: David Anthony Slik , Maxim Gerard Smith , John William Haskins, JR.
CPC classification number: G11B5/09 , G11B5/59694 , G11B20/1217 , G11B27/36 , G11B2020/1238 , G11B2020/1292 , G11B2220/2516
Abstract: Technology is disclosed for deferring storage operations (e.g., writes or reads) during hostile events. When a data storage device experiences a hostile event, e.g., a vibration, shock, etc. contact by a head of the data storage device with a disk surface can cause errors or indeed damage. The technology can cause a data storage device to suspend storage operations until the hostile event is no longer detected.
Abstract translation: 公开了用于在敌对事件期间推迟存储操作(例如,写入或读取)的技术。 当数据存储设备遇到具有磁盘表面的数据存储设备的头部的敌对事件(例如振动,冲击等)接触可能导致错误或确实的损坏。 该技术可能导致数据存储设备暂停存储操作,直到不再检测到敌对事件。
-
公开(公告)号:US20160239384A1
公开(公告)日:2016-08-18
申请号:US15143437
申请日:2016-04-29
Applicant: NetApp, Inc.
Inventor: David Anthony Slik , Barry Patrick Benight
CPC classification number: G06F11/1076 , G06F11/1092 , G06F17/30312 , G06F2003/0692 , H03M13/154 , H04L67/1097 , H04L69/40
Abstract: Systems and techniques for managing data storage are disclosed. In some aspects, a front-end node responds to a request to write an object by dividing the object into multiple source data segments. The front-end node generates redundancy data for the multiple source data segments using a rateless erasure encoding. The front-end node associates a respective subset of the redundancy data with each of the multiple source data segments, wherein each subset of redundancy data and associated source data segment form an encoded segment. The rateless erasure encoding further includes defining multiple segment-level fragments within each of the encoded segments. The front-end node transmits each of the encoded segments to a selected one of multiple storage nodes, wherein each of the selected storage nodes are selected based on a determined storage layout of the encoded segments across the multiple storage nodes. For each of the received encoded segments, the storage node generates one or more protection fragments based on redundancy data generated from the segment-level fragments and stores the segment-level fragments and corresponding protection fragments across multiple storage media devices managed by the selected storage node.
Abstract translation: 公开了用于管理数据存储的系统和技术。 在某些方面,前端节点通过将对象划分成多个源数据段来响应写入对象的请求。 前端节点使用无可擦除擦除编码生成多个源数据段的冗余数据。 前端节点将冗余数据的相应子集与多个源数据段中的每一个相关联,其中冗余数据和相关源数据段的每个子集形成编码段。 无限擦除编码还包括在每个编码段内定义多个片段级片段。 前端节点将每个编码的段传输到多个存储节点中的一个选定的一个,其中基于所确定的跨多个存储节点的编码段的存储布局来选择所选择的存储节点中的每一个。 对于每个接收到的编码段,存储节点基于从段级别片段生成的冗余数据生成一个或多个保护片段,并将片段级片段和对应的保护片段存储在由所选存储节点管理的多个存储媒体设备 。
-
公开(公告)号:US11232160B2
公开(公告)日:2022-01-25
申请号:US16375942
申请日:2019-04-05
Applicant: NetApp Inc.
Inventor: Deepak Raghu Kenchammana-Hosekote , Shiva Chaitanya , Saeed Ghanbari , Barry Patrick Benight , David Anthony Slik
Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.
-
公开(公告)号:US10514984B2
公开(公告)日:2019-12-24
申请号:US15055484
申请日:2016-02-26
Applicant: NetApp, Inc.
Inventor: David Anthony Slik , Shehbaz Jaffer , Sethuraman Subbiah , Keith Arnold Smith , Giridhar Appaji Nag Yasa , Atish Kathpal
Abstract: A rebuild node of a storage system can assess risk of the storage system not being able to provide a data object. The rebuild node(s) uses information about data object fragments to determine health of a data object, which relates to the risk assessment. The rebuild node obtains object fragment information from nodes throughout the storage system. With the object fragment information, the rebuild node(s) can assess object risk based, at least in part, on the object fragments indicated as existing by the nodes. To assess object risk, the rebuild node(s) treats absent object fragments (i.e., those for which an indication was not received) as lost. When too many object fragments are lost, an object cannot be rebuilt. The erasure coding technique dictates the threshold number of fragments for rebuilding an object. The risk assessment per object influences rebuild of the objects.
-
公开(公告)号:US20190251273A1
公开(公告)日:2019-08-15
申请号:US15897594
申请日:2018-02-15
Applicant: NETAPP, INC.
Inventor: David Anthony Slik , James Alan Kelley , Peter Shah
Abstract: Methods and systems for a networked computing system are provided. One method includes detecting that a processor executable, policy decision point (PDP) has not responded to a request for accessing data associated with a storage system; predicting a response to the request using a machine-learned, request-response association maintained by a processor executable training device; and presenting the predicted response to a processor executable, policy enforcement point (PEP) for granting access to the data and denying access to the data, based on the predicted response.
-
公开(公告)号:US10320906B2
公开(公告)日:2019-06-11
申请号:US15143098
申请日:2016-04-29
Applicant: NetApp, Inc.
Inventor: David Anthony Slik
Abstract: An archival cloud storage service can be created with cost efficient components for large scale data storage and can efficiently use these components. A frontend of the cloud storage service presents an asynchronous storage interface to consuming devices of the cloud storage service. Providing an asynchronous storage service interface avoids at least some of the state data overhead that accompanies a time constrained interface (e.g., a request-response based interface with timeouts in seconds). Backend nodes of the cloud storage service periodically query the frontend servers to select requests that the backend nodes can fulfill. Each backend node selects requests based on backend characteristics information, likely dynamic characteristics, of the backend node. Thus, the storage system underlying the cloud storage service can be considered a self-organizing storage system.
-
公开(公告)号:US20190251996A1
公开(公告)日:2019-08-15
申请号:US16394212
申请日:2019-04-25
Applicant: NetApp, Inc.
CPC classification number: G11B20/1217 , G06F3/0619 , G06F3/0644 , G06F3/065 , G06F3/0676 , G11B20/1889 , G11B2020/1893
Abstract: A method includes receiving a write request to write a current data block to a Shingled Magnetic Recording (SMR) storage device. In response, the current data block is written to a current physical block in an open zone of the SMR storage device. A corresponding copy of the current data block is written to a nonvolatile memory. A determination is made of whether a wandering write error occurred during the writing of the data to the open zone. In response to the wandering write error occurring, for each of the number of written physical blocks in the open zone that have the corresponding copy in the nonvolatile memory, the data in the physical block is validated using the corresponding copy. In response to validation, the data in the corresponding copy is written as corrected data for the physical block to a new zone in the SMR storage device.
-
公开(公告)号:US20190238641A1
公开(公告)日:2019-08-01
申请号:US16375942
申请日:2019-04-05
Applicant: NetApp Inc.
Inventor: Deepak Raghu Kenchammana-Hosekote , Shiva Chaitanya , Saeed Ghanbari , Barry Patrick Benight , David Anthony Slik
IPC: H04L29/08
CPC classification number: H04L67/142 , H04L67/1097 , H04L67/327
Abstract: A data management services architecture includes architectural components that run in both a storage and compute domains. The architectural components redirect storage requests from the storage domain to the compute domain, manage resources allocated from the compute domain, ensure compliance with a policy that governs resource consumption, deploy program code for data management services, dispatch service requests to deployed services, and monitor deployed services. The architectural components also include a service map to locate program code for data management services, and service instance information for monitoring deployed services and dispatching requests to deployed services. Since deployed services can be stateless or stateful, the services architecture also includes state data for the stateful services, with supporting resources that can expand or contract based on policy and/or service demand. The architectural components also include containers for the deployed services.
-
-
-
-
-
-
-
-
-