-
公开(公告)号：US20170185312A1
公开(公告)日：2017-06-29
申请号：US14979873
申请日：2015-12-28
Applicant: NetApp, Inc.
CPC classification number: G11B20/1217 , G06F3/061 , G06F3/0644 , G06F3/0689 , G11B2020/1242 , G11B2020/1292
Abstract: A storage system writes an object across zones of a set of zones (“zone set”). Each zone of a zone set is contributed from an independently accessible storage medium. To create a zone set, the storage system arbitrarily selects disks to contribute a zone for membership in the zone set. This results in a fairly even distribution of zone sets throughout the storage system, which increases fault tolerance of the storage system. Although disk selection for zone set membership is arbitrary, the arbitrary selection can be from a pool of disks that satisfy one or more criteria (e.g., health or activity based criteria). In addition, weights can be assigned to disks to influence the arbitrary selection. Although manipulating the arbitrary selection with weights or by reducing the pool of disks reduces the arbitrariness, this evenly distributes zone sets while accounting for client demand and/or disk health.
-
公开(公告)号：US20170124104A1
公开(公告)日：2017-05-04
申请号：US14929255
申请日：2015-10-31
Applicant: NetApp, Inc.
CPC classification number: G06F16/13 , G06F3/0619 , G06F3/064 , G06F3/0643 , G06F3/0689 , G06F16/148 , G11B20/1217 , G11B27/329 , G11B2020/1242 , G11B2020/1292
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). Since the write of a large object often involves multiple write operations, the writing is also referred to as “ingesting.” When ingesting an object, the durable file system writes the object with indexing information for the object to persistent storage across multiple zones that each map to an independently accessible storage medium (e.g., disks on different spindles). After persisting the indexing information with the object, the durable file system updates a file system index in working memory (e.g., non-volatile system memory) with the indexing information for the object.
-
公开(公告)号：US20170123928A1
公开(公告)日：2017-05-04
申请号：US14929226
申请日：2015-10-30
Applicant: NetApp, Inc.
CPC classification number: G06F11/1435 , G06F3/0608 , G06F3/064 , G06F3/0643 , G06F3/0676 , G06F2201/84
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). The durable file system can efficiently reclaim storage space at zone set granularity since each constituent zone can be reclaimed concurrently when the zone set is chosen for space reclamation. Furthermore, space reclamation for the durable file system does not interfere with object availability because the object data is available throughout reclamation. The durable file system copies data of a live object to a different zone set and updates the file system index before reclaiming the target zone set (e.g., before resetting write pointers to the constituent zones).
-
14.发明申请EXTENSIBLE AND ELASTIC DATA MANAGEMENT SERVICES ENGINE EXTERNAL TO A STORAGE DOMAIN 审中-公开可扩展和弹性数据管理服务引擎到外部存储域公开(公告)号：US20170031955A1
公开(公告)日：2017-02-02
申请号：US14815470
申请日：2015-07-31
Applicant: NetApp, Inc.
Inventor： Deepak Raghu Kenchammana-Hosekote , Shiva Chaitanya , Saeed Ghanbari , Barry Patrick Benight , David Anthony Slik
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.
Abstract translation: 数据管理服务架构包括在存储和计算域中运行的架构组件。 架构组件将存储请求从存储域重定向到计算域，管理从计算域分配的资源，确保符合管理资源消耗的策略，部署数据管理服务的程序代码，向部署的服务发送服务请求，并监视 部署服务。 架构组件还包括用于定位用于数据管理服务的程序代码的服务映射，以及用于监视所部署的服务并向部署的服务发送请求的服务实例信息。 由于部署的服务可以是无状态的或有状态的，所以服务体系结构还包括有状态服务的状态数据，可以根据策略和/或服务需求扩展或合同的支持资源。 架构组件还包括部署服务的容器。
-
公开(公告)号：US11709897B2
公开(公告)日：2023-07-25
申请号：US17013712
申请日：2020-09-07
Applicant: NetApp Inc.
Inventor： Deepak Raghu Kenchammana-Hosekote , Shiva Chaitanya , Saeed Ghanbari , Barry Patrick Benight , David Anthony Slik
IPC: G06F16/93 , H04L67/142 , H04L67/1097 , G06F16/20 , G06F16/10 , H04L67/63
CPC classification number: G06F16/93 , G06F16/10 , G06F16/20 , H04L67/1097 , H04L67/142 , H04L67/63
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.
-
Patent Agency Ranking
公开(公告)号：US20190238640A1
公开(公告)日：2019-08-01
申请号：US16375929
申请日：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.
-
公开(公告)号：US09916478B2
公开(公告)日：2018-03-13
申请号：US15469376
申请日：2017-03-24
Applicant: NetApp, Inc.
Inventor： David Anthony Slik
CPC classification number: G06F21/78 , H04L67/1095 , H04L67/42
Abstract: A data storage system uses the free space that is not yet filled with data after the deployment of the data store. The free space is used to store additional ‘opportunistic’ protection information for stored data, possibly above and beyond the specified protection level. As the system fills up, the additional protection information is deleted to make room for more data and specified protection information.
-
公开(公告)号：US20170318094A1
公开(公告)日：2017-11-02
申请号：US15143098
申请日：2016-04-29
Applicant: NetApp, Inc.
Inventor： David Anthony Slik
CPC classification number: H04L67/1097 , G06F3/0607 , G06F3/0631 , G06F3/067 , H04L41/12
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.
-
公开(公告)号：US20170277915A1
公开(公告)日：2017-09-28
申请号：US15469376
申请日：2017-03-24
Applicant: NetApp, Inc.
Inventor： David Anthony Slik
IPC: G06F21/78
CPC classification number: G06F21/78 , H04L67/1095 , H04L67/42
Abstract: A data storage system uses the free space that is not yet filled with data after the deployment of the data store. The free space is used to store additional ‘opportunistic’ protection information for stored data, possibly above and beyond the specified protection level. As the system fills up, the additional protection information is deleted to make room for more data and specified protection information.
-
公开(公告)号：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
31
records
(took 0.018 seconds)
