|
|
| Line 1: |
Line 1: |
| − | '''Summary of the patent applications from Red Hat, Inc. on November 30th, 2023'''
| |
| − |
| |
| − | Red Hat, Inc. has recently filed several patents related to optimizing data access in a virtualized execution environment, generating graphical user interfaces for flow data in programmable network switches, protecting communication in mesh networks, dividing processes into separate services, seamlessly switching between classical and quantum controllers, processing health data from multiple clients, improving the portability of checkpoints in applications, replacing software containers with new versions, selecting and applying application configurations, and removing inactive components from code generation.
| |
| − |
| |
| − | Summary:
| |
| − | Red Hat, Inc. has filed a series of patents covering various aspects of computing and networking technologies. These patents aim to optimize data access in virtualized execution environments, generate graphical user interfaces for flow data in programmable network switches, protect communication in mesh networks, divide processes into separate services, seamlessly switch between classical and quantum controllers, process health data from multiple clients, improve the portability of checkpoints in applications, replace software containers with new versions, select and apply application configurations, and remove inactive components from code generation.
| |
| − |
| |
| − | Notable Applications:
| |
| − | * Optimizing data access in virtualized execution environments.
| |
| − | * Generating graphical user interfaces for flow data in programmable network switches.
| |
| − | * Protecting communication in mesh networks.
| |
| − | * Dividing processes into separate services.
| |
| − | * Seamlessly switching between classical and quantum controllers.
| |
| − | * Processing health data from multiple clients.
| |
| − | * Improving the portability of checkpoints in applications.
| |
| − | * Replacing software containers with new versions.
| |
| − | * Selecting and applying application configurations.
| |
| − | * Removing inactive components from code generation.
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| | ==Patent applications for Red Hat, Inc. on November 30th, 2023== | | ==Patent applications for Red Hat, Inc. on November 30th, 2023== |
| | | | |
| Line 30: |
Line 8: |
| | Edoardo Vacchi | | Edoardo Vacchi |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a method for generating metadata to aid in code generation.
| |
| − | * The method involves receiving two files, each containing information about different sets of components in different notation syntaxes.
| |
| − | * The first file and the second file are cross-validated to ensure that a reference from a component in the first set to a component in the second set is valid.
| |
| − | * A metadata file is generated, containing identification information about the valid reference.
| |
| − | * Code is then generated based on the metadata file, the first file, and the second file, which can be executed.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | In various examples disclosed herein, provided is a method for generating metadata to facilitate code generation. The method can include receiving a first file that includes information relating to a first set of components in a first notation syntax and a second file that includes information relating to a second set of components in a second notation syntax. The method can also include cross-validating the first file and the second file to determine that a first reference, in a first component of the first set of components, to a second component of the second set of components is valid. The method can also include generating a first metadata file that includes identification information relating to the first reference. The method can also include generating code to be executed based on the first metadata file, the first file, and the second file.
| |
| | | | |
| | ===MAPPING DATA MODELS TO FACILITATE CODE GENERATION ([[US Patent Application 17824002. MAPPING DATA MODELS TO FACILITATE CODE GENERATION simplified abstract|17824002]])=== | | ===MAPPING DATA MODELS TO FACILITATE CODE GENERATION ([[US Patent Application 17824002. MAPPING DATA MODELS TO FACILITATE CODE GENERATION simplified abstract|17824002]])=== |
| Line 48: |
Line 16: |
| | Edoardo Vacchi | | Edoardo Vacchi |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | - The patent application describes a method for mapping data models to facilitate code generation.
| |
| − | - The method involves receiving two files, each containing a data model for a group of components.
| |
| − | - The first data model is converted into a first intermediate data model, and the second data model is converted into a second intermediate data model.
| |
| − | - The first intermediate data model is then mapped to the second intermediate data model to identify matching elements.
| |
| − | - Based on this mapping, code is generated for execution.
| |
| − | - The purpose of this method is to streamline the process of generating code by mapping data models and generating code based on the identified matches.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | In various examples disclosed herein, provided is a method for mapping data models to facilitate code generation. The method can include receiving a first file comprising a first data model of a first group of components and a second file comprising a second data model of a second group of components. The method can also include converting the first data model into a first intermediate data model. The method can also include converting the second data model into a second intermediate data model. The method can also include mapping the first intermediate data model to the second intermediate data model to generate a map of matching elements. The method can also include generating code to be executed based at least in part on the map of matching elements.
| |
| | | | |
| | ===META-OPERATORS FOR MANAGING OPERATOR GROUPS ([[US Patent Application 18332035. META-OPERATORS FOR MANAGING OPERATOR GROUPS simplified abstract|18332035]])=== | | ===META-OPERATORS FOR MANAGING OPERATOR GROUPS ([[US Patent Application 18332035. META-OPERATORS FOR MANAGING OPERATOR GROUPS simplified abstract|18332035]])=== |
| Line 67: |
Line 24: |
| | Paolo Antinori | | Paolo Antinori |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for adding an operator to a group of operators on a containerized computing services platform. It determines if the group of operators is complete and generates instructions for managing the installation of the group of operators.
| |
| − |
| |
| − | * Method for adding an operator to a group of operators on a containerized computing services platform
| |
| − | * Determines if the group of operators is complete
| |
| − | * Generates instructions for managing the installation of the group of operators
| |
| − | * Uses a set of meta-operator parameters, including a meta-operator identifier
| |
| − | * Provides a way to efficiently manage the installation of operators on the platform
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method includes adding, by a processing device, an operator to a group of operators to be installed on a containerized computing services platform, determining, by the processing device, whether the group of operators is complete, and responsive to determining that the group of operators is complete, generating, by the processing device based on a set of meta-operator parameters comprising a meta-operator identifier, a meta-operator comprising instructions for managing installation of the group of operators on the containerized computing services platform.
| |
| | | | |
| | ===PROVIDING ACCESS TO HISTORICAL METADATA FOR SOFTWARE REPOSITORIES ([[US Patent Application 17826918. PROVIDING ACCESS TO HISTORICAL METADATA FOR SOFTWARE REPOSITORIES simplified abstract|17826918]])=== | | ===PROVIDING ACCESS TO HISTORICAL METADATA FOR SOFTWARE REPOSITORIES ([[US Patent Application 17826918. PROVIDING ACCESS TO HISTORICAL METADATA FOR SOFTWARE REPOSITORIES simplified abstract|17826918]])=== |
| Line 87: |
Line 32: |
| | Robert Starr | | Robert Starr |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This patent application describes a method for constructing software builds using previously recorded software repository metadata. Here are the key points:
| |
| − |
| |
| − | * The method involves recording metadata for a software repository at different times using a first application programming interface.
| |
| − | * The recorded metadata includes a timestamp indicating the time it was recorded.
| |
| − | * When a request for metadata at a specific time is received, the method determines the latest timestamp that comes before the requested time.
| |
| − | * The method then provides the client device with access to the metadata associated with the latest timestamp.
| |
| − | * This metadata can be used to produce a software build that reflects the characteristics of the software repository at the requested time.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Software builds can be constructed according to previously recorded software repository metadata. For example, a computing device can record, by a first application programming interface, metadata for a software repository at various times. The metadata can include a timestamp indicating a time that the metadata was recorded. The computing device can receive a metadata request for metadata for the software repository at a particular time. The first application programming interface can determine a latest timestamp that precedes the particular time. The computing device can provide the client device with access to the metadata associated with the latest timestamp for use in producing a software build having characteristics of the metadata at the particular time.
| |
| | | | |
| | ===REMOVING INACTIVE CODE TO FACILITATE CODE GENERATION ([[US Patent Application 17752757. REMOVING INACTIVE CODE TO FACILITATE CODE GENERATION simplified abstract|17752757]])=== | | ===REMOVING INACTIVE CODE TO FACILITATE CODE GENERATION ([[US Patent Application 17752757. REMOVING INACTIVE CODE TO FACILITATE CODE GENERATION simplified abstract|17752757]])=== |
| Line 107: |
Line 40: |
| | Edoardo Vacchi | | Edoardo Vacchi |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a method for removing inactive components from code generation.
| |
| − | * The method involves receiving two files, each containing a group of components written in different notation syntax.
| |
| − | * Inactive components are identified within each group of components.
| |
| − | * Active components, which are not marked as inactive, are identified.
| |
| − | * Code is then generated based on the active components for execution.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Removing inactive components to facilitate code generation. A first file that includes a first group of components in a first notation syntax and a second file that includes a second group of components in a second notation syntax is received. A first set of inactive components of the first group of components is identified. A second set of inactive components of the second group of components is identified. The components of the first group of components and the second group of components that are not marked as inactive components are active components. Code to be executed based on the active components is generated.
| |
| | | | |
| | ===TESTING AND SELECTION OF EFFICIENT APPLICATION CONFIGURATIONS ([[US Patent Application 18233597. TESTING AND SELECTION OF EFFICIENT APPLICATION CONFIGURATIONS simplified abstract|18233597]])=== | | ===TESTING AND SELECTION OF EFFICIENT APPLICATION CONFIGURATIONS ([[US Patent Application 18233597. TESTING AND SELECTION OF EFFICIENT APPLICATION CONFIGURATIONS simplified abstract|18233597]])=== |
| Line 125: |
Line 48: |
| | Sebastian Laskawiec | | Sebastian Laskawiec |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | - The patent application describes methods and systems for selecting, testing, and applying application configurations.
| |
| − | - The method involves executing an application with a first configuration and measuring a set of metrics.
| |
| − | - A machine learning model is used to identify changes to the configuration settings that could improve the application's performance.
| |
| − | - These identified changes generate new configurations for future executions of the application.
| |
| − | - The second configuration is selected based on the metrics from the first execution and additional metrics from a second execution of the application.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for selecting, testing, and applying application configurations are presented. In one embodiment, a method is provided that includes executing an application according to a first configuration and measuring a first plurality of metrics. One or more changes to a plurality of configuration settings of the first configuration may be identified by a machine learning model to generate one or more new configurations. Among the one or more new configurations, a second configuration for future executions of the application may be selected based on the first plurality of metrics and a second plurality of metrics associated with an execution of the application.
| |
| | | | |
| | ===INHERITANCE CONTAINER SERVICE ([[US Patent Application 17752395. INHERITANCE CONTAINER SERVICE simplified abstract|17752395]])=== | | ===INHERITANCE CONTAINER SERVICE ([[US Patent Application 17752395. INHERITANCE CONTAINER SERVICE simplified abstract|17752395]])=== |
| Line 143: |
Line 56: |
| | Leigh Griffin | | Leigh Griffin |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a method for processing logic to replace a software container with a new version based on certain criteria being met. Here are the key points:
| |
| − |
| |
| − | * The processing logic creates a first container with a specific software version.
| |
| − | * The processing logic then creates a second container with a different software version within the first container.
| |
| − | * The second container is tested to determine if it meets one or more criteria.
| |
| − | * If the second container satisfies the criteria, the processing logic replaces the first container with the second container.
| |
| − | * This method allows for the seamless transition from one software version to another within a container.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Processing logic may provide a first container having a first software version. Processing logic may create a second container having a second software version within the first container. Processing logic may replace the first container with the second container, in response to testing of the second container satisfying one or more criteria.
| |
| | | | |
| | ===PORTABILITY OF CHECKPOINTS OF AN APPLICATION USING CENTRAL PROCESSING UNIT (CPU)-SPECIFIC FUNCTIONS ([[US Patent Application 17804230. PORTABILITY OF CHECKPOINTS OF AN APPLICATION USING CENTRAL PROCESSING UNIT (CPU)-SPECIFIC FUNCTIONS simplified abstract|17804230]])=== | | ===PORTABILITY OF CHECKPOINTS OF AN APPLICATION USING CENTRAL PROCESSING UNIT (CPU)-SPECIFIC FUNCTIONS ([[US Patent Application 17804230. PORTABILITY OF CHECKPOINTS OF AN APPLICATION USING CENTRAL PROCESSING UNIT (CPU)-SPECIFIC FUNCTIONS simplified abstract|17804230]])=== |
| Line 163: |
Line 64: |
| | Ashutosh Mehra | | Ashutosh Mehra |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a system and method for improving the portability of checkpoints in an application using CPU-specific features.
| |
| − |
| |
| − | * The system includes a source computing system and a destination computing system.
| |
| − | * The source computing system executes an application with multiple implementations of a function.
| |
| − | * When a request to resolve an implementation decision for the function is received, the source computing system selects a source-specific implementation based on the CPU-specific features of the source system.
| |
| − | * The source computing system patches the call site associated with the function with the address of the source-specific implementation.
| |
| − | * A checkpoint of the application, including the resolved callsite table, is sent to the destination computing system.
| |
| − | * The destination computing system restores the application by changing the implementation decision based on the CPU-specific features of the destination system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Systems and methods are described for improving portability of checkpoints of an application using central processing unit (CPU)-specific features. In an example, a system includes a source computing system and a destination computing system. The source computing system may be configured to: cause a first execution of an application that includes a function associated with a plurality of implementations; receive a request to resolve an implementation decision for the function; select, based on a set of source CPU-specific features, a source-specific implementation for the first execution of the function; patch, by rendering a resolved callsite table, a call site associated with the function with an address of the source-specific implementation; and send, to a destination computing system, a checkpoint of the application that includes the resolved callsite table. The destination computing system is configured to restore the application by changing the implementation decision based on a set of destination CPU-specific features.
| |
| | | | |
| | ===AUTOMATED CONDITIONAL UPDATE ([[US Patent Application 17752063. AUTOMATED CONDITIONAL UPDATE simplified abstract|17752063]])=== | | ===AUTOMATED CONDITIONAL UPDATE ([[US Patent Application 17752063. AUTOMATED CONDITIONAL UPDATE simplified abstract|17752063]])=== |
| Line 184: |
Line 72: |
| | William Trevor King | | William Trevor King |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a system for processing health data from multiple clients.
| |
| − | * The health data includes information about the clients, their health status, and the software version they are using.
| |
| − | * The processing logic analyzes the health data to determine a conditional risk associated with certain attributes and the software version.
| |
| − | * The conditional risk is stored in memory and can be accessed by the clients.
| |
| − | * The system aims to provide clients with information about potential risks based on their attributes and software version.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Processing logic may obtain health data from each of a plurality of clients. The health data includes attributes of a respective one of the plurality of clients, a health status of the respective one of the plurality of clients, and a software version of the respective one of the plurality of clients. Processing logic may determine a conditional risk that is associated with at least one of the attributes and the software version, in view of the health data, and store the conditional risk in memory. Processing logic can make the conditional risk, which includes the attributes and the software version, available to a client.
| |
| | | | |
| | ===MVC INSPIRED QUANTUM-CLASSICAL SERVICE ([[US Patent Application 17824813. MVC INSPIRED QUANTUM-CLASSICAL SERVICE simplified abstract|17824813]])=== | | ===MVC INSPIRED QUANTUM-CLASSICAL SERVICE ([[US Patent Application 17824813. MVC INSPIRED QUANTUM-CLASSICAL SERVICE simplified abstract|17824813]])=== |
| Line 202: |
Line 80: |
| | Leigh Griffin | | Leigh Griffin |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This patent application describes a technique for seamlessly switching between a classical controller and a quantum controller to process requests for an application.
| |
| − |
| |
| − | * The classical controller and the quantum controller both implement the same logic for the application.
| |
| − | * The classical controller interfaces with a model and a view as part of a model, view, and controller (MVC) framework.
| |
| − | * A Quantum Model View Controller (QMVC) service determines whether the request should be processed by the classical or quantum controller.
| |
| − | * If the request is to be processed by the quantum controller, the QMVC service diverts the request to the quantum controller.
| |
| − | * The quantum controller is provided with a first application program interface (API) gateway to the model and a second API gateway to the view.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure provide techniques for seamlessly switching between a classical controller and a quantum controller that both implement an application, based on which controller is better suited for processing a received request for functionality of the application. The classical controller and the quantum controller both implement the same logic for the application, and the classical controller interfaces with a model and a view as part of a model, view and controller (MVC) framework. A Quantum Model View Controller (QMVC) service determines whether the request is to be processed by the classical or quantum controller. In response to determining that the request is to be processed by the quantum controller, the QMVC service diverts the request to the quantum controller and provide a first application program interface (API) gateway between the quantum controller and the model and a second API gateway between the quantum controller and the view.
| |
| | | | |
| | ===SEGMENTING PROCESSES INTO STAND-ALONE SERVICES ([[US Patent Application 17752546. SEGMENTING PROCESSES INTO STAND-ALONE SERVICES simplified abstract|17752546]])=== | | ===SEGMENTING PROCESSES INTO STAND-ALONE SERVICES ([[US Patent Application 17752546. SEGMENTING PROCESSES INTO STAND-ALONE SERVICES simplified abstract|17752546]])=== |
| Line 222: |
Line 88: |
| | Edoardo Vacchi | | Edoardo Vacchi |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a method for dividing processes into separate services.
| |
| − | * The method involves receiving a file with information about multiple components.
| |
| − | * It calculates the resource cost of deploying each component in a separate service and in a single service.
| |
| − | * It then determines a segmentation plan that groups components into services with a lower resource cost.
| |
| − | * Finally, it generates instructions to deploy these services on computing devices.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | In various examples disclosed herein, provided is a method for segmenting processes into stand-alone services. The method can include receiving a file that includes information relating to a plurality of components. The method can also include determining a first resource cost associated with deploying each component in a respective service and a second resource cost associated with deploying each component in a single service. The method can also include determining a segmentation plan that segments the plurality of components into groups of one or more components that can be executed by respective services, where a third resource cost associated with the segmentation plan is lower than the first resource cost and the second resource cost. The method can also include generating instructions to deploy the respective services on the one or more computing devices.
| |
| | | | |
| | ===DOMAIN SPECIFIC LANGUAGE FOR PROTECTED MESH COMMUNICATION ([[US Patent Application 17825044. DOMAIN SPECIFIC LANGUAGE FOR PROTECTED MESH COMMUNICATION simplified abstract|17825044]])=== | | ===DOMAIN SPECIFIC LANGUAGE FOR PROTECTED MESH COMMUNICATION ([[US Patent Application 17825044. DOMAIN SPECIFIC LANGUAGE FOR PROTECTED MESH COMMUNICATION simplified abstract|17825044]])=== |
| Line 240: |
Line 96: |
| | Leigh Griffin | | Leigh Griffin |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The patent application describes a system and method for protecting communication in a mesh network of nodes.
| |
| − |
| |
| − | * The system receives a request from a node that wants to join the mesh network.
| |
| − | * The permissions of the joiner node are validated before granting access to the network.
| |
| − | * The system acquires one or more dictionary objects based on the permissions.
| |
| − | * A control node of the mesh network grants access rights to the joiner node by transmitting an access rights message.
| |
| − | * The access rights message includes the one or more dictionary objects, which the joiner node stores locally.
| |
| − | * The joiner node uses the stored dictionary objects when communicating with other nodes in the mesh network.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system and method of protecting communication in a mesh network of nodes. The method including receiving a request from a joiner node of the mesh network to join the mesh network. The method including validating permissions for the joiner node responsive to receiving the request. The method including acquiring one or more dictionary objects based on the permissions. The method including granting, by a control node of a mesh network, access rights for the joiner node to join the mesh network by transmitting an access rights message comprising the one or more dictionary objects to the joiner node, wherein the access rights message causes the joiner node to locally store the one or more dictionary objects and use the one or more dictionary objects when communicating with one or more nodes of the mesh network.
| |
| | | | |
| | ===INTERACTIVE GRAPHICAL USER INTERFACE FOR VISUALIZING FLOW DATA IN A PROGRAMMABLE NETWORK SWITCH ([[US Patent Application 17751780. INTERACTIVE GRAPHICAL USER INTERFACE FOR VISUALIZING FLOW DATA IN A PROGRAMMABLE NETWORK SWITCH simplified abstract|17751780]])=== | | ===INTERACTIVE GRAPHICAL USER INTERFACE FOR VISUALIZING FLOW DATA IN A PROGRAMMABLE NETWORK SWITCH ([[US Patent Application 17751780. INTERACTIVE GRAPHICAL USER INTERFACE FOR VISUALIZING FLOW DATA IN A PROGRAMMABLE NETWORK SWITCH simplified abstract|17751780]])=== |
| Line 261: |
Line 104: |
| | Adrian Moreno Zapata | | Adrian Moreno Zapata |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This patent application describes a computing device that can receive flow data from one or more flow tables in a programmable network switch. The device can then generate a graphical user interface that shows the relationships between recirculation operations defined in the flow data.
| |
| − |
| |
| − | * The computing device receives flow data from flow tables in a programmable network switch.
| |
| − | * It generates a graphical user interface that displays the relationships between recirculation operations.
| |
| − | * The graphical user interface includes a directed graph with nodes representing the recirculation operations.
| |
| − | * Directed links in the graph specify the sequential order in which the recirculation operations are applied to data packets.
| |
| − | * Each node in the graph corresponds to a specific recirculation operation.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A computing device can receive flow data from one or more flow tables for a programmable network switch. The computing device can also generate, based on the flow data, a graphical user interface showing relationships between recirculation operations defined in the flow data. The graphical user interface can include a directed graph having nodes representing the recirculation operations. The graphical user interface can also include directed links specifying a sequential order in which the recirculation operations are to be applied to data packets by the programmable network switch. Each of the nodes can correspond to a respective recirculation operation among the recirculation operations.
| |
| | | | |
| | ===WORKLOAD-BASED CACHE COMPRESSION IN A DISTRIBUTED STORAGE SYSTEM ([[US Patent Application 17829334. WORKLOAD-BASED CACHE COMPRESSION IN A DISTRIBUTED STORAGE SYSTEM simplified abstract|17829334]])=== | | ===WORKLOAD-BASED CACHE COMPRESSION IN A DISTRIBUTED STORAGE SYSTEM ([[US Patent Application 17829334. WORKLOAD-BASED CACHE COMPRESSION IN A DISTRIBUTED STORAGE SYSTEM simplified abstract|17829334]])=== |
| Line 280: |
Line 111: |
| | | | |
| | Gabriel Zvi BenHanokh | | Gabriel Zvi BenHanokh |
| − |
| |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for optimizing data access in a virtualized execution environment.
| |
| − |
| |
| − | * The method involves receiving a data access request from a storage system in a virtualized execution environment.
| |
| − | * The virtualized execution environment includes a virtualized execution image, which is associated with the environment.
| |
| − | * The method identifies an application running in the virtualized execution environment by examining metadata in the virtualized execution image, such as the application name or version.
| |
| − | * A cache classification is generated based on the identified application, indicating whether the data accessed by the application is suitable for cache compression.
| |
| − | * The data access request includes a tag that specifies whether cached data should be accessed in a compressed-memory cache, based on the cache classification.
| |
| − | * The data access request is then sent to a server of the storage system for processing.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An example method may include receiving, in a virtualized execution environment, a data access request from a storage system, identifying, in view of a virtualized execution image associated with the virtualized execution environment, an application running in the virtualized execution environment, generating a cache classification that specifies whether data accessed by the application is suitable for cache compression, including, in the data access request, a tag indicating whether cached data is to be accessed in a compressed-memory cache, wherein the tag is determined in view of the cache classification, and sending, to a server of the storage system, the data access request. The application can be identified in view of metadata included in the virtualized execution image, where the metadata comprises one or more of an application name or an application version.
| |
