Patents by Inventor Austino Nicholas Longo
Austino Nicholas Longo has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 12067256Abstract: A technique is configured to provide various data protection schemes, such as replication and erasure coding, for data blocks of volumes served by storage nodes of a cluster configured to perform deduplication of the data blocks. Additionally, the technique is configured to ensure that each deduplicated data block complies with data redundancy guarantees of the data protection schemes, while improving storage space of the storage nodes. In order to satisfy the data integrity guarantees while improving available storage space, the storage nodes perform periodic garbage collection for data blocks to optimize storage in accordance with currently applicable data protection schemes.Type: GrantFiled: September 16, 2022Date of Patent: August 20, 2024Assignee: NetApp, Inc.Inventors: Christopher Clark Corey, Daniel David McCarthy, Sneheet Kumar Mishra, Austino Nicholas Longo
-
Patent number: 11743326Abstract: A system, method, and machine-readable storage medium for providing a recommendation to a client to modify minimum IOPS settings are provided. In some embodiments, a client may assign a minimum input/output operations per second (IOPS) setting to each volume of a plurality of volumes. The plurality of volumes may reside in a common cluster and include a first number of volumes. A set of volumes of the plurality of volumes may be determined, where each volume of the set of volumes has a relative disparity that satisfies a relative threshold. The set of volumes includes a second number of volumes. A minimum IOPS recommendation may be transmitted to the client to modify (e.g., increase or decrease) the minimum IOPS settings of the set of volumes in response to determining that a ratio of the second number of volumes to the first number of volumes is greater than a performance threshold.Type: GrantFiled: April 15, 2021Date of Patent: August 29, 2023Assignee: NETAPP, INC.Inventors: Tyler Cady, Austino Nicholas Longo
-
Patent number: 11693737Abstract: 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.Type: GrantFiled: November 16, 2021Date of Patent: July 4, 2023Assignee: NetApp, Inc.Inventors: Sneheet Kumar Mishra, Daniel David McCarthy, Christopher Clark Corey, Austino Nicholas Longo, Christopher Cason
-
Publication number: 20230013281Abstract: A technique is configured to provide various data protection schemes, such as replication and erasure coding, for data blocks of volumes served by storage nodes of a cluster configured to perform deduplication of the data blocks. Additionally, the technique is configured to ensure that each deduplicated data block complies with data redundancy guarantees of the data protection schemes, while improving storage space of the storage nodes. In order to satisfy the data integrity guarantees while improving available storage space, the storage nodes perform periodic garbage collection for data blocks to optimize storage in accordance with currently applicable data protection schemes.Type: ApplicationFiled: September 16, 2022Publication date: January 19, 2023Applicant: NetApp, Inc.Inventors: Christopher Clark Corey, Daniel David McCarthy, Sneheet Kumar Mishra, Austino Nicholas Longo
-
Patent number: 11461015Abstract: A technique is configured to provide various data protection schemes, such as replication and erasure coding, for data blocks of volumes served by storage nodes of a cluster configured to perform deduplication of the data blocks. Additionally, the technique is configured to ensure that each deduplicated data block complies with data redundancy guarantees of the data protection schemes, while improving storage space of the storage nodes. In order to satisfy the data integrity guarantees while improving available storage space, the storage nodes perform periodic garbage collection for data blocks to optimize storage in accordance with currently applicable data protection schemes.Type: GrantFiled: October 15, 2019Date of Patent: October 4, 2022Assignee: NetApp, Inc.Inventors: Christopher Clark Corey, Daniel David McCarthy, Sneheet Kumar Mishra, Austino Nicholas Longo
-
Publication number: 20220075691Abstract: 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.Type: ApplicationFiled: November 16, 2021Publication date: March 10, 2022Inventors: Sneheet Kumar Mishra, Daniel David McCarthy, Christopher Clark Corey, Austino Nicholas Longo, Christopher Cason
-
Patent number: 11175989Abstract: 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.Type: GrantFiled: April 24, 2020Date of Patent: November 16, 2021Assignee: NetApp, Inc.Inventors: Sneheet Kumar Mishra, Daniel David McCarthy, Christopher Clark Corey, Austino Nicholas Longo, Christopher Cason
-
Publication number: 20210334247Abstract: A technique provides efficient management of policies for objects of a distributed storage architecture configured to service storage requests issued by one or more clients of a storage cluster. The objects may include volumes for storing data served by storage nodes of the cluster and the policies may include quality of service (QoS) policies. The technique enables dynamic grouping of the volumes as management domains and applying attributes, such as performance settings of the QoS policies, to the management domains. A group of volumes may be organized as a management domain and a QoS policy may be applied to the domain. If membership of the management domain is modified, the QoS policy is automatically applied to the added volume or stripped from the removed volume. If a performance setting of the policy is modified, the modification is atomically applied and propagated to each volume of the management domain.Type: ApplicationFiled: April 24, 2020Publication date: October 28, 2021Inventors: Austino Nicholas Longo, Jared Cantwell, Charles Randall
-
Publication number: 20210334241Abstract: A technique transitions data blocks of volumes served by storage nodes of a storage cluster from an old data protection scheme (DPS) to a new DPS in a non-disruptive manner. Slice services of the storage nodes forward the data blocks associated with write requests to the block services for storage on storage devices of the nodes. Mapping of volume logical block addresses to block identifiers are contained in slice files, wherein there is a single slice file for each volume. To transition a volume between the old and new DPSs, the slice service tags the data blocks with the new DPS when forwarding new write requests to the block services. In accordance with a background transitioning process, the slice service also retrieves every data block referenced by the to slice file and then resends the data to the block service with the new DPS.Type: ApplicationFiled: April 24, 2020Publication date: October 28, 2021Inventors: Daniel David McCarthy, Austino Nicholas Longo, Christopher Clark Corey, Sneheet Kumar Mishra
-
Publication number: 20210334160Abstract: 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.Type: ApplicationFiled: April 24, 2020Publication date: October 28, 2021Inventors: Sneheet Kumar Mishra, Daniel David McCarthy, Christopher Clark Corey, Austino Nicholas Longo, Christopher Cason
-
Publication number: 20210314394Abstract: A system, method, and machine-readable storage medium for providing a recommendation to a client to modify minimum IOPS settings are provided. In some embodiments, a client may assign a minimum input/output operations per second (IOPS) setting to each volume of a plurality of volumes. The plurality of volumes may reside in a common cluster and include a first number of volumes. A set of volumes of the plurality of volumes may be determined, where each volume of the set of volumes has a relative disparity that satisfies a relative threshold. The set of volumes includes a second number of volumes. A minimum IOPS recommendation may be transmitted to the client to modify (e.g., increase or decrease) the minimum IOPS settings of the set of volumes in response to determining that a ratio of the second number of volumes to the first number of volumes is greater than a performance threshold.Type: ApplicationFiled: April 15, 2021Publication date: October 7, 2021Inventors: Tyler Cady, Austino Nicholas Longo
-
Patent number: 11005924Abstract: A system, method, and machine-readable storage medium for providing a recommendation to a client to modify minimum IOPS settings are provided. In some embodiments, a client may assign a minimum input/output operations per second (IOPS) setting to each volume of a plurality of volumes. The plurality of volumes may reside in a common cluster and include a first number of volumes. A set of volumes of the plurality of volumes may be determined, where each volume of the set of volumes has a relative disparity that satisfies a relative threshold. The set of volumes includes a second number of volumes. A minimum IOPS recommendation may be transmitted to the client to modify (e.g., increase or decrease) the minimum IOPS settings of the set of volumes in response to determining that a ratio of the second number of volumes to the first number of volumes is greater than a performance threshold.Type: GrantFiled: April 1, 2020Date of Patent: May 11, 2021Assignee: NETAPP, INC.Inventors: Tyler Cady, Austino Nicholas Longo
-
Publication number: 20200117372Abstract: A technique is configured to provide various data protection schemes, such as replication and erasure coding, for data blocks of volumes served by storage nodes of a cluster configured to perform deduplication of the data blocks. Additionally, the technique is configured to ensure that each deduplicated data block complies with data redundancy guarantees of the data protection schemes, while improving storage space of the storage nodes. In order to satisfy the data integrity guarantees while improving available storage space, the storage nodes perform periodic garbage collection for data blocks to optimize storage in accordance with currently applicable data protection schemes.Type: ApplicationFiled: October 15, 2019Publication date: April 16, 2020Inventors: Christopher Clark Corey, Daniel David McCarthy, Sneheet Kumar Mishra, Austino Nicholas Longo