-
公开(公告)号：US11194501B2
公开(公告)日：2021-12-07
申请号：US16752001
申请日：2020-01-24
Applicant: NetApp, Inc.
Inventor： James Philip Wittig , Forrest Trimbell , Daniel David McCarthy , Jared Cantwell , Mark Olson , Christopher Cason
Abstract: A technique is configured to maintain multiple copies of data served by storage nodes of a cluster during upgrade of a storage node to ensure continuous protection of the data served by the nodes. The data is logically organized as one or more volumes on storage devices of the cluster and includes metadata that describe the data of each volume. A data protection system may be configured to maintain at least two copies of the data in the cluster during upgrade to a storage node that is assigned to host one of the copies of the data but that is taken offline during the upgrade. As a result, an original slice service of the node may be rendered unavailable during the upgrade. In response, the technique redirects replicated data targeted to the original slice service to a standby pool of slice services in accordance with a degraded redundant metadata service of the cluster. In the event the standby slice service itself subsequently becomes unavailable, another standby slice service from the standby pool is activated to receive the subsequent data. In this manner, cascading failure of secondary slice slices is handled.
-
公开(公告)号：US11175989B1
公开(公告)日：2021-11-16
申请号：US16858376
申请日：2020-04-24
Applicant: NetApp, Inc.
Inventor： Sneheet Kumar Mishra , Daniel David McCarthy , Christopher Clark Corey , Austino Nicholas Longo , Christopher Cason
Abstract: A technique provides efficient data protection, such as erasure coding, for data blocks of volumes served by storage nodes of a cluster. Data blocks associated with write requests of unpredictable client workload patterns may be compressed. A set of the compressed data blocks may be selected to form a write group and an erasure code may be applied to the group to algorithmically generate one or more encoded blocks in addition to the data blocks. Due to the unpredictability of the data workload patterns, the compressed data blocks may have varying sizes. A pool of the various-sized compressed data blocks may be established and maintained from which the data blocks of the write group are selected. Establishment and maintenance of the pool enables selection of compressed data blocks that are substantially close to the same size and, thus, that require minimal padding.
-
公开(公告)号：US20240427799A1
公开(公告)日：2024-12-26
申请号：US18820543
申请日：2024-08-30
Applicant: NetApp, Inc.
Inventor： Arindam Banerjee , Daniel McCarthy , Christopher Cason , Ananthan Subramanian
IPC: G06F16/27
Abstract: Systems and methods for scaling application and/or storage system functions of a distributed storage system based on a heterogeneous resource pool are provided. According to one embodiment, the distributed storage system has a composable, service-based architecture that provides scalability, resiliency, and load balancing. The distributed storage system includes a cluster of nodes each potentially having differing capabilities in terms of processing, memory, and/or storage. The distributed storage system takes advantage of different types of nodes by selectively instating appropriate services (e.g., file and volume services and/or block and storage management services) on the nodes based on their respective capabilities. Furthermore, disaggregation of these services, facilitated by interposing a frictionless layer (e.g., in the form of one or more globally accessible logical disks) therebetween, enables independent and on-demand scaling of either or both of application and storage system functions within the cluster while making use of the heterogeneous resource pool.
-
公开(公告)号：US12079242B2
公开(公告)日：2024-09-03
申请号：US18047774
申请日：2022-10-19
Applicant: NetApp, Inc.
Inventor： Arindam Banerjee , Daniel McCarthy , Christopher Cason , Ananthan Subramanian
CPC classification number: G06F16/27
Abstract: Systems and methods for scaling application and/or storage system functions of a distributed storage system based on a heterogeneous resource pool are provided. According to one embodiment, the distributed storage system has a composable, service-based architecture that provides scalability, resiliency, and load balancing. The distributed storage system includes a cluster of nodes each potentially having differing capabilities in terms of processing, memory, and/or storage. The distributed storage system takes advantage of different types of nodes by selectively instating appropriate services (e.g., file and volume services and/or block and storage management services) on the nodes based on their respective capabilities. Furthermore, disaggregation of these services, facilitated by interposing a frictionless layer (e.g., in the form of one or more globally accessible logical disks) therebetween, enables independent and on-demand scaling of either or both of application and storage system functions within the cluster while making use of the heterogeneous resource pool.
-
公开(公告)号：US20220091739A1
公开(公告)日：2022-03-24
申请号：US17031461
申请日：2020-09-24
Applicant: NetApp, Inc.
Inventor： Ankit Kumar , Christopher Cason , Daniel David McCarthy
IPC: G06F3/06
Abstract: A technique manages bandwidth allocated among input/output operations, such as reads and writes, to storage devices coupled to storage nodes of a cluster. The technique balances the writes in a manner that reduces latency of reads, while allowing the writes to complete in a desired amount of time. The writes include write types, such as client writes, data migration writes, block transfer writes, and recycling writes, which are defined by differing characteristics and relative priorities. To ensure timely completion of the write types, the technique provides periodic time intervals over which the writes may be balanced and allocated sufficient bandwidth to access the storage devices. The time intervals may include shuffle intervals within a larger distribution interval. In addition, the technique throttles certain write types at the storage device level to maintain consistent read performance. Throttling is based on a credit system that allocates bandwidth as “credits” based on write type.
-
Patent Agency Ranking
6.发明申请公开(公告)号：US20200097404A1
公开(公告)日：2020-03-26
申请号：US16394357
申请日：2019-04-25
Applicant: NetApp, Inc.
Inventor： Christopher Cason
Abstract: A technique is configured to reduce an amount of memory (i.e., memory footprint) usage by each storage node of a cluster needed to store metadata while providing fast and efficient servicing of data in accordance with storage requests issued by a client of the cluster. Illustratively, a block identifier (ID) is used to identify a block of data serviced by the storage node. Metadata embodied as mappings between block IDs and locations of data blocks in the cluster are illustratively maintained in map fragments. A map fragment may be embodied as “active” map fragment or a “frozen” map fragment. An active map fragment refers to a map fragment that has space available to store a mapping, whereas a frozen map fragment refers to a map fragment that is full, i.e., has no available space for storing a mapping. In order to reduce the memory footprint of each storage node, yet still provide fast and efficient servicing of data by the node, the active map fragments are preferably maintained in memory as “in-core” data structures, whereas the frozen map fragments are paged-out and stored on storage devices of the cluster as “on-disk” map fragment structures.
-
公开(公告)号：US20240370410A1
公开(公告)日：2024-11-07
申请号：US18773483
申请日：2024-07-15
Applicant: NetApp, Inc.
Inventor： Ravikanth Dronamraju , Ananthan Subramanian , Daniel McCarthy , Christopher Cason , Arindam Banerjee
IPC: G06F16/188 , G06F9/50 , G06F16/182
Abstract: In various examples, data storage is managed using a distributed storage management system that is resilient. Data blocks of a logical block device may be distributed across multiple nodes in a cluster. The logical block device may correspond to a file system volume associated with a file system instance deployed on a selected node within a distributed block layer of a distributed file system. Each data block may have a location in the cluster identified by a block identifier associated with each data block. Each data block may be replicated on at least one other node in the cluster. A metadata object corresponding to a logical block device that maps to the file system volume may be replicated on at least another node in the cluster. Each data block and the metadata object may be hosted on virtualized storage that is protected using redundant array independent disks (RAID).
-
公开(公告)号：US11693737B2
公开(公告)日：2023-07-04
申请号：US17527852
申请日：2021-11-16
Applicant: NetApp, Inc.
Inventor： Sneheet Kumar Mishra , Daniel David McCarthy , Christopher Clark Corey , Austino Nicholas Longo , Christopher Cason
CPC classification number: G06F11/1076 , H03M13/154 , H03M7/3084
Abstract: A technique provides efficient data protection, such as erasure coding, for data blocks of volumes served by storage nodes of a cluster. Data blocks associated with write requests of unpredictable client workload patterns may be compressed. A set of the compressed data blocks may be selected to form a write group and an erasure code may be applied to the group to algorithmically generate one or more encoded blocks in addition to the data blocks. Due to the unpredictability of the data workload patterns, the compressed data blocks may have varying sizes. A pool of the various-sized compressed data blocks may be established and maintained from which the data blocks of the write group are selected. Establishment and maintenance of the pool enables selection of compressed data blocks that are substantially close to the same size and, thus, that require minimal padding.
-
公开(公告)号：US20220075691A1
公开(公告)日：2022-03-10
申请号：US17527852
申请日：2021-11-16
Applicant: NetApp, Inc.
Inventor： Sneheet Kumar Mishra , Daniel David McCarthy , Christopher Clark Corey , Austino Nicholas Longo , Christopher Cason
Abstract: A technique provides efficient data protection, such as erasure coding, for data blocks of volumes served by storage nodes of a cluster. Data blocks associated with write requests of unpredictable client workload patterns may be compressed. A set of the compressed data blocks may be selected to form a write group and an erasure code may be applied to the group to algorithmically generate one or more encoded blocks in addition to the data blocks. Due to the unpredictability of the data workload patterns, the compressed data blocks may have varying sizes. A pool of the various-sized compressed data blocks may be established and maintained from which the data blocks of the write group are selected. Establishment and maintenance of the pool enables selection of compressed data blocks that are substantially close to the same size and, thus, that require minimal padding.
-
公开(公告)号：US20210334160A1
公开(公告)日：2021-10-28
申请号：US16858376
申请日：2020-04-24
Applicant: NetApp, Inc.
Inventor： Sneheet Kumar Mishra , Daniel David McCarthy , Christopher Clark Corey , Austino Nicholas Longo , Christopher Cason
Abstract: A technique provides efficient data protection, such as erasure coding, for data blocks of volumes served by storage nodes of a cluster. Data blocks associated with write requests of unpredictable client workload patterns may be compressed. A set of the compressed data blocks may be selected to form a write group and an erasure code may be applied to the group to algorithmically generate one or more encoded blocks in addition to the data blocks. Due to the unpredictability of the data workload patterns, the compressed data blocks may have varying sizes. A pool of the various-sized compressed data blocks may be established and maintained from which the data blocks of the write group are selected. Establishment and maintenance of the pool enables selection of compressed data blocks that are substantially close to the same size and, thus, that require minimal padding.
-
-
-
-
-
-
-
-
-
Search Results
23
records
(took 0.018 seconds)
