NetApp, Inc.

États‑Unis d’Amérique

Retour au propriétaire

1-100 de 3 318 pour NetApp, Inc. et 1 filiale Trier par
Recheche Texte
Affiner par
Type PI
        Brevet 3 220
        Marque 98
Juridiction
        États-Unis 2 995
        International 294
        Europe 16
        Canada 13
Propriétaire / Filiale
[Owner] NetApp, Inc. 3 316
Akorri Networks, Inc. 2
Date
Nouveautés (dernières 4 semaines) 15
2026 juillet 15
2026 juin 14
2026 mai 8
2026 avril 17
Voir plus
Classe IPC
G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement 1 041
G06F 17/30 - Recherche documentaire; Structures de bases de données à cet effet 426
G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat 418
G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange 345
H04L 29/08 - Procédure de commande de la transmission, p.ex. procédure de commande du niveau de la liaison 340
Voir plus
Classe NICE
09 - Appareils et instruments scientifiques et électriques 73
42 - Services scientifiques, technologiques et industriels, recherche et conception 47
41 - Éducation, divertissements, activités sportives et culturelles 21
37 - Services de construction; extraction minière; installation et réparation 13
35 - Publicité; Affaires commerciales 5
Voir plus
Statut
En Instance 288
Enregistré / En vigueur 3 030
  1     2     3     ...     34        Prochaine page

1.

Enhanced Availability Management Of Virtual Storage Volumes In File System Services

      
Numéro d'application 19036869
Statut En instance
Date de dépôt 2025-01-24
Date de la première publication 2026-07-30
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Ryan, Michael Scott
  • Pawar, Sangramsinh Pandurand
  • Brown, Jr., Joseph Allen
  • Dallas, William Derby

Abrégé

The disclosure describes systems, devices, and methods for automating the reintegration of a failed virtual storage block into a file system service upon recovery of the virtual storage block. In an example embodiment, a method performed by a storage controller in a file system service is provided. In performing the method, the storage controller determines that a virtual storage volume of an array of virtual storage volumes has become unavailable, and in response to determining that the virtual storage volume has become unavailable, pauses use of the virtual storage volume and monitors for the virtual storage volume to return to an available state. Upon the virtual storage volume returning to the available state, the storage controller tests multiple portions of the virtual storage volume. After successfully testing the multiple portions of the virtual storage volume, the storage controller commences with the use of the virtual storage volume.

Classes IPC  ?

2.

DYNAMICALLY SCALING APPLICATION AND STORAGE SYSTEM FUNCTIONS BASED ON A HETEROGENEOUS RESOURCE POOL AVAILABLE FOR USE BY A DISTRIBUTED STORAGE SYSTEM

      
Numéro d'application 19575751
Statut En instance
Date de dépôt 2026-03-23
Date de la première publication 2026-07-30
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Banerjee, Arindam
  • Mccarthy, Daniel
  • Cason, Christopher
  • Subramanian, Ananthan

Abrégé

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.

Classes IPC  ?

  • G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuéesArchitectures de systèmes de bases de données distribuées à cet effet

3.

Persisting Mutex Lock Data To Enhance Failover Handling By Storage Controllers

      
Numéro d'application 19184420
Statut En instance
Date de dépôt 2025-04-21
Date de la première publication 2026-07-30
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kumar, Ajeet
  • Kothari, Dipti Anil

Abrégé

Improved failover handling by persisting lease lock data to storage. Storage controllers of a data storage system handle client I/O requests for files or portions of files in a storage aggregate of the system. The controllers obtain lease locks on behalf of clients for the I/O requests and record lock data in the storage aggregate. If a first controller of the system fails over to a second controller, a grace period is triggered. The second controller gets the lock data from storage and processes an I/O request received from a client during the grace period. From the data, the second controller determines if the first storage controller held the lock corresponding to the I/O request. If the first storage controller held the lock, the second controller immediately executes the request. Where the first storage controller did not hold the lock, the second controller obtains the lock to execute the request.

Classes IPC  ?

  • G06F 9/52 - Synchronisation de programmesExclusion mutuelle, p. ex. au moyen de sémaphores
  • H04L 67/1097 - Protocoles dans lesquels une application est distribuée parmi les nœuds du réseau pour le stockage distribué de données dans des réseaux, p. ex. dispositions de transport pour le système de fichiers réseau [NFS], réseaux de stockage [SAN] ou stockage en réseau [NAS]

4.

Node Fencing In Storage Clusters

      
Numéro d'application 19036914
Statut En instance
Date de dépôt 2025-01-24
Date de la première publication 2026-07-30
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Ahmed, Reyaz
  • Mills, Todd Jason
  • Khasymski, Aleksandr Sergeev
  • Thekkalore Srinivasa, Rahul

Abrégé

Techniques and systems for enhanced storage system management and failure detection/mitigation are presented. In one example, a method includes, responsive to detection of a trigger event for a first host node monitored by at least a second host node, initiating fencing of the first host node by at least transferring a fencing notification to a controller module for a set of storage drives assigned to the first host node. The method also includes preventing the first host node from communicating with the set of storage drives, and alerting a client node communicating with the first host node that the second host node is handling communication with the set of storage drives.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
  • G06F 11/16 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel

5.

Dynamic Balancing Between Stability And Cost Optimization In Compute Clusters

      
Numéro d'application 19062463
Statut En instance
Date de dépôt 2025-02-25
Date de la première publication 2026-07-23
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Glikson, Alexander
  • Gurfinkel, Oren
  • Verhovsky, Oleg

Abrégé

The disclosure describes a node management service that dynamically adjusts resource allocations for workloads in a compute cluster by balancing cost and stability considerations. The node management service implements a disruption budget that allows for a predetermined level of disruptions of applications within the workload. As the disruption level of the workload approaches the disruption budget, the node management service initiates disruption reduction actions that lower the likelihood of further disruptions.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]
  • G06F 9/54 - Communication interprogramme

6.

Fast recovery of synchronous replication to minimize disruption in a cross-site distributed storage system

      
Numéro d'application 19034425
Numéro de brevet 12688100
Statut Délivré - en vigueur
Date de dépôt 2025-01-22
Date de la première publication 2026-07-21
Date d'octroi 2026-07-21
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kaushik, Akhil
  • Vijayan, Anoop
  • Shetty, Sohan
  • Shenoy, Preetham Kudgi
  • Narasingarayanapeta, Krishna Murthy Chandraiah Setty

Abrégé

OP logs are utilized for fast recovery of synchronous replication in a storage system. According to one embodiment, a computer-implemented method comprises establishing synchronous replication between one or more storage objects of a first consistency group (CG1) of a primary storage site and one or more storage objects of a second consistency group (CG2) of a secondary storage site, initiating a peer health check to determine a health condition of the primary storage site and concurrently initiating a create snapshot process to create a snapshot of one or more storage objects of the CG2 of the secondary storage site in response to detection of missing heartbeat communications from the primary storage site, and performing inflight tracking replay and reconciliation between a first Op log of the primary storage site and a second Op log of the secondary storage site when an out of sync state or failover occurs.

Classes IPC  ?

  • G06F 11/00 - Détection d'erreursCorrection d'erreursContrôle de fonctionnement
  • G06F 11/1446 -
  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange

7.

Managing Parity Operations Using Controller-Specific Parity Bitmaps

      
Numéro d'application 19553532
Statut En instance
Date de dépôt 2026-03-02
Date de la première publication 2026-07-09
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Urkude, Suhas Girish
  • De, Tandra
  • Gupta, Ratnesh
  • Nachenahalli Bhuthegowda, Bharath Kumar
  • Seeralan, Deepan Natesan

Abrégé

The disclosure describes systems, devices, and methods for tracking operations of controllers in a data storage environment on a per-controller basis. In an implementation, a method for re-assigning responsibility of individual controller-owned parity bitmap sections and re-performing an incomplete operation is provided. In the method, a controller detects a failure of a first controller and responsively assign responsibility for a second of a parity bitmap previously assigned to the first controller to the second controller. The controller directs the second controller to read the assigned section of the parity bitmap. The controller further directs the second controller to, for a status indicator in the section indicating incomplete, compute new parity data based on source data associated with the status indicator, store the new parity data in the section, and update the status indicator from incomplete to complete.

Classes IPC  ?

  • G06F 11/10 - Détection ou correction d'erreur par introduction de redondance dans la représentation des données, p. ex. en utilisant des codes de contrôle en ajoutant des chiffres binaires ou des symboles particuliers aux données exprimées suivant un code, p. ex. contrôle de parité, exclusion des 9 ou des 11

8.

MANAGING ALLOCATION OF STORAGE BLOCKS OF A DISTRIBUTED STORAGE SYSTEM HAVING MULTIPLE STORAGE NODES WITH DISAGGREGATED STORAGE

      
Numéro d'application 19556719
Statut En instance
Date de dépôt 2026-03-04
Date de la première publication 2026-07-09
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Patel, Manan
  • Thoppil, Anil Paul
  • Subramanian, Ananthan
  • Mattankot, Nikhil
  • Yang, Jungsook

Abrégé

In one embodiment, a method comprises providing a first dynamically extensible file system (DEFS) of a first node and a second DEFS of a second node of a storage cluster having a disaggregated storage space within a storage pod, detecting, with the first DEFS of the first node, blocks and associated physical volume block numbers (PVBNs) to be freed, determining whether the first DEFS owns or does not own an allocation area (AA) having the PVBNs to be freed, and transferring non-owned PVBNs to be freed to a remote free log of the first DEFS when the AA having the PVBNs to be freed is not owned or assigned to the first DEFS.

Classes IPC  ?

  • G06F 12/02 - Adressage ou affectationRéadressage

9.

Method And System For Anomaly Management In A Storage Environment

      
Numéro d'application 19014856
Statut En instance
Date de dépôt 2025-01-09
Date de la première publication 2026-07-09
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Sood, Ankit Kumar
  • Sinha, Saket Kumar

Abrégé

Systems, methods, and software are disclosed herein relating to processing telemetry data of a storage environment for anomaly detection in various implementations. In an implementation, a computing apparatus detects a sequence of missing data in telemetry data associated with a user of a data storage environment and verifies the user was active during a time period of the sequence of missing data. Upon verification, the computing apparatus generates synthetic data to replace the sequence of missing data; the synthetic data is based on activity data of users similar to the given user. The computing apparatus generates augmented data with the telemetry data and the synthetic data and incorporates the augmented data into a historical user activity profile. The computing apparatus detects anomalous behavior in the storage environment based on a comparison of new telemetry data with the historical user activity profile and takes corrective action associated with the anomalous behavior.

Classes IPC  ?

  • G06F 16/215 - Amélioration de la qualité des donnéesNettoyage des données, p. ex. déduplication, suppression des entrées non valides ou correction des erreurs typographiques
  • G06F 16/23 - Mise à jour

10.

Temporary Local Protection Against Data Loss When A Node Fails In A Distributed Storage System

      
Numéro d'application 19539657
Statut En instance
Date de dépôt 2026-02-13
Date de la première publication 2026-07-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Mears, Morgan
  • Fink, Samuel
  • Grygo, Kyle

Abrégé

The technology disclosed herein enhances data protection in a distributed storage system. In a particular example, a method includes determining a drive in a subject node of the distributed storage system has failed while storing first data of a data set distributed across nodes of the distributed storage system by a data protection mechanism. The method further includes broadcasting failure information indicating the data set from the subject node to other nodes of the distributed storage system. At the other nodes, in response to receiving the failure information, the method includes identifying a subset of the other nodes that also store a portion of the data set. In each identified node of the subset, the method includes identifying second data of the data set stored on a local drive and copying the second data to a different local drive to protect the data set from further drive failure.

Classes IPC  ?

11.

REDUCING STABLE DATA EVICTION WITH SYNTHETIC BASELINE SNAPSHOT AND EVICTION STATE REFRESH

      
Numéro d'application 19547246
Statut En instance
Date de dépôt 2026-02-23
Date de la première publication 2026-07-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kushwah, Ajay Pratap Singh
  • Zheng, Ling
  • Jain, Sharad

Abrégé

With a forever incremental snapshot configuration and a typical caching policy (e.g., least recently used), a storage appliance may evict stable data blocks of an older snapshot, perhaps unchanged data blocks of the snapshot baseline. If stable data blocks have been evicted, restore of a recent snapshot will suffer the time penalty of downloading the stable blocks for restoring the recent snapshot. Creating synthetic baseline snapshots and refreshing eviction data of stable data blocks can avoid eviction of stable data blocks and reduce the risk of violating a recovery time objective.

Classes IPC  ?

12.

FACILITATING SHARING OF A NAMESPACE OF AN EPHEMERAL STORAGE DEVICE BY MULTIPLE CONSUMERS OF A VIRTUAL STORAGE SYSTEM

      
Numéro d'application 19433354
Statut En instance
Date de dépôt 2025-12-26
Date de la première publication 2026-07-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Brown, Jr., Joseph
  • Takimoto, Javier Tsuyoshi
  • Pawar, Sangramsinh Pandurang
  • Ryan, Michael Scott

Abrégé

Systems and methods for sharing a namespace of an ephemeral storage device by multiple consumers are provided. In an example, a storage driver (e.g., a non-volatile memory express (NVMe) driver) of a virtual storage system deployed within a compute instance of a cloud environment facilitates sharing of the namespace by exposing an application programming interface (AP)I through which the multiple consumers access an ephemeral storage device associated with the compute instance. During initialization processing performed by each consumer, for example, during boot processing of the virtual storage system, the consumers may share the namespace by reserving for their own use respective partitions within the namespace via the API and thereafter restrict their usage of the namespace to their respective partitions.

Classes IPC  ?

  • G06F 9/455 - ÉmulationInterprétationSimulation de logiciel, p. ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation

13.

IDENTIFYING ANOMALOUS ACTIVITIES IN A CLOUD COMPUTING ENVIRONMENT

      
Numéro d'application 19544491
Statut En instance
Date de dépôt 2026-02-19
Date de la première publication 2026-07-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Shen, Yun
  • Benameur, Azzedine
  • Ough, Alex Xeong-Hoon
  • Schwartz, Idan

Abrégé

Systems and methods for identifying anomalous activities in a cloud computing environment are provided. According to one embodiment, a customer's infrastructure may be fortified by leveraging deep learning technology (e.g., an encoder-decoder machine-learning (ML) model) to predict events in the cloud environment. During a training phase, the ML model may be trained to make a prediction regarding a next event based on a predetermined or configurable length of a sequence of contextual events. For example, historical events (e.g., cloud application programming interface (API) events logged to a cloud activity trace) observed within the customer's cloud infrastructure over the course of a particular date range may be split into appropriate event/context pairs and fed to the ML model. Subsequently, during a run-time anomaly detection phase, the ML model may be used to predict a next event based on a sequence of immediately preceding events to facilitate identification of anomalous activity.

Classes IPC  ?

  • H04L 9/40 - Protocoles réseaux de sécurité
  • H04L 41/16 - Dispositions pour la maintenance, l’administration ou la gestion des réseaux de commutation de données, p. ex. des réseaux de commutation de paquets en utilisant l'apprentissage automatique ou l'intelligence artificielle

14.

APPLICATION PROGRAMMING INTERFACE (API) SECURITY

      
Numéro d'application 19544514
Statut En instance
Date de dépôt 2026-02-19
Date de la première publication 2026-07-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Benameur, Azzedine
  • Shen, Yun

Abrégé

Systems and methods for enhancing API security by identifying anomalous activities in a cloud environment are provided. In one example, the lack of awareness of an external API with respect to how calls to the external API may affect a cluster of a container orchestration platform is addressed. For instance, the views of the external and internal APIs may be combined to achieve better API security by correlating external API calls with undesirable behavior or other anomalies arising in the internal API. Responsive to identifying such undesirable behavior, information (e.g., a host, a source IP, a user, a specific payload) associated with the offending external API call may be added to a network security feature (e.g., a deny list, an IPS, or a WAF) utilized by the external API to facilitate performance of enhanced filtering of subsequent external API calls by the external API on behalf of the internal API.

Classes IPC  ?

15.

Stateful Application Persistency For Reclaimable Compute Instances

      
Numéro d'application 19546849
Statut En instance
Date de dépôt 2026-02-23
Date de la première publication 2026-07-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kesari, Yarden Joshua
  • Hrafnsson, Eirikur Sveinn

Abrégé

Disclosed herein are methods and systems for the operation of a resource management service. The resource management service deploys reclaimable compute instances from a resource pool and continuously generates predicted remaining lifespans for the deployed reclaimable compute instances. The predicted remaining lifespan is monitored to determine if the predicted remaining lifespan is below a threshold value. In response to the predicted remaining lifespan for a reclaimable compute instance falling below a threshold value, the resource management service instructs the reclaimable compute instance to create an application state snapshot of an application running thereon. A subsequent compute instance is deployed from the resource pool, on which the application can be restored to a previous state using the application state snapshot.

Classes IPC  ?

  • G06F 11/1446 -
  • G06F 9/455 - ÉmulationInterprétationSimulation de logiciel, p. ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation

16.

METHODS AND SYSTEMS FOR AUTOMATED DOCUMENT CLASSIFICATION WITH PARTIALLY LABELED DATA USING SEMI-SUPERVISED LEARNING

      
Numéro d'application 19437274
Statut En instance
Date de dépôt 2025-12-30
Date de la première publication 2026-06-25
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Bali, Adam
  • Alaluf, Yuval

Abrégé

A method, a computing device, and a non-transitory machine-readable medium for classifying documents. A document collection is sorted into a plurality of categories. A classifier corresponding to a category of the plurality of categories is trained to output a probability that a document associated with the category is of a selected type (e.g., confidential). The training includes determining, by the processor, that a cardinality of a set of negative samples in a train set is not above a pipeline threshold but is at least one and training the classifier via a first pipeline and a second pipeline using a training group that includes a first portion of a group of positive samples in the train set, a second portion of a set of negative samples in the train set, and a third portion of a group of unlabeled samples in the train set

Classes IPC  ?

  • G06F 18/214 - Génération de motifs d'entraînementProcédés de Bootstrapping, p. ex. ”bagging” ou ”boosting”
  • G06F 18/23213 - Techniques non hiérarchiques en utilisant les statistiques ou l'optimisation des fonctions, p. ex. modélisation des fonctions de densité de probabilité avec un nombre fixe de partitions, p. ex. K-moyennes
  • G06F 18/2415 - Techniques de classification relatives au modèle de classification, p. ex. approches paramétriques ou non paramétriques basées sur des modèles paramétriques ou probabilistes, p. ex. basées sur un rapport de vraisemblance ou un taux de faux positifs par rapport à un taux de faux négatifs
  • G06N 20/00 - Apprentissage automatique

17.

Graph Database Storage Optimization

      
Numéro d'application 19537736
Statut En instance
Date de dépôt 2026-02-12
Date de la première publication 2026-06-25
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Ough, Alex Xeong-Hoon
  • Shen, Yun
  • Benameur, Azzedine

Abrégé

Systems and methods are disclosed for implementing a process for graph database storage optimization, applicable to delta-based cloud asset tracking. In certain embodiments, a method may comprise implementing a delta-based graph storage optimization system for asset tracking in a cloud environment, including storing a graph database representing a configuration of a cloud environment, obtaining configuration settings representing a current state of the cloud environment from a cloud platform, and identifying a delta based on changes between the configuration from the graph database and the configuration settings from the cloud platform. The method may further comprise creating an asset property node based on the delta, and adding the asset property node to the graph database without creating a new graph based on the configuration settings.

Classes IPC  ?

  • G06F 16/901 - IndexationStructures de données à cet effetStructures de stockage
  • G06F 16/25 - Systèmes d’intégration ou d’interfaçage impliquant les systèmes de gestion de bases de données

18.

Dynamic Management Of Node Headroom To Accommodate Startup Spikes

      
Numéro d'application 19036949
Statut En instance
Date de dépôt 2025-01-24
Date de la première publication 2026-06-25
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Glikson, Alexander
  • Gurfinkel, Oren
  • Kramer, Roi
  • Susman, Baruch Mordechai
  • Shafir, Tal Shmuel
  • Hoffman, Oded

Abrégé

The disclosure describes a node management service that dynamically adjusts node capacity in orchestration platforms. The service leverages an extended resource definition to reflect the increased resource needs during the startup phase of workloads, then reallocates these resources once the workload transitions to steady-state operation. Workloads are provisioned with both a native resource request and an extended resource request to cover initialization spikes. Once initialization completes, the node management service updates the node's metadata to increase available extended resource capacity, thereby freeing up headroom for future deployments.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]
  • G06F 9/445 - Chargement ou démarrage de programme

19.

SELECTIVELY BYPASSING AN EXTERNAL CACHE OF A STORAGE SYSTEM BASED ON SATURATION MONITORING RELATING TO THE EXTERNAL CACHE

      
Numéro d'application 19183975
Statut En instance
Date de dépôt 2025-04-21
Date de la première publication 2026-06-25
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Takimoto, Javier Tsuyoshi
  • Hajkazemi, Mohammad Hossein
  • Brown, Jr., Joseph

Abrégé

Systems and methods for selectively bypassing an external cache (EC) of a storage system are provided. In one example, when the EC backing storage device is saturated, reads bypass the EC and are completed via a redundant array of independent disks (RAID) subsystem of the storage system. One or more performance metrics for the EC backing storage device may be monitored to predict one or more saturation thresholds (e.g., in terms of latency and/or throughput). Based on this monitoring, tuning may be performed to drive utilization of the EC into a “knee region” of a performance (or response) curve of the EC backing storage device. For example, the depth of one or more request queues at the front-end of an EC lookup may be manipulated based on a current measure of saturation relating to the EC backing storage device to limit the number of in-flight reads pending for the EC.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement
  • G06F 11/34 - Enregistrement ou évaluation statistique de l'activité du calculateur, p. ex. des interruptions ou des opérations d'entrée–sortie

20.

SELECTIVELY BYPASSING AN EXTERNAL CACHE OF A STORAGE SYSTEM FOR LARGE READS BASED ON SATURATION LATENCY AND THROUGHPUT OF THE EXTERNAL CACHE

      
Numéro d'application 19183981
Statut En instance
Date de dépôt 2025-04-21
Date de la première publication 2026-06-25
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Takimoto, Javier Tsuyoshi
  • Hajkazemi, Mohammad Hossein
  • Brown, Jr., Joseph

Abrégé

Systems and methods for selectively bypassing an external cache (EC) of a storage system are provided. In one example, when the EC backing storage device is saturated, reads bypass the EC and are completed via a redundant array of independent disks (RAID) subsystem of the storage system. One or more performance metrics for the EC backing storage device may be monitored to predict one or more saturation thresholds (e.g., in terms of latency and/or throughput). Based on this monitoring, tuning may be performed to drive utilization of the EC into a “knee region” of a performance (or response) curve of the EC backing storage device. For example, the depth of one or more request queues at the front-end of an EC lookup may be manipulated based on a current measure of saturation relating to the EC backing storage device to limit the number of in-flight reads pending for the EC.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

21.

SWITCHING BETWEEN WRITE JOURNALING MODES FOR A HIGH-AVAILABILITY STORAGE SYSTEM CONFIGURATION FOR FAILOVER SCENARIOS

      
Numéro d'application 19281137
Statut En instance
Date de dépôt 2025-07-25
Date de la première publication 2026-06-25
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Brown, Jr., Joseph
  • Takimoto, Javier Tsuyoshi
  • Ryan, Michael Scott

Abrégé

Systems and methods for performing journal swapping are provided. In one example, the backing storage used for virtual non-volatile random access memory (vNVRAM) is dynamically switched based on the high-availability (HA) state of an HA pair of nodes of a virtual storage system. By default, in-memory logging may be used for write journaling when the HA pair is operating in a normal HA state. When the HA pair is in an HA degraded state, the write journaling may be performed to local ephemeral storage. This allows the file system of the virtual storage system to run in a more performant configuration most of the time (e.g., during which HA is enabled and healthy). At the same time, the file system has the ability to swap to a less performant but more resilient configuration during planned events (e.g., scheduled maintenance and throughput scaling) in which HA is in a degraded state.

Classes IPC  ?

  • G06F 12/02 - Adressage ou affectationRéadressage

22.

SWITCHING BETWEEN WRITE JOURNALING MODES FOR A HIGH-AVAILABILITY STORAGE SYSTEM CONFIGURATION FOR FAILBACK SCENARIOS

      
Numéro d'application 19281159
Statut En instance
Date de dépôt 2025-07-25
Date de la première publication 2026-06-25
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Brown, Jr., Joseph
  • Takimoto, Javier Tsuyoshi
  • Ryan, Michael Scott

Abrégé

Systems and methods for performing journal swapping are provided. In one example, the backing storage used for virtual non-volatile random access memory (vNVRAM) is dynamically switched based on the high-availability (HA) state of an HA pair of nodes of a virtual storage system. By default, in-memory logging may be used for write journaling when the HA pair is operating in a normal HA state. When the HA pair is in an HA degraded state, the write journaling may be performed to local ephemeral storage. This allows the file system of the virtual storage system to run in a more performant configuration most of the time (e.g., during which HA is enabled and healthy). At the same time, the file system has the ability to swap to a less performant but more resilient configuration during planned events (e.g., scheduled maintenance and throughput scaling) in which HA is in a degraded state.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange

23.

Methods and Systems for Automated Detection of Personal Information Using Neural Networks

      
Numéro d'application 19389851
Statut En instance
Date de dépôt 2025-11-14
Date de la première publication 2026-06-18
Propriétaire NetApp, Inc. (USA)
Inventeur(s) Bali, Adam

Abrégé

A method, a computing device, and a non-transitory machine-readable medium for detecting personal information. Terms that are of interest are extracted from a corpus of raw text that has been extracted from a collection of documents. For each of the terms, a surrounding sentence is extracted to form a target sentence to thereby form a plurality of target sentences. The surrounding sentence includes at least one reference to a data subject. A matrix of feature information is generated for each of the target sentences to form a plurality of matrices. A neural network model is trained, using the matrices as input, to compute an output that indicates a likelihood of a given sentence containing personal information.

Classes IPC  ?

  • G06F 40/284 - Analyse lexicale, p. ex. segmentation en unités ou cooccurrence
  • G06F 40/205 - Analyse syntaxique
  • G06F 40/253 - Analyse grammaticaleCorrigé du style

24.

METHODS AND SYSTEMS FOR HANDLING RACE CONDITIONS ASSOCIATED WITH A PRIMARY BIAS STATE IN A DISTRIBUTED STORAGE SYSTEM

      
Numéro d'application 19538245
Statut En instance
Date de dépôt 2026-02-12
Date de la première publication 2026-06-18
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Shetty, Sohan
  • Vijayan, Anoop
  • Kaushik, Akhil
  • Chaudhary, Rohit

Abrégé

According to an example, a computer-implemented method comprises initiating a first process for atomically setting the primary bias state with a first node of a primary storage cluster of a multi-site distributed storage system due to a temporary loss of connectivity to a mediator or a temporary mediator failure, releasing an atomic lock for the first process on the first node of the primary storage cluster, sending the first process and an associated first generation indicator to a first node of a secondary storage cluster of the multi-site distributed storage system to handle the first process for setting the primary bias state, and initiating a second process for atomically clearing a primary bias state with the first node or any node of the primary storage cluster based on detecting a connection to the mediator or detecting that the mediator is available.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

25.

Cross-Shelf Data Replication

      
Numéro d'application 18980516
Statut En instance
Date de dépôt 2024-12-13
Date de la première publication 2026-06-18
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Makam, Sumith
  • Subramanian, Ananthan
  • Jernigan, Iv, Richard Parvin
  • George, Tijin

Abrégé

The disclosure describes systems, devices, and methods for replicating metadata in data storage environments. In an example embodiment, a method for operating a controller in a data storage environment to provide cross-shelf data replication is provided. In performing the method, the controller generates metadata for an input/output (I/O) request upon receiving the I/O request. The controller identifies a primary location at which to store the metadata and identifies a secondary location at which to store a replicated version of the metadata, then stores the metadata at the primary location and the replicated version at the secondary location. The primary and secondary locations correspond to storage devices in the data storage environment located on different physical shelves or enclosures, such that the metadata is stored across multiple drive shelves for redundancy and recovery purposes.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange

26.

Cross-Grid Replication Within A Distributed Storage System

      
Numéro d'application 19529554
Statut En instance
Date de dépôt 2026-02-04
Date de la première publication 2026-06-18
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Yoon, Song Guen
  • Veloso, Samuel Christian
  • Kent, Gregory
  • Edwards, Blake
  • Seiler, Oliver

Abrégé

Various embodiments of the present technology generally relate to systems and methods for providing cross-grid replication within distributed storage systems. In an example, a method includes identifying an object for ingest into a first storage grid containing a first distributed storage system and replicating the object to one or more nodes within the first storage grid. The method may also include determining a cross-grid replication status of the object to a second storage grid containing a second distributed storage system and performing a cross-grid replication of the object to the second storage grid based on the cross-grid replication status of the object.

Classes IPC  ?

  • G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuéesArchitectures de systèmes de bases de données distribuées à cet effet
  • G06F 16/23 - Mise à jour

27.

ENHANCING CONTAINER SECURITY BY PERFORMING CONTAINER VULNERABILITY REDUCTION BASED ON LIBRARY AND/OR FUNCTION REMOVAL AND SYSTEM CALL BLOCKING

      
Numéro d'application 19534955
Statut En instance
Date de dépôt 2026-02-10
Date de la première publication 2026-06-18
Propriétaire NetApp, Inc. (USA)
Inventeur(s) Benameur, Azzedine

Abrégé

Systems and methods for enhancing container security are provided. In one example, exposure of a containerize application to potential security vulnerabilities is reduced by identifying dynamically loaded symbols by the application via performance of static and/or dynamic symbol analysis to identify dynamically loaded symbols that are potentially and/or actually used, respectively, and that correspond to functions contained within shared libraries. Based on a shared library's usage of functions within a standard library and a known mapping between functions of the standard library and system calls, those system calls potentially and actually accessed by the application may be identified and a security policy may be generated and configured for enforcement by a kernel security module to limit system call usage accordingly. Additionally, removal of files or functions of libraries that are deemed unnecessary for proper execution of the applications may be performed to reduce the footprint of the application.

Classes IPC  ?

  • G06F 21/57 - Certification ou préservation de plates-formes informatiques fiables, p. ex. démarrages ou arrêts sécurisés, suivis de version, contrôles de logiciel système, mises à jour sécurisées ou évaluation de vulnérabilité
  • G06F 8/75 - Analyse structurelle pour la compréhension des programmes
  • G06F 21/51 - Contrôle des utilisateurs, des programmes ou des dispositifs de préservation de l’intégrité des plates-formes, p. ex. des processeurs, des micrologiciels ou des systèmes d’exploitation au stade du chargement de l’application, p. ex. en acceptant, en rejetant, en démarrant ou en inhibant un logiciel exécutable en fonction de l’intégrité ou de la fiabilité de la source
  • G06F 21/56 - Détection ou gestion de programmes malveillants, p. ex. dispositions anti-virus

28.

MAINTAINING TIMESTAMP PARITY OF OBJECTS WITH ALTERNATE DATA STREAMS DURING TRANSITION PHASE TO SYNCHRONOUS STATE

      
Numéro d'application 19455718
Statut En instance
Date de dépôt 2026-01-21
Date de la première publication 2026-06-04
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Narasingarayanapeta, Krishna Murthy Chandraiah Setty
  • Shenoy, Preetham Kudgi

Abrégé

Techniques are provided for maintaining timestamp parity during a transition replay phase to a synchronous state. During a transition logging phase where metadata operations executed by a primary node are logged into a metadata log and regions modified by data operations executed by the primary node are tracked within a dirty region log, a close stream operation to close a stream associated with a basefile of the primary node is identified. A determination is made as to whether the dirty region log comprises an entry for the stream indicating that a write data operation previously modified the stream. In an example, in response to the dirty region log comprising the entry, an indicator is set to specify that the stream was deleted by the close stream operation. In another example, a modify timestamp of the basefile is logged into the metadata log for subsequent replication to the secondary node.

Classes IPC  ?

  • G06F 16/23 - Mise à jour
  • G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuéesArchitectures de systèmes de bases de données distribuées à cet effet

29.

DEFRAGMENTATION FOR LOG STRUCTURED MERGE TREE TO IMPROVE READ AND WRITE AMPLIFICATION

      
Numéro d'application 19459674
Statut En instance
Date de dépôt 2026-01-26
Date de la première publication 2026-06-04
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Thoppil, Anil Paul
  • Sun, Wei
  • Odugoudar, Meera
  • Kuo, Szu-Wen
  • Selvaraj, Santhosh

Abrégé

Techniques are provided for implementing a defragmentation process during a merge operation performed by a re-compaction process upon a log structured merge tree. The log structured merge tree is used to store keys of key-value pairs within a key-value store. As the log structured merge tree fills with keys over time, the re-compaction process is performed to merge keys down to lower levels of the log structured merge tree to re-compact the keys. Re-compaction can result in fragmentation because there is a lack of spatial locality of where the re-compaction operations re-writes the keys within storage. Fragmentation increases read and write amplification when accessing the keys stored in different locations within the storage. Accordingly, the defragmentation process is performed during a last merge operation of the re-compaction process in order to store keys together within the storage, thus reducing read and write amplification when accessing the keys.

Classes IPC  ?

  • G06F 16/174 - Élimination de redondances par le système de fichiers
  • G06F 16/182 - Systèmes de fichiers distribués

30.

METHODS AND SYSTEMS FOR A NON-DISRUPTIVE AUTOMATIC UNPLANNED FAILOVER FROM A PRIMARY COPY OF DATA AT A PRIMARY STORAGE SYSTEM TO A MIRROR COPY OF THE DATA AT A CROSS-SITE SECONDARY STORAGE SYSTEM

      
Numéro d'application 19177974
Statut En instance
Date de dépôt 2025-04-14
Date de la première publication 2026-05-28
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Bhargava, Rakesh
  • Kaushik, Akhil
  • Kathiresan, Divya
  • Verma, Mukul

Abrégé

Multi-site distributed storage systems and computer-implemented methods are described for providing an automatic unplanned failover (AUFO) feature to guarantee non-disruptive operations (e.g., operations of business enterprise applications, operations of software application) even in the presence of failures including, but not limited to, network disconnection between multiple data centers and failures of a data center or cluster.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
  • G06F 11/07 - Réaction à l'apparition d'un défaut, p. ex. tolérance de certains défauts
  • G06F 11/1446 -
  • G06F 11/30 - Surveillance du fonctionnement

31.

Data Format And Compression For Storage System Monitoring Data Signals

      
Numéro d'application 19451484
Statut En instance
Date de dépôt 2026-01-16
Date de la première publication 2026-05-21
Propriétaire NetApp, Inc. (USA)
Inventeur(s) Rolo, Carlos Da Silva D'Orey Juzarte

Abrégé

Various embodiments of the present disclosure relate to compression techniques that can be used for data storage, indexing, and retrieval. In an example embodiment, a controller of or in communication with a data storage system can obtain a request to store a file in the data storage system. The controller identifies time-series data associated with input/output of the file and metrics of the file, generates a feature vector for the file, and compresses the feature vector using a compression technique, resulting in a compressed feature vector having a compression ratio. The controller performs a hash algorithm using the compression ratio to determine a storage device at which to store the compressed feature vector, the compression ratio associated with the file, and an indication of the compression technique. Upon receiving a query for a file, the controller compares compression ratios to identify a storage device storing the requested file.

Classes IPC  ?

  • G06F 16/13 - Structures d’accès aux fichiers, p. ex. indices distribués
  • G06F 16/174 - Élimination de redondances par le système de fichiers
  • G06F 16/182 - Systèmes de fichiers distribués

32.

PARSER FOR PROCESSING FILES USING NODE OBJECTS WITHIN A POOL

      
Numéro d'application 18942841
Statut En instance
Date de dépôt 2024-11-11
Date de la première publication 2026-05-14
Propriétaire NetApp, Inc. (USA)
Inventeur(s) ., Dhruv Gupta

Abrégé

Techniques are provided for parsing files using node objects within a pool. Conventional techniques for parsing files, such as extensible markup language log files, may not efficiently parse the files, and thus cannot keep up with a rate at which the files are generated and/or populated (e.g., a storage system may generate a significant amount of log data stored in log files over time). The disclosed parsing technique is capable of more efficiently processing the files utilizing less memory and time. In particular, the files are parsed by threads that use node objects within a pool of memory (e.g., a sync pool) to store data being parsed and processed by the threads in parallel. When a thread finishes using a node object, the node object is cleared and returned to the pool for subsequent use by the thread or a different thread, which is memory efficient.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]
  • G06F 12/02 - Adressage ou affectationRéadressage

33.

Enhanced Role-Based Access Control For Cross-Namespace References In Compute Clusters

      
Numéro d'application 19383010
Statut En instance
Date de dépôt 2025-11-07
Date de la première publication 2026-05-14
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Palani, Ashwin
  • Singh, Prabh Simran
  • Thomas, Iii, Joseph Ray
  • Hammernik, Nathan Daniel
  • Karlis, Alexander George

Abrégé

The disclosure describes a system for enforcing role-based access control in a multi-tenant compute cluster with cross-namespace references. A control plane of the compute cluster receives a custom-resource request from a tenant to create or modify a first custom resource in a tenant namespace. The first custom resource references if a second custom resource in an administrative namespace. In response to the request, the control plane transmits a validating admission request to a data-protection controller registered as a webhook endpoint for admission validation. The data-protection controller retrieves access metadata from the referenced second custom resource and generates an admission determination indicating whether the tenant's request satisfies cross-namespace access conditions defined in the metadata. The controller returns the admission determination to the control plane, which admits or denies the custom-resource request accordingly.

Classes IPC  ?

  • G06F 21/62 - Protection de l’accès à des données via une plate-forme, p. ex. par clés ou règles de contrôle de l’accès
  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • H04L 9/40 - Protocoles réseaux de sécurité

34.

FORWARDING OPERATIONS TO BYPASS PERSISTENT MEMORY

      
Numéro d'application 19391781
Statut En instance
Date de dépôt 2025-11-17
Date de la première publication 2026-05-14
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Subramanian, Ananthan
  • Curtis-Maury, Matthew Fontaine
  • Devadas, Vinay
  • Vipperla, Bulli Venkata Rajesh

Abrégé

Techniques are provided for forwarding operations to bypass persistent memory. A modify operation, targeting an object, may be received at a persistent memory tier of a node. If a forwarding policy indicates that forwarding is not enabled for the modify operation and the target object, then the modify operation is executed through a persistent memory file system. If the forwarding policy indicates that forwarding is enabled for the modify operation and the target object, then the modify operation is forwarded to a file system tier as a forwarded operation for execution through a storage file system.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement
  • G06F 15/173 - Communication entre processeurs utilisant un réseau d'interconnexion, p. ex. matriciel, de réarrangement, pyramidal, en étoile ou ramifié

35.

COMBINING DATA BLOCK I/O AND CHECKSUM BLOCK I/O INTO A SINGLE I/O OPERATION DURING PROCESSING BY A STORAGE STACK

      
Numéro d'application 19391801
Statut En instance
Date de dépôt 2025-11-17
Date de la première publication 2026-05-14
Propriétaire NetApp Inc. (USA)
Inventeur(s)
  • Taylor, James Alastair
  • Urkude, Suhas Girish

Abrégé

Techniques are provided for combining data block and checksum block I/O into a single I/O operation. Many storage systems utilize checksums to verify the integrity of data blocks stored within storage devices managed by a storage stack. However, when a storage system reads a data block from a storage device, a corresponding checksum must also be read to verify integrity of the data in the data block. This results in increased latency because two read operations are being processed through the storage stack and are being executed upon the storage device. To reduce this latency and improve I/O operations per second, a single combined I/O operation corresponding to a contiguous range of blocks including the data block and the checksum block is processed through the storage stack instead of two separate I/O operations. Additionally, I/O operation may be combined into a single request that is executed upon the storage device.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

36.

Enhanced Object Replication Recovery Using Placement Groups

      
Numéro d'application 19234684
Statut En instance
Date de dépôt 2025-06-11
Date de la première publication 2026-05-14
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Yoon, Song Guen
  • Zhang, Hai Ning
  • Sangamkar, Dheeraj Raghavender
  • Chu, Chia-Chen
  • Lam, Alvin Zhu-Zhuang

Abrégé

An object storage system with enhanced processes for managing replicas of data objects. Storage nodes of the object storage system receive replicas of objects to store. In response, a storage node identifies one of multiple virtual object space and its corresponding placement group to associate with the replica of the object. The storage node identifies a storage device associated with the virtual object space, stores the replica on the storage device, and updates system metadata to associate the placement group with the replicated object. In response to a restoration event for a storage device of the system, a storage node identifies associated virtual object spaces and placement groups for the effected storage device. Using the identified virtual object spaces and placement groups, the storage node identifies the objects needing restoration and restores replicas of the objects to a different storage device of the system.

Classes IPC  ?

  • G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuéesArchitectures de systèmes de bases de données distribuées à cet effet
  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat

37.

Migrating data using volume clones in a distibuted storage system

      
Numéro d'application 18941022
Numéro de brevet 12625784
Statut Délivré - en vigueur
Date de dépôt 2024-11-08
Date de la première publication 2026-05-12
Date d'octroi 2026-05-12
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kaushik, Akhil
  • Melinamane, Gururaj Jayaram
  • Makam, Sumith
  • Maharana, Pragyan Anand
  • Venkataraman, Nandhini

Abrégé

Systems and methods are provided for data migration including cloning a multiple-logical unit number (LUN) volume into a plurality of cloned single-LUN volumes on a first storage node of a computing system; creating a plurality of new volumes on a second storage node of the computing system based at least in part on the plurality of cloned single-LUN volumes; selectively copying snapshot data from the plurality of cloned single-LUN volumes to the plurality of new volumes; establishing snapshot mirror relationships between the plurality of cloned single-LUN volumes and the plurality of new volumes; synchronizing the plurality of cloned single-LUN volumes and the plurality of new volumes; and performing a migration of data logical interface failovers (LIFs) from the plurality of cloned single-LUN volumes to the plurality of new volumes.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 11/1446 -

38.

DYNAMIC DISTRIBUTION OF COMPRESSION AND DECOMPRESSION JOB REQUESTS TO HARDWARE ACCELERATORS

      
Numéro d'application 18926667
Statut En instance
Date de dépôt 2024-10-25
Date de la première publication 2026-04-30
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Tella, Venkateswarlu
  • Balasubramaniam, Divya
  • Shah, Viral Bharat
  • Sivakumar, Vennila

Abrégé

Dynamic distribution of compression and decompression job requests to hardware accelerators is disclosed. A set of requests is evaluated to determine a number of compression jobs and a number of decompression jobs in the set of requests. A first set of hardware accelerator engines is allocated to perform compression jobs, and a second set of hardware accelerator engines is allocated to perform decompression jobs. Compression jobs are assigned to the first set of hardware accelerator engines based, at least in part, on a compressibility score of the corresponding job and a workload of the selected hardware accelerator engine. Decompression jobs are assigned to the second set of hardware accelerator engines based, at least in part, on a decompression weight of the corresponding job and a workload of the selected hardware accelerator engine.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]

39.

Enhanced caching operations based on a coherency metric

      
Numéro d'application 18923862
Numéro de brevet 12681898
Statut Délivré - en vigueur
Date de dépôt 2024-10-23
Date de la première publication 2026-04-23
Date d'octroi 2026-07-14
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Phatak, Shirish
  • Kovvuri, Vaishnav Kumar
  • Nair, Sunil Sadashivan

Abrégé

A global policy-driven framework for managing, revising, and implementing data coherency policies in a distributed data storage system. An edge node of the distributed data storage system receives a request from an application to store a data object in the system. The edge node, in response to receiving the request to store the data object, generates a coherency policy request, which is then submitted to the primary node of the system. The primary node of the system generates a coherency policy response, which is returned to the edge node. The edge node then stores the data object in the system in accordance with the coherency policy response.

Classes IPC  ?

  • G06F 16/172 - Mise en cache, pré-extraction ou accumulation de fichiers
  • G06F 16/176 - Support d’accès partagé aux fichiersSupport de partage de fichiers
  • G06F 16/178 - Techniques de synchronisation des fichiers dans les systèmes de fichiers

40.

Machine Learning Driven Caching Operations Based On A Coherency Metric

      
Numéro d'application 18923932
Statut En instance
Date de dépôt 2024-10-23
Date de la première publication 2026-04-23
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Phatak, Shirish
  • Kovvuri, Vaishnav Kumar
  • Nair, Sunil Sadashivan

Abrégé

A global policy-driven framework for managing, revising, and implementing data coherency policies in a distributed data storage system. An edge node of the distributed data storage system receives a request from an application to store a data object in the system. The edge node, in response to receiving the request to store the data object, generates a coherency policy request, which is then submitted to the primary node of the system. The primary node of the system generates a coherency policy response, which is returned to the edge node. The edge node then stores the data object in the system in accordance with the coherency policy response.

Classes IPC  ?

  • G06F 8/60 - Déploiement de logiciel
  • H04L 67/1097 - Protocoles dans lesquels une application est distribuée parmi les nœuds du réseau pour le stockage distribué de données dans des réseaux, p. ex. dispositions de transport pour le système de fichiers réseau [NFS], réseaux de stockage [SAN] ou stockage en réseau [NAS]

41.

Adaptive Request Grouping Based On Node Pool Impact

      
Numéro d'application 18924118
Statut En instance
Date de dépôt 2024-10-23
Date de la première publication 2026-04-23
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Schwartz, Idan
  • Kramer, Roi
  • Jacobson, Shani
  • Haskel, Ido
  • Shafir, Tal Shmuel
  • Ohayon, Tal
  • Gurfinkel, Oren
  • Hrafnsson, Eirikur Sveinn

Abrégé

The disclosure describes a node management service that groups pods based on an impact of the available instance pool. The node management service identifies a request group associated with a scale-up request to scale up a cluster of compute nodes to host pods in the request group. The node management service iteratively determines to add pods to the request group until an impact of a next pod on a pool of available nodes exceeds a threshold. The node management service sends a request to a distributor to distribute the pods in the request group to one or more nodes obtained from the pool of available nodes.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]
  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat

42.

MANAGING SHUTDOWN AND RESET OF A NETWORK INTERFACE CARD (NIC)

      
Numéro d'application 18924773
Statut En instance
Date de dépôt 2024-10-23
Date de la première publication 2026-04-23
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Qi, Yuepeng
  • Xu, Houze

Abrégé

Managing shutdown and reset of a network interface card (NIC) in response to an error condition is disclosed. An indication to initiate a network interface card (NIC) reset and reconnection sequence is received. A notification of a link down condition is transmitted. Pending connections are disconnected. Queue pairs corresponding to the interconnect channels are destroyed. Links corresponding to the NIC are disconnected. Packets are cleared from queues corresponding to the NIC. Send and receive queues are reset. Queue pairs corresponding to the NIC are recreated. Queue pairs are connected to corresponding links. Data transfer resumes over the links.

Classes IPC  ?

  • G06F 9/4401 - Amorçage
  • G06F 15/173 - Communication entre processeurs utilisant un réseau d'interconnexion, p. ex. matriciel, de réarrangement, pyramidal, en étoile ou ramifié

43.

Enhanced Management Of Namespace Moves In Data Storage Environments

      
Numéro d'application 18921286
Statut En instance
Date de dépôt 2024-10-21
Date de la première publication 2026-04-23
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Srinivasa Murthy, Vivek
  • Mathew, Pramod John
  • Adurthi, Prashanth

Abrégé

The disclosure describes a system for managing a namespace move between nodes of a data storage environment. During a namespace move associated with a data storage system, the system receives requests at a first node (e.g., a source node) in the data storage system to perform input/output (I/O) operations associated with a namespace subject to the namespace move and stores the requests in a queue at the first node until completion of the namespace move. Upon completion of the namespace move, the system forwards the requests from the first node to a second node (e.g., a destination node) in the data storage system and performs the I/O operations at the second node.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

44.

Erasure Coding With Multiple Fragments On A Single Node

      
Numéro d'application 18923792
Statut En instance
Date de dépôt 2024-10-23
Date de la première publication 2026-04-23
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kamat, Nikhil Narahari
  • Hur, Joon
  • Dacko, Michal Jakub

Abrégé

Techniques for efficiently and durably implementing erasure coding. Data objects are processed to extract metadata, which is used to identify fragments of the data object and the stripe to which the fragments belong. The techniques described herein evaluate failure domains at the drive-level rather than at the node-level, thereby greatly expanding the number of failure domains for fragment storage. To support object availability and durability, each drive-level failure may only hold one fragment from any given stripe. Further, the storage drives of each storage node are restricted such that the total number of fragments from any given stripe stored in the storage node does not exceed a limit. With this arrangement, not only can erasure coding can be implemented while using fewer computing resources when compared with node-level failure domains, but data objects can also be reconstructed without compromising data integrity under configurable levels of tolerance to unavailable fragments.

Classes IPC  ?

  • G06F 11/10 - Détection ou correction d'erreur par introduction de redondance dans la représentation des données, p. ex. en utilisant des codes de contrôle en ajoutant des chiffres binaires ou des symboles particuliers aux données exprimées suivant un code, p. ex. contrôle de parité, exclusion des 9 ou des 11

45.

Projecting Allocatable Capacity For Compute Instances Using Cached Data

      
Numéro d'application 18924935
Statut En instance
Date de dépôt 2024-10-23
Date de la première publication 2026-04-23
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Chourilov, Vladislav
  • Shafir, Tal Shmuel
  • Haskel, Ido
  • Kramer, Roi

Abrégé

The disclosure describes a node management service that determines to deploy a primary workload to a new instance in a compute cluster. The node management service projects an allocatable capacity for the new instance based on historical capacity data. The allocatable capacity is the amount of compute resources available for running the primary workload in the new instance after deployment of a supporting workload to the new instance. The node management service associates the primary workload with the new instance upon determining that the projected allocatable capacity is sufficient for running the primary workload.

Classes IPC  ?

  • G06F 12/0802 - Adressage d’un niveau de mémoire dans lequel l’accès aux données ou aux blocs de données désirés nécessite des moyens d’adressage associatif, p. ex. mémoires cache

46.

GET KEY BOT FOR SECURELY MAINTAINING AND PROVIDING PASSPHRASES

      
Numéro d'application 19420341
Statut En instance
Date de dépôt 2025-12-15
Date de la première publication 2026-04-16
Propriétaire NetApp, Inc. (USA)
Inventeur(s) Amalraj Victory Raja, Amalraj Victory Raja

Abrégé

Techniques are provided for a get key bot that securely provides access to passphrases. A set key workflow is executed to generate a get key executable binary that is implemented as the get key bot. The get key executable binary is encapsulated with encrypted information that includes a verified user identifier, a passphrase, and/or a bot expiry time. Upon receiving a request for the passphrase from a requestor, the get key executable binary is invoked. The encrypted information is decrypted and compared to a logged-in user identifier and current time for verification. In response to successful verification, the passphrase is provided to the requestor. Otherwise, the requestor is denied access to the passphrase.

Classes IPC  ?

47.

BACKUP AND RECOVERY OF APPLICATION DATA OF AN APPLICATION EXECUTING IN A VIRTUAL MACHINE

      
Numéro d'application 19363333
Statut En instance
Date de dépôt 2025-10-20
Date de la première publication 2026-04-16
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Surakanti, Priyanka Kasinath
  • Murali, Pratik
  • Padinjarel Somanathan, Ramanathan
  • Prabhu, Vasantha Sadananda

Abrégé

Backup of application data associated with an application executing in a virtual machine managed by a hypervisor is performed. Backup of the application data includes retrieving a Logical Unit Number (LUN) identification (ID) used by the application to store the application data in a storage volume. Backup of the application data also includes performing a virtual storage resolution for the LUN ID to determine whether the application data is stored in the storage volume identified by the LUN ID based on a first virtual mapping or a physical mapping. Backup of application data associated with an application executing in a virtual machine managed by a hypervisor is performed. Backup of the application data includes retrieving a Logical Unit Number (LUN) identification (ID) used by the application to store the application data in a storage volume. Backup of the application data also includes performing a virtual storage resolution for the LUN ID to determine whether the application data is stored in the storage volume identified by the LUN ID based on a first virtual mapping or a physical mapping. Backup also includes storing in metadata for the backup the LUN ID and whether the LUN ID is based on the first virtual mapping or the physical mapping. Backup includes creating a backup of the application data stored in the storage volume. Application data can subsequently be restored based on the application data that is backed up.

Classes IPC  ?

  • G06F 11/1446 -
  • G06F 9/445 - Chargement ou démarrage de programme
  • G06F 9/455 - ÉmulationInterprétationSimulation de logiciel, p. ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation

48.

Integrated Workload Right-Sizing And Node Scaling Operations

      
Numéro d'application 18905727
Statut En instance
Date de dépôt 2024-10-03
Date de la première publication 2026-04-09
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kesari, Yarden Joshua
  • Vladimirsky, Revital

Abrégé

The disclosure describes a node management service that integrates right-sizing and node scaling operations. The node management service modifies a request parameter for a workload deployed in a compute cluster. The node management service determines an updated set of compute nodes for nodes affected by the updated request parameter. The node management service obtains, from a compute provider, the updated set of compute nodes for the compute cluster. The node management service provides the modified request parameter to a control plane after obtaining the updated set of compute nodes.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]

49.

SYSTEMS AND METHODS FOR CONFIGURATION INDEPENDENT UNPLANNED FAILOVER WITHIN A CROSS-SITE STORAGE SYSTEM HAVING BIDIRECTIONAL SYNCHRONOUS REPLICATION

      
Numéro d'application 18905839
Statut En instance
Date de dépôt 2024-10-03
Date de la première publication 2026-04-09
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Yadala, V Ramakrishna Rao
  • Chaudhary, Rohit

Abrégé

In one example, a computer-implemented method includes establishing bi-directional synchronous replication between one or more members of a first consistency group (CG1) of a primary storage site and one or more members of a second consistency group (CG2) of a secondary storage site with each storage site having read/write access while maintaining zero recovery point objective (RPO) and Zero recovery time objective (RTO), initiating a non-disruptive planned failover (PFO) to change a role for the secondary storage site and change a role for the primary storage site, initiating, with the primary storage site and/or secondary storage site, a PFO out of synchronization (OOS) event that is sent to a mediator agent with no indication of a role for serving IO, and starting a configuration independent unplanned failover if a disaster or site failure occurs during the PFO.

Classes IPC  ?

  • G06F 11/16 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel
  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange

50.

SYSTEMS AND METHODS FOR NON-DISRUPTIVE PLANNED FAILOVER WITHIN A CROSS-SITE STORAGE SYSTEM HAVING BIDIRECTIONAL SYNCHRONOUS REPLICATION

      
Numéro d'application 18905850
Statut En instance
Date de dépôt 2024-10-03
Date de la première publication 2026-04-09
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Yadala, V Ramakrishna Rao
  • Vijayan, Anoop
  • Arumugham, Kalaivani
  • Deshmukh, Prachi Bapurao
  • Krishnan, Sasidharan
  • Khandelwal, Omprakash
  • Shetty, Sohan
  • Bhargava M R, Rakesh

Abrégé

In one example, the present storage solution provides an order of operations of a computer-implemented method that includes establishing bi-directional synchronous replication between one or more members of a first consistency group (CG1) of a primary storage site and one or more members of a second consistency group (CG2) of a secondary storage site with each storage site having read/write access while maintaining zero recovery point objective (RPO) and Zero recovery time objective (RTO). The method includes initiating a non-disruptive planned failover to change a role for the secondary storage site and change a role for the primary storage site while maintaining in sync status of the bi-directional synchronous replication between the one or more members of the CG1 of the primary storage site and the one or more members of the CG2 of a secondary storage site, and while maintaining zero data loss protection.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange

51.

Replication Engine(s) For Preserving Discontiguous And Fragmented Compressed Data Units

      
Numéro d'application 18903280
Statut En instance
Date de dépôt 2024-10-01
Date de la première publication 2026-04-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Natarajan, Rupa
  • Tella, Venkateswarlu
  • Kothiyal, Rachita
  • Selvaraj, Santhosh
  • Sun, Wei
  • Boser, Marshall Ronald
  • Ravindran, Agnel
  • Kunchakarra, Vatsalya
  • Chuggani, Roopesh

Abrégé

Various embodiments of the present technology generally relate to systems and methods for providing a replication engine for preserving discontiguous and fragmented compressed data extents (CDEs). In an aspect, a replication engine may determine a replication request to replicate one or more data blocks from a source storage system to a destination storage system. Based on the replication request, the replication engine may determine a first CDE containing the one or more data blocks. The replication engine may also determine a transfer map associated with the replication request. Based on the transfer map, the replication engine may determine a replication state associated with the one or more data blocks and initiate replication of the first CDE from the source storage system to the destination storage system based on the replication state associated with the one or more data blocks.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

52.

ADAPTIVE SAMPLING FOR DATA SUMMARIZATION

      
Numéro d'application 19344063
Statut En instance
Date de dépôt 2025-09-29
Date de la première publication 2026-04-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Patil, Parag
  • Gautami, Sonika Shantilal
  • Parikh, Darshini

Abrégé

Techniques are provided for performing adaptive sampling for data summarization. An insight service may provide monitoring, troubleshooting, optimization, security, and/or other functionality for a computing environment. The insight service may intake millions to billions of events on a monthly basis from the computing environment, which are stored within a database. The insight service may provide data summarization for the events, which may include access patterns (e.g., file access patterns), anomalies, and ransomware detection. Dynamically querying and generating the data summarization may be impractical due to the sheer amount of events. Accordingly, adaptive sampling is provided for merely sampling certain events based upon various thresholds and criteria being met so that an evaluation output can be dynamically and efficiently generated within an acceptable time as the data summarization.

Classes IPC  ?

  • G06F 16/11 - Administration des systèmes de fichiers, p. ex. détails de l’archivage ou d’instantanés
  • G06F 16/9035 - Filtrage basé sur des données supplémentaires, p. ex. sur des profils d'utilisateurs ou de groupes
  • G06F 21/56 - Détection ou gestion de programmes malveillants, p. ex. dispositions anti-virus

53.

INCREMENTAL BACKUP TO OBJECT STORE

      
Numéro d'application 19412301
Statut En instance
Date de dépôt 2025-12-08
Date de la première publication 2026-04-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Zheng, Ling
  • Pandit, Atul Ramesh
  • George, Tijin
  • Kuramkote, Ravindra Ramachandraiah

Abrégé

Techniques are provided for incremental backup to an object store. A request may be received from an application to perform a backup from a volume hosted by a node to a backup target within the object store. A set of changed files within the volume since a prior backup of the volume was performed to the backup target is identified, along with metadata associated with the set of changed files. The metadata is utilized to identify changed data blocks comprising data of the set of changed files that was modified since the prior backup. The changed data blocks are backed up to the object store.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat

54.

SYSTEM CRASH ANALYSIS MECHANISM

      
Numéro d'application 18898985
Statut En instance
Date de dépôt 2024-09-27
Date de la première publication 2026-04-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Bhamidipati, Vedavyas
  • Khale, Shreyansh
  • Bhat, Raveesh
  • Mandadi, Subhash
  • Hiremath, Arun

Abrégé

A system is described including one or more processing resources and a non-transitory computer-readable medium, coupled to the processing resource, having stored therein instructions that when executed by the one or more processing resources cause the one or more processing resources to establish a remote direct memory access (RDMA) connection with a client computer system and remotely access a crash dump file stored at the client computer system, including providing a file offset of interest and size of data to be read from the client computer system and translating the file offset of interest and size of data into a plurality of RDMA messages.

Classes IPC  ?

  • G06F 15/173 - Communication entre processeurs utilisant un réseau d'interconnexion, p. ex. matriciel, de réarrangement, pyramidal, en étoile ou ramifié
  • G06F 11/07 - Réaction à l'apparition d'un défaut, p. ex. tolérance de certains défauts

55.

SYSTEM CRASH ANALYSIS MECHANISM

      
Numéro d'application 18898991
Statut En instance
Date de dépôt 2024-09-27
Date de la première publication 2026-04-02
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Bhamidipati, Vedavyas
  • Khale, Shreyansh
  • Bhat, Raveesh
  • Mandadi, Subhash
  • Hiremath, Arun

Abrégé

A system is described including one or more processing resources and a non-transitory computer-readable medium, coupled to the processing resource, having stored therein instructions that when executed by the one or more processing resources cause the one or more processing resources to receive a request from a remote computer system to initiate a remote direct memory access (RDMA) connection, establish the RDMA connection with the remote computer system and provide access to a crash dump file via the RDMA connection.

Classes IPC  ?

  • H04L 67/1097 - Protocoles dans lesquels une application est distribuée parmi les nœuds du réseau pour le stockage distribué de données dans des réseaux, p. ex. dispositions de transport pour le système de fichiers réseau [NFS], réseaux de stockage [SAN] ou stockage en réseau [NAS]

56.

REMOTE VOLUME CLONE

      
Numéro d'application 19334299
Statut En instance
Date de dépôt 2025-09-19
Date de la première publication 2026-03-26
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Thoppil, Anil Paul
  • Patel, Manan
  • Subramanian, Ananthan
  • Choudhary, Garima

Abrégé

Systems and methods for implementation and use of remote clone volumes within a distributed storage system are provided. In one of various contemplated examples, all nodes of multiple nodes of a cluster representing a distributed storage system are able to access an entirety of a global physical volume block number (PVBN) space of a storage pod. A remote clone volume of a parent volume of a source node may be created for use by a destination node by creating a dummy volume on the destination node. The dummy volume may then be converted into the remote clone volume by copying metadata associated with a backing snapshot of the parent volume to the dummy volume. After completing creation of the remote clone volume, the backing snapshot may then be locked to protect the backing snapshot from deletion.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

57.

System for deduplication in data storage environments

      
Numéro d'application 18893043
Numéro de brevet 12650954
Statut Délivré - en vigueur
Date de dépôt 2024-09-23
Date de la première publication 2026-03-26
Date d'octroi 2026-06-09
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Chuggani, Roopesh
  • Narayanan, Dinakaran
  • Sharma, Palak
  • Devarajan, Mathankumar

Abrégé

Systems, methods, and software are disclosed herein for identifying duplicate blocks of a storage system and deduplicating the storage system. In one example, a method of operating a computing device includes scanning first metadata of blocks of a container file of a virtual volume to generate a first log file including records of virtual volume block numbers (VVBNs) and fingerprints of the blocks; scanning second metadata of blocks of an active file system of the virtual volume to generate a second log file including records of VVBNs and file block numbers (FBNs) of the blocks; generating tuples based on merging the records of the first log file and the second records of the second log file according to the VVBNs; identifying duplications among the blocks based on the tuples; and deduplicating the blocks based on the duplications in the active file system identified based on the tuples.

Classes IPC  ?

  • G06F 16/174 - Élimination de redondances par le système de fichiers

58.

Fan Control Setting Generation Using Machine Learning

      
Numéro d'application 18897885
Statut En instance
Date de dépôt 2024-09-26
Date de la première publication 2026-03-26
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Choubey, Ravi Kumar
  • Goyal, Kalpesh
  • D P, Parthiban
  • A, Maheswari

Abrégé

The disclosure describes system, devices, and methods for fan speed control. In an example implementation, a method for operating a computer-implemented service is provided. The method includes obtaining sensor data from one or more sensors in a data storage environment. The sensor data includes temperature data associated with storage devices in the data storage environment. The method also includes providing an input (e.g., the sensor data) to a machine learning model trained to predict fan control settings of a fan in the data storage environment, determining the fan control setting based on an output from the machine learning model, and controlling the fan based on the fan control setting.

Classes IPC  ?

  • H05K 7/20 - Modifications en vue de faciliter la réfrigération, l'aération ou le chauffage
  • G06N 20/00 - Apprentissage automatique

59.

Fan Control Setting Generation Using Machine Learning

      
Numéro d'application 18897976
Statut En instance
Date de dépôt 2024-09-26
Date de la première publication 2026-03-26
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Choubey, Ravi Kumar
  • Goyal, Kalpesh
  • D P, Parthiban
  • A, Maheswari

Abrégé

The disclosure describes system, devices, and methods for fan speed control. In an example implementation, a method for operating a computer-implemented service is provided. The method includes obtaining sensor data from one or more sensors in a data storage environment. The sensor data includes temperature data associated with storage devices in the data storage environment. The method also includes providing an input (e.g., the sensor data) to a machine learning model trained to predict fan control settings of a fan in the data storage environment, determining the fan control setting based on an output from the machine learning model, and controlling the fan based on the fan control setting.

Classes IPC  ?

60.

LIVENESS MONITORING TO PROVIDE DETERMINISTIC ASCERTAINMENT OF A FUNCTIONAL STATUS OF NODES IN A NETWORKED ENVIRONMENT

      
Numéro d'application 19036971
Statut En instance
Date de dépôt 2025-01-24
Date de la première publication 2026-03-19
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Pawar, Sangramsinh Pandurang
  • Wang, Yanbei

Abrégé

A liveness monitoring architecture to deterministically ascertain the functional status of nodes in a high-availability (HA) environment to more efficiently recover from a split-brain condition is disclosed.

Classes IPC  ?

  • G06F 9/455 - ÉmulationInterprétationSimulation de logiciel, p. ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation
  • H04L 43/10 - Surveillance active, p. ex. battement de cœur, utilitaire Ping ou trace-route

61.

System and Method for Infrastructure Scaling

      
Numéro d'application 19252259
Statut En instance
Date de dépôt 2025-06-27
Date de la première publication 2026-03-19
Propriétaire NetApp Inc. (USA)
Inventeur(s)
  • Zur, Tal
  • Yemini, Ori

Abrégé

A method, system and computer program product, the method comprising: determining properties of a set of containers that are deployed over a computer infrastructure, wherein the computer infrastructure is provisioned via an infrastructure management service; determining properties of one or more headroom containers, wherein the one or more headroom containers are not deployed over the computer infrastructure; simulating the container orchestrator using the properties of the set of container and the properties of the headroom containers, for obtaining an expected deployment of the set of containers together with the one or more head room containers; based on the expected deployment, determining whether the computer infrastructure is sufficient for deploying the set of containers together with the one or more headroom containers; and subject to the computer infrastructure being insufficient, issuing a request to the infrastructure management service to allocate additional computer infrastructure.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]

62.

Data Preparation Engine(s) For Curating Secure And Compliant Data Collections From Distributed Sources

      
Numéro d'application 19324580
Statut En instance
Date de dépôt 2025-09-10
Date de la première publication 2026-03-19
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Bhavani Sankar, Phani Srikanth
  • Fridman, Micky
  • Haniya Narayana, Darshan Adiga
  • Gururajan, Arunkumar
  • Chandrashekar, Girish
  • Gutman, Efrat Tzipora
  • Friedman, Nadav
  • Kikozashvili, Nehorai
  • Horowitz, Noga
  • Shapira, Ad
  • Lieber, Nir
  • Subramanyam, Shivakarthik
  • Gulati, Gagan

Abrégé

Various embodiments of the present technology generally relate to systems and methods for providing a data preparation engine for curating secure and compliant data collections from distributed storage systems. In an aspect, a data preparation engine receives a query from a client device and determines files from one or more distributed sources based on the query. The data preparation engine determines sensitive data within the files and anonymizes the sensitive data while preserving context and integrity of the underlying information. The data preparation engine generates a data collection including the files with anonymized sensitive data. The data collection may then be deployed to downstream applications or workflows, such as used to generate curated data sets for training of artificial intelligence applications. Once deployed, the data preparation engine may continuously monitor the distributed sources for changes to data within the files and automatically update data collections in real-time.

Classes IPC  ?

  • G06F 21/62 - Protection de l’accès à des données via une plate-forme, p. ex. par clés ou règles de contrôle de l’accès
  • G06F 16/22 - IndexationStructures de données à cet effetStructures de stockage
  • G06F 16/242 - Formulation des requêtes
  • G06F 21/16 - Traçabilité de programme ou de contenu, p. ex. par filigranage
  • G06F 21/31 - Authentification de l’utilisateur

63.

RECOVERY OF DATA ASSOCIATED WITH A LOCKED SNAPSHOT VIA VOLUME CLONING FUNCTIONALITY

      
Numéro d'application 19399237
Statut En instance
Date de dépôt 2025-11-24
Date de la première publication 2026-03-19
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Srinath, Vijay
  • Yadala, V Ramakrishna Rao
  • Devarakonda, Mohit
  • Kumar, Shilpa

Abrégé

Systems and methods are described for performing an instant recovery of data associated with a locked snapshot. In various examples, the amount of time for performing a recovery of data associated with a locked snapshot is performed by making use of volume cloning functionality instead of making an actual copy of the data to be recovered. In one embodiment, the resulting volume clone representing the recovery volume is cleared of all data protection information (e.g., WORM flags and/or lock metafiles) that was previously used to protect the content from being changed when stored on the data protection volume so as allow the recovery volume to be used in read-write mode.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 16/176 - Support d’accès partagé aux fichiersSupport de partage de fichiers
  • G06F 16/18 - Types de systèmes de fichiers

64.

Artificial Intelligence Data Platform

      
Numéro d'application 19232249
Statut En instance
Date de dépôt 2025-06-09
Date de la première publication 2026-03-19
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Banerjee, Arindam
  • Srinivasan, Kiran
  • Tamma, Leela Shankar
  • Pandit, Atul Ramesh
  • Kangarlou, Ardalan

Abrégé

The disclosure describes artificial intelligence (AI) data platform that utilizes snapshots obtained from a storage node to update a vector database. The AI data platform compares snapshots to generate differential snapshots that identify changed data in storage volumes. The AI data platform uses the differential snapshots to update vector embeddings in a vector database for retrieval-augmented generation (RAG) workflows.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 16/22 - IndexationStructures de données à cet effetStructures de stockage
  • G06F 16/3329 - Formulation de requêtes en langage naturel

65.

UNLEASH GENIUS

      
Numéro de série 99710507
Statut En instance
Date de dépôt 2026-03-18
Propriétaire NetApp, Inc. (USA)
Classes de Nice  ?
  • 37 - Services de construction; extraction minière; installation et réparation
  • 41 - Éducation, divertissements, activités sportives et culturelles
  • 42 - Services scientifiques, technologiques et industriels, recherche et conception

Produits et services

Installation, maintenance, and repair of computer hardware for storing, managing, replicating, transferring, securing, retrieving, and restoring data and files; installation, maintenance, and repair of computer hardware for sharing, updating, partitioning, and accessing files over a computer network; installation, maintenance, and repair of computer hardware for optimizing the accessibility, delivery, backup, security, restoration, and replication of data; installation, maintenance, and repair of computer hardware for managing, monitoring, and securing networks, computer disc drives, electronic data storage systems, databases and other storage devices across computer networks; installation, maintenance, and repair of computer hardware using artificial intelligence for the purpose of managing business data; consulting services related to installation, repair, and maintenance of computer hardware and artificial intelligence (AI) in the fields of artificial intelligence, computers, computer software and hardware, computer storage networks, computer storage devices, data and computer file storage, management, replication, security, retrieval, restoration and distribution, and management, monitoring and security of computer networks, computer disc drives, electronic data storage systems, databases and other storage devices across computer networks Educational services, namely, arranging and conducting training courses, lectures, classes, workshops, seminars and conferences in the fields of artificial intelligence, computers, computer software and hardware, computer storage networks, computer storage devices, data and computer file storage, management, replication, security, retrieval, restoration and distribution, and management, monitoring and security of computer networks, computer disc drives, electronic data storage systems, databases and other storage devices across computer networks; providing educational testing to determine professional skills in the fields of computers, computer software and hardware, computer storage networks, computer storage devices, data and computer file storage, management, replication, security, retrieval, restoration and distribution, and management, monitoring and security of computer networks, computer disc drives, electronic data storage systems, databases and other storage devices across computer networks Providing online and cloud-based non-downloadable software for monitoring, securing, optimizing, analyzing, and managing electronic and cloud data storage, computer servers, databases, and other storage devices and systems across computer networks; technical support services, namely, monitoring and troubleshooting for problems with computers, computer software and hardware and computer storage networks, and providing back-up computer programs and facilities; software as a Service (SAAS) services featuring software for management, monitoring, modeling, troubleshooting, optimization, reporting and analysis of network storage infrastructure and data; cloud computing featuring software for use in controlling, monitoring, and managing cloud infrastructure, virtual services, and networking configuration; design, deployment and management of software and hardware using artificial intelligence for the purpose of managing business data; technical consulting in the field of artificial intelligence (AI) software customization; technical consulting in the fields of artificial intelligence, computers, computer software and hardware, computer storage networks, computer storage devices, data and computer file storage, management, replication, security, retrieval, restoration and distribution, and management, monitoring and security of computer networks, computer disc drives, electronic data storage systems, databases and other storage devices across computer networks; artificial Intelligence as a Service (AIAAS) services featuring software using artificial intelligence (AI) for use in database management; providing online and cloud-based non-downloadable software for deploying, implementing, monitoring, securing, optimizing, analyzing, storing, managing, and troubleshooting artificial intelligence (AI) platforms and internal processes; providing temporary use of online non-downloadable software for use in connection with data management, data storage, data protection, security, and compliance; providing temporary use of online non-downloadable software for managing, accessing, modifying, updating, organizing, delivering, synchronizing, processing, transmitting, storing, and restoring data

66.

SYSTEM AND METHOD FOR EFFICIENT BLOCK LEVEL GRANULAR REPLICATION

      
Numéro d'application 19390866
Statut En instance
Date de dépôt 2025-11-17
Date de la première publication 2026-03-12
Propriétaire NetApp Inc. (USA)
Inventeur(s)
  • Shetty, Rithin
  • Shivappa, Vishwajith
  • Lockwood, Paul
  • Saxena, Pawan
  • Gopaulakrishnan, Preethi

Abrégé

A system and method for efficiently restoring one or more data containers is provided. A common persistent consistency point image (PCPI) is identified between a source and a destination storage systems prior to the destination storage system performing a rollback operation to the commonly identified PCPI. Differential data is then transmitted from the source storage system in a line efficient manner to the destination storage system.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 16/11 - Administration des systèmes de fichiers, p. ex. détails de l’archivage ou d’instantanés

67.

SERVERLESS TIEBREAKER FOR SHARED-NOTHING ARCHITECTURE

      
Numéro d'application 18962061
Statut En instance
Date de dépôt 2024-11-27
Date de la première publication 2026-03-12
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Pawar, Sangramsinh Pandurang
  • Duan, Ruitao
  • Ekkaladevi, Vijay Kumar Chakravarthy
  • Dallas, William Derby

Abrégé

Systems and methods for a serverless tiebreaker for a shared-nothing architecture are provided. In some examples, a cloud-native service that supports serialization of writes (or write fencing), for example, via atomic operations with persistent locking and/or reservations, is used to support HA mediation instead of a separate server operating as a tiebreaker, thereby reducing costs and complexity as well as increasing availability and durability of the HA mediation functionality. For example, a fast, fully managed, serverless, key-value noSQL database service (e.g., the Amazon DynamoDB) may be used to perform one or more of maintaining the authoritative source of information regarding which node of an HA pair currently represents the primary node for serving data from a particular dataset, persisting HA metadata, and/or assisting in the failover and failback processes.

Classes IPC  ?

  • H04L 67/1095 - Réplication ou mise en miroir des données, p. ex. l’ordonnancement ou le transport pour la synchronisation des données entre les nœuds du réseau
  • H04L 67/1097 - Protocoles dans lesquels une application est distribuée parmi les nœuds du réseau pour le stockage distribué de données dans des réseaux, p. ex. dispositions de transport pour le système de fichiers réseau [NFS], réseaux de stockage [SAN] ou stockage en réseau [NAS]

68.

Methods and Systems for Raid Protection in Zoned Solid-State Drives

      
Numéro d'application 19315033
Statut En instance
Date de dépôt 2025-08-29
Date de la première publication 2026-03-05
Propriétaire NETAPP, INC. (USA)
Inventeur(s)
  • Gole, Abhijeet Prakash
  • Sen, Sourav
  • Smith, Mark
  • Ting, Daniel Wang-Woei

Abrégé

Methods and systems for a storage environment are provided. One method includes splitting storage of a plurality of zoned solid-state drives (ZNS SSDs) into a plurality of physical zones (PZones) across a plurality of independent media units of each ZNS SSD, the PZones visible to a first tier RAID (redundant array of independent disks) layer; generating a plurality of RAID zones (RZones), each RZone having a plurality of PZones; presenting one or more RZones to a second tier RAID layer by the first tier RAID layer for processing read and write requests using the plurality of ZNS SSDs; and utilizing, by the first tier RAID layer, a parity PZone at each ZNS SSD for storing parity information corresponding to data written in one or more PZone corresponding to a RZone presented to the second tier RAID layer and storing the parity information in a single parity ZNS SSD.

Classes IPC  ?

  • G06F 11/10 - Détection ou correction d'erreur par introduction de redondance dans la représentation des données, p. ex. en utilisant des codes de contrôle en ajoutant des chiffres binaires ou des symboles particuliers aux données exprimées suivant un code, p. ex. contrôle de parité, exclusion des 9 ou des 11
  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement
  • G06F 12/10 - Traduction d'adresses

69.

OBJECT VERSIONING SUPPORT FOR A FILE SYSTEM

      
Numéro d'application 19381155
Statut En instance
Date de dépôt 2025-11-06
Date de la première publication 2026-03-05
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Oza, Dhairesh
  • Cox, Roger W.

Abrégé

Systems and methods for providing a file system with object versioning support are provided. Rather than adding object records for each version of an object to a chapter database, in one example, the chapter database may be limited to a single object record for a given object including: (i) a name of the object; (ii) an object file handle containing information regarding a file containing data of a current version of multiple versions of the object; and (iii) a version table file handle containing information regarding a file containing a version table. In this manner, enumeration of objects associated with a given chapter may be performed more efficiently and prior versions of objects may be maintained separately within the version table without causing disproportionate growth of object records and without increasing the search depth with objects that are not referenced by the search at issue.

Classes IPC  ?

  • G06F 16/18 - Types de systèmes de fichiers
  • G06F 16/13 - Structures d’accès aux fichiers, p. ex. indices distribués

70.

SYSTEMS AND METHODS FOR COMPRESSING MODELS DURING MODEL TRAINING WHILE CONSIDERING TARGET ALIGNMENT FOR EFFICIENT AI RUNTIME

      
Numéro d'application 18823829
Statut En instance
Date de dépôt 2024-09-04
Date de la première publication 2026-03-05
Propriétaire NetApp, Inc. (USA)
Inventeur(s) Krug, Anton

Abrégé

Techniques are provided for compressing weights of models during training of the models. A model is trained for execution on a target device. As part of training, weights of the model are compressed utilizing palettes to represent weight values using bits. A coding procedure, such as Huffman coding, is used to remove or modify the bit representations of infrequently utilized palettes. The model may be iteratively trained to compress the weights of the model in order to reduce the amount of storage consumed by the model without unduly sacrificing quality of the model. Reducing the size of the model provides the ability to deploy the model on devices that would otherwise lack storage and compute resources for storing and running an uncompressed version of the model.

Classes IPC  ?

71.

COMPOSITE AGGREGATE ARCHITECTURE

      
Numéro d'application 19384905
Statut En instance
Date de dépôt 2025-11-10
Date de la première publication 2026-03-05
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Subramanian, Ananthan
  • Venketaraman, Sriram
  • Dronamraju, Ravikanth
  • Gupta, Mohit

Abrégé

Techniques are provided for providing a storage abstraction layer for a composite aggregate architecture. A storage abstraction layer is utilized as an indirection layer between a file system and a storage environment. The storage abstraction layer obtains characteristic of a plurality of storage providers that provide access to heterogeneous types of storage of the storage environment (e.g., solid state storage, high availability storage, object storage, hard disk drive storage, etc.). The storage abstraction layer generates storage bins to manage storage of each storage provider. The storage abstraction layer generates a storage aggregate from the heterogeneous types of storage as a single storage container. The storage aggregate is exposed to the file system as the single storage container that abstracts away from the file system the management and physical storage details of data of the storage aggregate.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement
  • G06F 12/02 - Adressage ou affectationRéadressage
  • G06F 12/14 - Protection contre l'utilisation non autorisée de mémoire
  • G06F 16/14 - Détails de la recherche de fichiers basée sur les métadonnées des fichiers

72.

DUAL-STAGE VECTOR SEARCH FOR ENHANCED RETRIEVAL AUGMENTED GENERATION

      
Numéro d'application 18811735
Statut En instance
Date de dépôt 2024-08-21
Date de la première publication 2026-02-26
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Srinivasan, Kiran
  • Banerjee, Arindam
  • Pailet, Gregory

Abrégé

The disclosure describes system, devices, and methods for dual-stage vector search. In an example implementation, a method for operating a computer-implemented service is provided. The method includes receiving a context request for content with which to augment a prompt, generating a base vector based on input data in the context request and quantizing the base vector to produce a quantized vector. The method also includes searching a vector database to identify content items based at least on the quantized vector and obtaining the content items and generating base vectors for the content items. The method further includes selecting a subset of the content items based on at least on the base vector generated for the input data and the base vectors for the content items.

Classes IPC  ?

  • G06F 16/33 - Requêtes
  • G06F 16/38 - Recherche caractérisée par l’utilisation de métadonnées, p. ex. de métadonnées ne provenant pas du contenu ou de métadonnées générées manuellement

73.

Dynamic Storage Aggregate Layout Refresh

      
Numéro d'application 18926641
Statut En instance
Date de dépôt 2024-10-25
Date de la première publication 2026-02-19
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Urkude, Suhas Girish
  • Kim, Byung Guk
  • Bhandary, Sowkoor Sunad
  • Gupta, Ratnesh

Abrégé

The disclosure describes systems, devices, and methods for managing data storage environments. In an example implementation, a method of operating a controller in a data storage environment is provided. In performing the method, the controller identifies a change to a layout of drives in the data storage environment, and in response to identifying the change, takes a lock on instances of layout metadata stored on the drives. The controller then updates the instances of the layout metadata to reflect the change to the layout and releases the lock.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

74.

Zero-Touch Aggregate Layout Management

      
Numéro d'application 18927115
Statut En instance
Date de dépôt 2024-10-25
Date de la première publication 2026-02-19
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Urkude, Suhas Girish
  • Bangera, Dean Mcquinn

Abrégé

The disclosure describes systems, devices, and methods for managing access to storage devices in a shared-everything data storage environment in which any controller can access each storage device of a storage aggregate. In an implementation, a method for managing the layout of the storage aggregate is provided, which may be performed by a controller. The controller receives a request to add a storage device to the data storage environment, processes the request to identify metadata associated with the storage device, including characteristics of the storage device, processes characteristics of the storage device and characteristics of redundancy groups in the storage environment to select a redundancy group for the drive, and adds the storage device to the redundancy group.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

75.

Managing parity operations using controller-specific parity bitmaps

      
Numéro d'application 18926809
Numéro de brevet 12566667
Statut Délivré - en vigueur
Date de dépôt 2024-10-25
Date de la première publication 2026-02-19
Date d'octroi 2026-03-03
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Urkude, Suhas Girish
  • De, Tandra
  • Gupta, Ratnesh
  • Nachenahalli Bhuthegowda, Bharath Kumar
  • Natesan Seeralan, Deepan

Abrégé

The disclosure describes systems, devices, and methods for tracking operations of controllers in a data storage environment on a per-controller basis. In an implementation, a method for re-performing an incomplete operation is provided. In the method, a controller reads, from a parity drive in the data storage environment, a parity bitmap associated with the controller. The parity bitmap includes sections each corresponding to a different controller in the data storage environment, and each section includes status indicators at specific locations indicative of a status of parity data stored at corresponding locations of a parity region of the parity drive. For each incomplete status indicator, the controller re-computes parity data based on source data associated with the status indicator, stores the parity data at a location of the parity region corresponding to a location of the status indicator in the parity bitmap, and updates the status indicator from incomplete to complete.

Classes IPC  ?

  • G06F 11/10 - Détection ou correction d'erreur par introduction de redondance dans la représentation des données, p. ex. en utilisant des codes de contrôle en ajoutant des chiffres binaires ou des symboles particuliers aux données exprimées suivant un code, p. ex. contrôle de parité, exclusion des 9 ou des 11

76.

Multi-Controller Drive Recovery

      
Numéro d'application 18926934
Statut En instance
Date de dépôt 2024-10-25
Date de la première publication 2026-02-19
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Urkude, Suhas Girish
  • Mcdavitt, Ben Franklin
  • Bhandary, Sowkoor Sunad
  • Somani, Sanyukta
  • Nachenahalli Bhuthegowda, Bharath Kumar

Abrégé

The disclosure describes systems, devices, and methods for re-computing lost data in data storage environments. In an example embodiment, a method for rebuilding a failed storage device by multiple controllers in a data storage environment is provided. In the method, each of the controllers determines a failed state of a storage device in the data storage environment. Upon replacement of the failed storage device with a replacement storage device, each controller identifies corresponding storage allocation areas of the storage device, then rebuilds corresponding portions of the failed storage device at portions of the replacement storage device.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
  • G06F 11/07 - Réaction à l'apparition d'un défaut, p. ex. tolérance de certains défauts
  • G06F 11/10 - Détection ou correction d'erreur par introduction de redondance dans la représentation des données, p. ex. en utilisant des codes de contrôle en ajoutant des chiffres binaires ou des symboles particuliers aux données exprimées suivant un code, p. ex. contrôle de parité, exclusion des 9 ou des 11
  • G06F 11/30 - Surveillance du fonctionnement

77.

SYSTEMS AND METHODS FOR MULTI-DOMAIN DATA MANAGEMENT

      
Numéro d'application 19275062
Statut En instance
Date de dépôt 2025-07-21
Date de la première publication 2026-02-12
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Arumugham, Kalaivani
  • Sarfare, Parag
  • Deskmukh, Prachi

Abrégé

A data management system can include a disk unit and a set of controllers. The disk unit can contain, at least in part, a set of storage media, a first persistent memory, and a second persistent memory. The set of storage media can be configured to implement a storage space. The set of controllers can be configured to write to the storage space and to implement a set of nodes including a first node and a second node. The first node can be configured to generate and write first node journal data to the first persistent memory. The second node can be configured to obtain a failure indication for the first node, obtain the first node journal data from the second persistent memory, and generate and provide a reply to a backend using the first node journal data.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 11/07 - Réaction à l'apparition d'un défaut, p. ex. tolérance de certains défauts

78.

Volume Placement Failure Isolation and Reporting

      
Numéro d'application 19210777
Statut En instance
Date de dépôt 2025-05-16
Date de la première publication 2026-02-12
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Witte, Wesley R.
  • Wu, Youyuan

Abrégé

Systems, methods, and machine-readable media are disclosed for isolating and reporting a volume placement error for a request to place a volume on a storage platform. A volume placement service requests information from a database using an optimized database query to determine an optimal location to place a new volume. The database returns no results. The volume placement service deconstructs the optimized database query to extract a plurality of queries. The volume placement service iterates over the plurality queries, combining queries in each iteration, to determine a cause for the database to return no results. The volume placement service determines based on the results of each iterative database request a cause the database to return an empty result. The volume placement service provides an indication of the cause for returning an empty result.

Classes IPC  ?

  • G06F 16/22 - IndexationStructures de données à cet effetStructures de stockage
  • G06F 16/2453 - Optimisation des requêtes

79.

PHYSICAL SIZE API FOR SNAPSHOTS BACKED UP TO OBJECT STORE

      
Numéro d'application 19302059
Statut En instance
Date de dépôt 2025-08-17
Date de la première publication 2026-02-12
Propriétaire NetApp Inc. (USA)
Inventeur(s)
  • George, Tijin
  • Yelheri, Sharankumar
  • Rajagopalan, Adhitya

Abrégé

Techniques are provided for determining a physical size of a snapshot backed up to an object store. Snapshot data of the snapshot may be backed up into objects that are stored from a node to the object store, such as a cloud computing environment. A tracking object is created to identify which objects within the object store comprise the snapshot data of the snapshot. In order to determine the physical size of the snapshot, the tracking object and/or tracking objects of other snapshots such as a prior snapshot are evaluated to identify a set of objects comprising snapshot data unique to the snapshot and not shared with the prior snapshot. The physical sizes of the set of objects are combined with a metadata size of metadata of the snapshot to determine the physical size of the snapshot.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 9/54 - Communication interprogramme
  • G06F 16/11 - Administration des systèmes de fichiers, p. ex. détails de l’archivage ou d’instantanés

80.

SNAPSHOT COPY OPERATION BETWEEN ENDPOINTS

      
Numéro d'application 19363318
Statut En instance
Date de dépôt 2025-10-20
Date de la première publication 2026-02-12
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • George, Tijin
  • Yelheri, Sharankumar
  • Dhavale, Sanhita Praveen
  • Wei, Chuyi
  • Sanchez Aguilera, Ricardo

Abrégé

Techniques are provided for implementing a snapshot copy operation between endpoints. One or more snapshots (e.g., snapshots of an on-premise volume) is stored within a source endpoint, such as a source bucket of an object store. A post operation is executed to copy objects comprising snapshot data of a snapshot from the source endpoint to a destination endpoint. A get operation and a tracking object such as a cookie is used to track progress of copying the objects from the source endpoint to the destination endpoint. The tracking object is used to restart the copying of the objects from a point where the copying left off (e.g., in the event there is a failure) without having to restart from the beginning.

Classes IPC  ?

  • G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p. ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
  • G06F 16/11 - Administration des systèmes de fichiers, p. ex. détails de l’archivage ou d’instantanés

81.

Prevention Of Residual Data Writes After Non-Graceful Node Failure In A Cluster

      
Numéro d'application 19356370
Statut En instance
Date de dépôt 2025-10-13
Date de la première publication 2026-02-05
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Knight, Clinton Douglas
  • Webster, Joseph Eli
  • Reeder, Christopher Michael

Abrégé

The technology disclosed herein enables a storage orchestrator controller to prevent residual data from being written to a storage volume when a node fails non-gracefully. In a particular example, a method includes determining a health status of nodes in the cluster and, in response to determining a node in the cluster failed, marking the node as dirty. After marking the node as dirty and in response to determining the node is ready, the method includes directing the node to erase data in one or more write buffers at the node. The one of more write buffers buffer data for writing to one or more storage volumes when the one or more storage volumes are mounted by the node. After the one or more write buffers are erased, the method includes marking the node as clean.

Classes IPC  ?

  • G06F 11/18 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage passif du défaut des circuits redondants, p. ex. par logique combinatoire des circuits redondants, par circuits à décision majoritaire
  • G06F 11/16 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel
  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
  • H04L 65/00 - Dispositions, protocoles ou services dans les réseaux de communication de paquets de données pour prendre en charge les applications en temps réel
  • H04L 67/00 - Dispositions ou protocoles de réseau pour la prise en charge de services ou d'applications réseau

82.

AUTOMATED QUALITY OF SERVICE MANAGEMENT MECHANISM

      
Numéro d'application 19302232
Statut En instance
Date de dépôt 2025-08-18
Date de la première publication 2026-02-05
Propriétaire NetApp, Inc. (USA)
Inventeur(s) V, Prajwal

Abrégé

A system is described. The system includes a processing resource and a non-transitory computer-readable medium, coupled to the processing resource, having stored therein instructions that when executed by the processing resource cause the processing resource to collect telemetry data of a distributed storage system associated with a client device, monitor a first set of the IOPS values, select a first IOPS value in the first set of the IOPS values as a highest IOPS value, determine whether the first IOPS value is unequal to a current Max-IOPS parameter value and adjust the Max-IOPS parameter value to be equal to the first IOPS value upon a determination that the first IOPS value is unequal to the current Max-IOPS parameter value.

Classes IPC  ?

  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]
  • G06F 9/46 - Dispositions pour la multiprogrammation
  • G06F 13/20 - Gestion de demandes d'interconnexion ou de transfert pour l'accès au bus d'entrée/sortie

83.

FILE METADATA SERVICE

      
Numéro d'application 19351606
Statut En instance
Date de dépôt 2025-10-07
Date de la première publication 2026-02-05
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kaplingat, Nikhil Bhavadas
  • Ganesan, Mohankumar
  • P, Rajasekar
  • Thanakodi, Guru Prashanth
  • Nadaf, Rashid Shabbir

Abrégé

Techniques are provided for maintaining and utilizing a file index and a file version index. Metadata may be evaluated to identify constant attributes and modifiable attributes of files. A file index of a file catalog may be populated with the constant attributes. A file version index of the file catalog may be populated with the modifiable attributes as file versions of the files. In response to receiving a request for a file, the file index and the file version index are evaluated to identify a location of the file within a data source. Access to the file at the location within the data source is provided.

Classes IPC  ?

  • G06F 16/907 - Recherche caractérisée par l’utilisation de métadonnées, p. ex. de métadonnées ne provenant pas du contenu ou de métadonnées générées manuellement
  • G06F 16/901 - IndexationStructures de données à cet effetStructures de stockage
  • G06F 16/9035 - Filtrage basé sur des données supplémentaires, p. ex. sur des profils d'utilisateurs ou de groupes
  • G06F 16/906 - GroupementClassement

84.

Storage operations based on enhanced contiguity awareness

      
Numéro d'application 18927221
Numéro de brevet 12541312
Statut Délivré - en vigueur
Date de dépôt 2024-10-25
Date de la première publication 2026-02-03
Date d'octroi 2026-02-03
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Callahan, Travis Ian
  • Hu, Jian

Abrégé

Improved write allocation in data storage systems is described. A data storage system controller determines a contiguity score for an allocation area on drives of the data storage system. The contiguity score for the allocation area is determined based on an evaluation of the contiguity of physical storage blocks mapped to the allocation area. A contiguity score is then determined for a secondary allocation area within the allocation area. The contiguity score for the secondary allocation area is determined based on an evaluation of the contiguity of physical storage blocks mapped to the smaller allocation area. The physical storage blocks mapped to the secondary allocation area are a subset of the physical storage blocks mapped to the primary allocation area. Where the contiguity score for the secondary allocation area meets or exceeds the contiguity score of the primary allocation area, the secondary allocation area is selected for use.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

85.

Dual-port interposer for storage drives

      
Numéro d'application 18785255
Numéro de brevet 12687962
Statut Délivré - en vigueur
Date de dépôt 2024-07-26
Date de la première publication 2026-01-29
Date d'octroi 2026-07-21
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Fiore, Edward Joseph
  • Ahmed, Reyaz

Abrégé

Techniques, equipment, and systems for enhanced storage systems and storage drive interfacing are presented herein. In one example, a storage interposer includes a storage device connector configured to couple a dual port interface selected among a first interface protocol and a second interface protocol, and a protocol unit configured to transfer storage transactions received over the dual port interface in a storage format. The storage interposer also includes a transaction unit configured to obtain the storage transactions in the storage format and process indications of which port among the dual port interface supplied each of the storage transactions against one or more criteria to order the storage transactions into a queue shared among the ports. A single port storage drive coupled to the storage interposer can be issued the storage transactions from the queue according to the order.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

86.

Coalescing multiple small writes to large files or multiple writes to a number of small files to generate larger compressible chunks for inline compression

      
Numéro d'application 18785672
Numéro de brevet 12656949
Statut Délivré - en vigueur
Date de dépôt 2024-07-26
Date de la première publication 2026-01-29
Date d'octroi 2026-06-16
Propriétaire NETAPP, INC. (USA)
Inventeur(s)
  • Tella, Venkateswarlu
  • Vineet, Ankur
  • Sharma, Palak
  • K N, Sindhushree

Abrégé

Systems and methods for coalescing writes to facilitate generation of larger compression groups for use during inline compression are provided. According to one embodiment, inline compression performed by a storage system is improved by temporarily staging writes to in-memory data structures (e.g., inline storage efficiency (ISE) index nodes (inodes)) and performing coalescing in a deferred manner to generate larger compression groups for use during performance of inline compression. In one example, all files may be treated in the same manner, for example, by staging writes within a staging area and then processing the staged data by an inline compression workflow. In another example, the staging processing for small and large file may be different. For instance, the data blocks associated with small files may be staged separately from data blocks associated with large files and/or data blocks of multiple small files may be staged within the same ISE inode.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

87.

SYSTEMS AND METHODS TO HANDLE DEPENDENT DATA, CONFLICTING DATA, OR METADATA OPERATIONS ON A DUAL COPY CROSS-SITE STORAGE SYSTEM WITH SIMULATANEOUS READ-WRITE ABILITY ON EACH COPY

      
Numéro d'application 18785773
Statut En instance
Date de dépôt 2024-07-26
Date de la première publication 2026-01-29
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kaushik, Akhil
  • Vijayan, Anoop
  • Shah, Dhruvil

Abrégé

The present storage solution provides an order of operations of a computer-implemented method that includes implementing a primary-First principle with a first data Op received by the primary storage site being executed on the primary storage site and then replicated to the secondary storage site and a second data Op received by the secondary storage site being first replicated to the primary storage site. The method further includes acquiring overlap write manager (OWM) lock locally on the primary storage site for the first data Op if there are no conflicting ops that are already inflight working on an overlapping range, sending the first data Op to a file system of the primary storage site to modify the file system as per primary-first principle, and suspending any new Ops from the primary storage site that have an overlapping range that overlaps with a range of the first data Op.

Classes IPC  ?

  • G06F 16/176 - Support d’accès partagé aux fichiersSupport de partage de fichiers
  • G06F 16/182 - Systèmes de fichiers distribués

88.

METHODS TO MAINTAIN READ-WRITE CONSISTENCY AND DEPENDENT WRITE ORDER CONSISTENCY WITHIN A CROSS-SITE STORAGE SYSTEM

      
Numéro d'application 18785783
Statut En instance
Date de dépôt 2024-07-26
Date de la première publication 2026-01-29
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Vijayan, Anoop
  • Kaushik, Akhil

Abrégé

The present storage solution provides an order of operations of a computer-implemented method for performing transient failure handling with an improved application I/O resumption time for a symmetric distributed storage system; an order of operations of a computer-implemented method for performing persistent failure handling with an improved application I/O resumption time for a symmetric distributed storage system; an order of operations of a computer-implemented method for performing transient failure handling with an improved application I/O resumption time to maintain dependent write order consistency for a symmetric distributed storage system; an order of operations of a computer-implemented method for performing secondary side write Op handling to maintain dependent write order consistency for a symmetric distributed storage system; and an order of operations of a computer-implemented method for performing secondary side read Op handling to maintain dependent write order consistency for a symmetric distributed storage system in accordance with some embodiments.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
  • G06F 16/11 - Administration des systèmes de fichiers, p. ex. détails de l’archivage ou d’instantanés
  • G06F 16/18 - Types de systèmes de fichiers

89.

SYSTEMS AND METHODS TO REPLICATE FILE CLONE OPERATIONS ON A DUAL COPY CROSS-SITE STORAGE SYSTEM WITH SIMULATANEOUS READ-WRITE ABILITY ON EACH COPY

      
Numéro d'application 18785830
Statut En instance
Date de dépôt 2024-07-26
Date de la première publication 2026-01-29
Propriétaire NetApp, Inc. (USA)
Inventeur(s) Vijayan, Anoop

Abrégé

A computer-implemented method includes receiving, with the primary storage site, a clone request for a copy of data, invoking, based on the clone request an asynchronous drain with hold (DWH) process to drain any inflight operations (ops) on the primary storage site and hold any new ops received on the primary storage site, sending a replication message from the primary storage site to the secondary storage site to invoke an asynchronous DWH process on the secondary storage site to drain any inflight ops on the secondary storage site and hold any new ops received on the secondary storage site, and waiting for a completion notification from both the DWH process of the primary storage site and the DWH process of the secondary storage site.

Classes IPC  ?

  • G06F 16/178 - Techniques de synchronisation des fichiers dans les systèmes de fichiers

90.

File clone creation for multipart files

      
Numéro d'application 18786752
Numéro de brevet 12688154
Statut Délivré - en vigueur
Date de dépôt 2024-07-29
Date de la première publication 2026-01-29
Date d'octroi 2026-07-21
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Melinamane, Gururaj Jayaram
  • Makam, Sumith

Abrégé

Techniques are provided for creating file clones of multipart files. Creating clones of files is an integral part of providing backup, restore, and other storage services. However, conventional file cloning techniques are unable to create clones of multipart files that are composed of multiple parts stored across different volumes and/or nodes in a constant time. The disclosed techniques are capable of cloning multipart files by creating a clone parent file into which catalog entries from a source multiple file are moved. A destination multipart file is initially created as an empty clone of the source multipart file. Block sharing of the catalog entries from the clone parent file to the source and destination multipart files is performed, and cloning of the source multipart file is declared complete in a constant time such as within a few seconds or less.

Classes IPC  ?

  • G06F 16/00 - Recherche d’informationsStructures de bases de données à cet effetStructures de systèmes de fichiers à cet effet
  • G06F 11/1446 -
  • G06F 16/16 - Opérations sur les fichiers ou les dossiers, p. ex. détails des interfaces utilisateur spécialement adaptées aux systèmes de fichiers

91.

DUAL-PORT INTERPOSER FOR STORAGE DRIVES

      
Numéro d'application US2025038582
Numéro de publication 2026/024673
Statut Délivré - en vigueur
Date de dépôt 2025-07-22
Date de publication 2026-01-29
Propriétaire NETAPP, INC. (USA)
Inventeur(s)
  • Fiore, Edward Joseph
  • Ahmed, Reyaz

Abrégé

Techniques, equipment, and systems for enhanced storage systems and storage drive interfacing are presented herein. In one example, a storage interposer (110) includes a storage device connector (112) configured to couple a dual port interface (141, 142) selected among a first interface protocol (141) and a second interface protocol (142), and a protocol unit (120, 725) configured to transfer storage transactions received over the dual port interface in a storage format. The storage interposer also includes a transaction unit (120, 726) configured to obtain the storage transactions in the storage format and process indications of which port among the dual port interface supplied each of the storage transactions against one or more criteria to order the storage transactions into a queue (121) shared among the ports. A single port storage drive (130) coupled to the storage interposer can be issued the storage transactions from the queue according to the order.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

92.

SYSTEMS AND METHODS TO REDUCE APPLICATION INPUT/OUTPUT RESUMPTION TIME DUE TO A FAILURE OF A STORAGE SITE OR A NETWORK PARTITION WITHIN A CROSS-SITE STORAGE SYSTEM

      
Numéro d'application 18785801
Statut En instance
Date de dépôt 2024-07-26
Date de la première publication 2026-01-29
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Shetty, Sohan
  • Kaushik, Akhil
  • Vijayan, Anoop
  • Chaudhary, Rohit
  • Parmar, Sunil

Abrégé

A computer-implemented method includes establishing bi-directional synchronous replication between one or more members of a first consistency group (CG1) of a primary storage site and one or more members of a second consistency group (CG2) of a secondary storage site with each storage site having read/write access. The method includes detecting a disruption in a data replication session from one or more members of the CG1 to one or more members of the CG2 due to a disaster event, initiating a consensus establishment request to be sent to a mediator agent of the primary storage site, rejecting with the mediator agent the consensus establishment request, and initiating a role flip process for primary and secondary roles in serving I/O Operations in response to the rejection of the consensus establishment request to reduce an application input/output (I/O) resumption time due to the disaster event.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

93.

Waypoint Prediction Engine(s) For Compressing Geographical Information System Data

      
Numéro d'application 18787863
Statut En instance
Date de dépôt 2024-07-29
Date de la première publication 2026-01-29
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Choinka, Gerard
  • Krug, Anton

Abrégé

Various embodiments of the present technology generally relate to systems and methods for providing a waypoint prediction engine and its related functions. In an aspect, a waypoint prediction engine may determine navigation data associated with a client device and a source model. Then a decompression-side of the waypoint prediction engine may generate a predicted waypoint based on the source model and the navigation data for the client device as the client device travels along a navigation route. The decompression-side may receive, from a compression-side of the waypoint prediction engine, a correction factor for the predicted waypoint. Responsive to receiving the correction factor, the decompression-side of the waypoint prediction engine may store the correction factor as associated with the source model, where the correction factor and the source model allow for recreation of the navigation route of the client device.

Classes IPC  ?

  • G01C 21/34 - Recherche d'itinéraireGuidage en matière d'itinéraire

94.

STORAGE DEVICE ENERGY CONSUMPTION EVALUATION AND RESPONSE

      
Numéro d'application 19346020
Statut En instance
Date de dépôt 2025-09-30
Date de la première publication 2026-01-29
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Stabler, Gregory Eugene
  • Barron, Ii, Edward John
  • Grindstaff, Chris Boyd
  • Rydeen, Michael James

Abrégé

Various mechanisms and workflows are described that can utilize power and/or carbon footprint-based metrics to manage storage unit usage and/or configuration, which can provide a more efficient and environmentally friendly computing environment. In some example configurations, storage system management mechanisms collect power consumption for storage units (e.g., individual drives, storage shelfs, nodes, clusters) and can utilize the power consumption information with other storage unit characteristics to generate power and carbon footprint metrics.

Classes IPC  ?

  • G06F 9/445 - Chargement ou démarrage de programme
  • G06F 1/26 - Alimentation en énergie électrique, p. ex. régulation à cet effet
  • G06F 1/32 - Moyens destinés à économiser de l'énergie
  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement
  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]
  • G06F 11/30 - Surveillance du fonctionnement

95.

Waypoint prediction engine(s) for compressing geographical information system data

      
Numéro d'application 18787830
Numéro de brevet 12536154
Statut Délivré - en vigueur
Date de dépôt 2024-07-29
Date de la première publication 2026-01-27
Date d'octroi 2026-01-27
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Choinka, Gerard
  • Krug, Anton

Abrégé

Various embodiments of the present technology generally relate to systems and methods for providing a waypoint prediction engine and its functions. For example, a waypoint prediction engine may determine navigation data associated with a client device and a source model. The waypoint prediction engine may determine a current waypoint of the client device as the client device travels along a navigation route and generate, by a compression-side of the waypoint prediction engine, a predicted waypoint based on the source model and the navigation data. The compression-side may determine an accuracy of the predicted waypoint and generate a correction factor based on the accuracy of the predicted waypoint. The compression-side may transmit the correction factor to a decompression-side of the waypoint prediction engine, which may, in turn store the correction factor such that the correction factor and the source model allow for recreation of the navigation route of the client device.

Classes IPC  ?

  • G06F 16/00 - Recherche d’informationsStructures de bases de données à cet effetStructures de systèmes de fichiers à cet effet
  • G01C 21/36 - Dispositions d'entrée/sortie pour des calculateurs embarqués
  • G06F 16/23 - Mise à jour
  • G06F 16/29 - Bases de données d’informations géographiques

96.

EXTERNAL DISTRIBUTED STORAGE LAYER UPGRADE

      
Numéro d'application 19344255
Statut En instance
Date de dépôt 2025-09-29
Date de la première publication 2026-01-22
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kerr, Brendan
  • Agarwal, Avesh Kumar
  • Busick, Christopher Alan
  • Cason, Christopher Lee
  • Knutson, Kyle Gene
  • Vinnakota, Mohinish

Abrégé

Techniques are provided for upgrading an external distributed storage layer that provides storage services to containerized applications hosted within a container hosting platform. An operator within the container hosting platform is custom configured to orchestrate, from within the container hosting platform, the upgrade for the external distributed storage layer. Because the external distributed storage layer and the container hosting platform are separate computing environment that utilize different namespaces, semantics, operating states, and/or application programming interfaces, a cluster controller within the container hosting platform is custom configured to reformat/translate commands between the external distributed storage layer and the container hosting platform for performing the upgrade. Because the external distributed storage layer upgrade may be part of an overall upgrade that upgrades the containerized applications hosted within the container hosting platform, the operator and cluster controller provide a single upgrade orchestration point for perform both upgrades in an orchestrated manner.

Classes IPC  ?

  • G06F 8/65 - Mises à jour
  • G06F 9/50 - Allocation de ressources, p. ex. de l'unité centrale de traitement [UCT]

97.

RESYNC TRANSFER FOR RECOVERING FROM STORAGE SITE FAILURE UTILIZING BACKGROUND PULL OPERATIONS

      
Numéro d'application 19296806
Statut En instance
Date de dépôt 2025-08-11
Date de la première publication 2026-01-15
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Kothiyal, Rachita
  • Pandit, Atul Ramesh
  • Naidu, Abhishek
  • Ponnapur, Anil Kumar
  • George, Tijin

Abrégé

Techniques are provided for performing a resync transfer to recover from a storage site failure. During normal operation of a first site hosting a first volume, data is replicated to a second volume hosted by a second site. If the first site fails, when clients are redirected to the second volume at the second site. When the first site recovers, data modifications made to the second volume are resynced back to the first volume. As part of synchronizing the first volume, a data warehouse is rebuilt at the first site in order to track the location of blocks present on the replication destination. Typically, the data modifications are transferred after the data warehouse is rebuilt, which results in significantly long resync times. The techniques provided herein decrease the resync time by either rebuilding the data warehouse in parallel with resyncing the data modifications or circumvent the need for rebuild.

Classes IPC  ?

  • G06F 11/16 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel

98.

REDUCING PROVISIONED STORAGE CAPACITY OF AN AGGREGATE OF A STORAGE APPLIANCE

      
Numéro d'application 19335761
Statut En instance
Date de dépôt 2025-09-22
Date de la première publication 2026-01-15
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Bhattacharjee, Mrinal K.
  • Korrakuti, Sreenath
  • Pola, Sateesh Kumar

Abrégé

Systems and methods for reducing the provisioned storage capacity of a storage device or aggregate of storage devices are provided. According to one embodiment, the size of the aggregate may be reduced by shrinking the file system of the storage appliance and removing a selected storage device from the aggregate. When an identified shrink region is less than the entire addressable space of the selected storage device, the file system is shrunk by relocating data from the shrink region of the selected storage device to one or more regions outside of the shrink region, mirroring data of the selected storage device from outside of the shrink region to a smaller storage device added to the aggregate, and then removing the selected storage device after the mirrors are in sync, thereby reducing the provisioned storage capacity by the difference in size between the selected storage device and the smaller storage device.

Classes IPC  ?

  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement

99.

ARTIFICIAL INTELLIGENCE BASED APPLICATION ERROR DETECTION AND RESOLUTION

      
Numéro d'application 18770725
Statut En instance
Date de dépôt 2024-07-12
Date de la première publication 2026-01-15
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Dasari, Ravi Sankar
  • Ravi, Sukanya
  • Ghai, Rohit

Abrégé

Techniques are provided for artificial intelligence (AI) based application error detection and resolution. Extensive amounts of time and resources are consumed by service providers when attempting to resolve application errors experienced by customers. Unfortunately, a service provider may spend tedious amounts of manual effort to evaluate and solve an error that is already known or already solved. The techniques provided herein reduce the amount of time and resources involved in detecting and resolving errors associated with applications. In particular, an error mapping is generated for a current troubleshooting case to resolve for an application. The error mapping is compared to error mappings of previously resolved troubleshooting cases. If a match is found, then a troubleshooting action associated with a previously resolved troubleshooting case is suggested or executed. Otherwise, a service ticket is created for solving the current troubleshooting cases.

Classes IPC  ?

  • G06F 11/07 - Réaction à l'apparition d'un défaut, p. ex. tolérance de certains défauts

100.

METHODS AND SYSTEMS FOR NEGOTIATING A PRIMARY BIAS STATE IN A DISTRIBUTED STORAGE SYSTEM

      
Numéro d'application 19336000
Statut En instance
Date de dépôt 2025-09-22
Date de la première publication 2026-01-15
Propriétaire NetApp, Inc. (USA)
Inventeur(s)
  • Shetty, Sohan
  • Vijayan, Anoop
  • Kaushik, Akhil
  • Chaudhary, Rohit

Abrégé

Systems and methods include negotiating a primary bias state for primary and secondary storage sites when a mediator is temporarily unavailable for a multi-site distributed storage system. In one example, a computer-implemented method comprises detecting, with the primary storage site having a primary storage cluster, a temporary loss of connectivity to a mediator or a failure of the mediator. The computer-implemented method includes negotiating the primary bias state and setting the primary bias state on a secondary storage cluster of the secondary storage site when the secondary storage cluster detects a temporary loss of connectivity to the mediator, determining whether the primary storage cluster receives a confirmation of the secondary storage cluster setting the primary bias state, and setting the primary bias state on the primary storage cluster when the primary storage cluster receives the confirmation.

Classes IPC  ?

  • G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p. ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
  • G06F 3/06 - Entrée numérique à partir de, ou sortie numérique vers des supports d'enregistrement
  • G06F 11/16 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel
  1     2     3     ...     34        Prochaine page