-
公开(公告)号：US20200073596A1
公开(公告)日：2020-03-05
申请号：US16584124
申请日：2019-09-26
Applicant: NetApp Inc.
Abstract: The instant disclosure provides a data structure store system and a method of managing data in the store. The method includes receiving, by a data structure store management system, a request for storing data from a client. In the created data structure, each data element includes a portion of the data. On receiving a read request for at least part of the data, the data structure store management system provides at least part of the data to a recipient device. The data elements are stored in persistent memory in the form of one or more non-volatile random access devices, wherein during a time interval between receiving the storing request and providing the at least part of the data by the data structure store management system to the recipient device, the data structure store management system provides no portion of the data for writing to a hard disk drive.
-
2.发明申请METHODS FOR FACILITATING BATCH ANALYTICS ON ARCHIVED DATA AND DEVICES THEREOF 有权用于对存档数据进行批处理分析的方法及其装置公开(公告)号：US20160070766A1
公开(公告)日：2016-03-10
申请号：US14480151
申请日：2014-09-08
Applicant: NetApp, Inc.
Inventor： Atish Kathpal , Giridhar Appaji Nag Yasa
IPC: G06F17/30
CPC classification number: G06F17/30073
Abstract: A method, non-transitory computer readable medium, and archive node computing device that receives an indication of each of a plurality of archived files required to service a job from one of a plurality of compute node computing devices of an analytics tier. An optimized schedule for retrieving the archived files from one or more archive storage devices of an archive tier is generated. The optimized schedule is provided to the one of the plurality of compute node computing devices. Requests for the archived files received from the one of the plurality of compute node computing device and at least one other of the plurality of compute node computing devices, wherein the requests are sent according to the optimized schedule.
Abstract translation: 一种方法，非暂时性计算机可读介质和归档节点计算设备，其接收从分析层的多个计算节点计算设备之一服务作业所需的多个归档文件中的每一个的指示。 生成从归档层的一个或多个归档存储设备检索归档文件的优化计划。 将优化的调度提供给多个计算节点计算设备中的一个。 从多个计算节点计算设备中的一个计算设备和多个计算节点计算设备中的至少一个计算设备接收的归档文件的请求，其中根据优化的调度发送请求。
-
公开(公告)号：US11301177B2
公开(公告)日：2022-04-12
申请号：US16584124
申请日：2019-09-26
Applicant: NetApp inc.
Abstract: The instant disclosure provides a data structure store system and a method of managing data in the store. The method includes receiving, by a data structure store management system, a request for storing data from a client. In the created data structure, each data element includes a portion of the data. On receiving a read request for at least part of the data, the data structure store management system provides at least part of the data to a recipient device. The data elements are stored in persistent memory in the form of one or more non-volatile random access devices, wherein during a time interval between receiving the storing request and providing the at least part of the data by the data structure store management system to the recipient device, the data structure store management system provides no portion of the data for writing to a hard disk drive.
-
公开(公告)号：US09851908B2
公开(公告)日：2017-12-26
申请号：US14164028
申请日：2014-01-24
Applicant: NetApp, Inc.
Inventor： Atish Kathpal , Giridhar Appaji Nag Yasa
CPC classification number: G06F3/0619 , G06F3/061 , G06F3/065 , G06F3/0659 , G06F3/0686 , G06F2003/0698
Abstract: A method, device and non-transitory computer readable medium that manages read access includes organizing a plurality of requests for objects on one or more storage media, such as tapes or spin-down disks, based on at least a deadline for each of the plurality of requests. One of one or more replicas for each of the objects on the one or more storage media is selected based on one or more factors. An initial schedule for read access is generated based at least on the deadline for each of the plurality of requests, the selected one of the replicas for each of the objects, and availability of one or more drives. The initial schedule for read access on the one or more of the drives for each of the plurality of requests for the objects is provided.
-
公开(公告)号：US20220236925A1
公开(公告)日：2022-07-28
申请号：US17717487
申请日：2022-04-11
Applicant: NetApp Inc.
Abstract: The instant disclosure provides a data structure store system and a method of managing data in the store. The method includes receiving, by a data structure store management system, a request for storing data from a client. In the created data structure, each data element includes a portion of the data. On receiving a read request for at least part of the data, the data structure store management system provides at least part of the data to a recipient device. The data elements are stored in persistent memory in the form of one or more non-volatile random access devices, wherein during a time interval between receiving the storing request and providing the at least part of the data by the data structure store management system to the recipient device, the data structure store management system provides no portion of the data for writing to a hard disk drive.
-
Patent Agency Ranking
公开(公告)号：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.
-
公开(公告)号：US20160313916A1
公开(公告)日：2016-10-27
申请号：US15078929
申请日：2016-03-23
Applicant: NetApp, Inc.
IPC: G06F3/06
Abstract: The instant disclosure provides a data structure store system and a method of managing data in the store. The method includes receiving, by a data structure store management system, a request for storing data from a client. In the created data structure, each data element includes a portion of the data. On receiving a read request for at least part of the data, the data structure store management system provides at least part of the data to a recipient device. The data elements are stored in persistent memory in the form of one or more non-volatile random access devices, wherein during a time interval between receiving the storing request and providing the at least part of the data by the data structure store management system to the recipient device, the data structure store management system provides no portion of the data for writing to a hard disk drive.
Abstract translation: 本公开提供了数据结构存储系统和管理商店中的数据的方法。 该方法包括由数据结构存储管理系统接收从客户端存储数据的请求。 在创建的数据结构中，每个数据元素包括数据的一部分。 在接收至少部分数据的读取请求时，数据结构存储管理系统将至少部分数据提供给接收方设备。 数据元素以一个或多个非易失性随机接入设备的形式存储在持久存储器中，其中在接收存储请求之间的时间间隔内并且由数据结构存储管理系统向数据结构存储管理系统提供至少部分数据 收件人设备，数据结构存储管理系统不提供写入硬盘驱动器的数据的一部分。
-
公开(公告)号：US20240248651A1
公开(公告)日：2024-07-25
申请号：US18624776
申请日：2024-04-02
Applicant: NetApp Inc.
CPC classification number: G06F3/0685 , G06F3/0619 , G06F3/064 , G06F3/0644 , G06F3/067 , G06F11/10
Abstract: The instant disclosure provides a data structure store system and a method of managing data in the store. The method includes receiving, by a data structure store management system, a request for storing data from a client. In the created data structure, each data element includes a portion of the data. On receiving a read request for at least part of the data, the data structure store management system provides at least part of the data to a recipient device. The data elements are stored in persistent memory in the form of one or more non-volatile random access devices, wherein during a time interval between receiving the storing request and providing the at least part of the data by the data structure store management system to the recipient device, the data structure store management system provides no portion of the data for writing to a hard disk drive.
-
公开(公告)号：US11954373B2
公开(公告)日：2024-04-09
申请号：US17717487
申请日：2022-04-11
Applicant: NetApp Inc.
CPC classification number: G06F3/0685 , G06F3/0619 , G06F3/064 , G06F3/0644 , G06F3/067 , G06F11/10
Abstract: The instant disclosure provides a data structure store system and a method of managing data in the store. The method includes receiving, by a data structure store management system, a request for storing data from a client. In the created data structure, each data element includes a portion of the data. On receiving a read request for at least part of the data, the data structure store management system provides at least part of the data to a recipient device. The data elements are stored in persistent memory in the form of one or more non-volatile random access devices, wherein during a time interval between receiving the storing request and providing the at least part of the data by the data structure store management system to the recipient device, the data structure store management system provides no portion of the data for writing to a hard disk drive.
-
公开(公告)号：US20170249213A1
公开(公告)日：2017-08-31
申请号：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.
-
-
-
-
-
-
-
-
-
Search Results
12
records
(took 0.015 seconds)
