Abstract: The present disclosure relates to systems, methods, and computer-readable media for receiving usage data for a virtual device (or other virtual service), analyzing the usage data to determine a usage bucket characteristic of usage of the virtual device over a period of time, and determining a usage score for the virtual device. The systems described herein further involve causing a deployment of the virtual device to be upgraded, downgraded, or otherwise modified based on the usage bucket and associated usage score. The features and functionalities described herein can provide an efficient mechanism for administrating a tenant deployment as well as implementing a more efficient utilization of cloud computing resources for a variety of virtual services.

Abstract: A method may include receiving, from a first thread of a first operator performing a first operation of a query, a first request for memory allocation or memory deallocation. In response to the first request, a first local data structure of the first thread may be accessed to identify the first operator associated with the first request. A first memory usage metric for the first thread of the first operator may be updated based on the first request. A third memory usage metric for the first operator may be determined based on the first memory usage metric and a second memory usage metric for a second thread of the first operator. A fourth memory usage metric for a second operator may be determined based on a fifth memory usage metric for a third thread used by the second operator to perform a second operation of the query.

Abstract: An information processing system includes one or more memories, and one or more processors that execute a set of instructions to control adjustment of a resource amount of a processing system configured to execute processing requiring access to a database in response to issuance of an event requiring adjustment of the resource amount of the processing system, wherein, in a case where the database is in an inaccessible state, the resource amount of the processing system is not increased even if a first event requiring an increase of the resource amount of the processing system is issued, and wherein, in a case where the database is in an accessible state, the resource amount of the processing system is increased in response to issuance of the first event.

Abstract: Solutions preparing container images and data for container workloads prior to start times of workloads predicted through workload trend analysis. Local storage space on the node is managed based on workload trends, optimizing local storage of image files without requiring frequent reloading and/or deletion of image files, avoiding network intensive I/O operations when pulling images to local storage by workload scheduling systems. Systems perform collection of historical data including image and workload properties; analyze historical data for workload trends, including predicted start times, image files needed, number of nodes and types of nodes. Based on predicted future workload start times, nodes are selected from an ordered list of node requirements and workload properties.

Abstract: A method for managing radio and computing resources of a virtualized radio access network (vRAN) includes a number of virtualized radio access points (vRAPs) that share a common pool of central processing units (CPUs). The method includes dividing, per vRAP, an L1 layer processing pipeline into at least one main processing pipeline and into a number of subordinate processing pipelines, and coordinating the execution of the pipelines across multiple vRAPs. The coordinating includes allocating tasks of the main processing pipelines to dedicated CPUs, and allocating tasks of the subordinate processing pipelines to shared CPUs.

Abstract: A method for processing trust and security for leased infrastructure includes: detecting a first audit event directed to the leased infrastructure; initiating, in response to detecting the first audit event, an execution of a first trust audit; making a first determination, based on a result of the first trust audit, that the first audit event is a verified event; and transmitting, in response to the first determination and to a computing device of a user leasing the leased infrastructure, first instructions for the computing device to display a first output notifying the user that the leased infrastructure is in a trusted domain.

Abstract: A method includes analyzing, by a processing device, a set of container images. Each container image of the set of container images is built by executing a container image file having a plurality of lines arranged in accordance with an execution order. The method further includes assigning, by the processing device, a frequency of change to each line of the plurality lines in view of the set of container images, and modifying, by the processing device, the execution order to obtain a set of modified execution orders by reordering execution of at least a subset of the plurality of lines in view of their respective frequencies of change.

Abstract: A method and a first agent controlling computing resources in a first edge cloud, for supporting a machine learning operation. When detecting that additional computing resources outside the first edge cloud are needed for the machine learning operation, the first agent obtains said additional computing resources from a second edge cloud. The machine learning operation is then performed by using computing resources in the first edge cloud and the additional computing resources obtained from the second edge cloud.

Abstract: Systems and techniques for application profiling to resize and reconfigure compute instances are generally described. In some examples, a first application executing in a user space of a first compute instance may be determined. A Berkeley Packet Filter (BPF) process may be executed in the user space of the first compute instance. The BPF process monitors resource consumption of a first resource of the first compute instance. First consumption data for the first resource may be determined. The first consumption data may be associated with a first process of the first application over a first period of time. The first consumption data may be evaluated using first criteria. A configuration of a second compute instance may be determined based on evaluation of the first consumption data using the first criteria. The second compute instance may be deployed according to the configuration.

Abstract: Certain embodiments disclosed herein provide application-specific launch optimization. Aspects of the present disclosure include one or more cost functions for each application, where each cost function corresponds to a likelihood that a particular application should be placed into a particular pre-activation state. For each of the inactive applications, a respective one of the pre-activation states is selected based on comparing cost values obtained by evaluating the cost functions. Each of the inactive applications can be moved to or maintained in the respectively-selected pre-activation state to more efficiently provide an expedited application launch experience for a user.

Abstract: Embodiments of systems and methods for managing an Information Handling System (IHS) using a workspace orchestration system are described. In an illustrative, non-limiting embodiment, an IHS may include computer-executable instructions to, communicate with an operating system (OS) of the IHS to register for receiving one or more event messages, and communicate with the workspace to receive one or more event message subscriptions associated with an application configured in the workspace. The instructions are configured to store the one or more event message subscriptions at a specified location such that, when an event message is received from the OS, and when one the received event message comprises one of the event message subscriptions associated with the application, send the event message to the workspace.

Abstract: The present subject matter relates to a method comprising acquiring a master role by a processing unit of a multi-processor system, executing by the processing unit a master function part of a set of tasks: comprising searching an available processing unit of the multi-processor system; wherein in case an available processing unit is found, controlling the found processing unit to perform a slave function part of the set of tasks, and in case no available processing unit is found, executing by the processing unit the slave function part of the set of tasks, wherein the master function comprises a master to slave switching function for releasing the master role and the slave function composes a slave to master switching function for acquiring the master role.

Abstract: An executable monitoring agent executing commands on a host server monitors for commands it cannot execute. Upon receiving a command that it cannot execute the monitoring agent initiates a search for the capability to execute the command. Upon finding the capability on the host server it is downloaded and installed, giving the monitoring agent the requisite capability to execute the command.

Abstract: Techniques described herein relate to a method for performing computational offloads for composed information handling systems. The method includes obtaining, by a system control processor associated with a composed information handling system, a computational offload request associated with a dataset from an application executing on an at least one compute resource set; in response to obtaining the computational offload request: identifying a dataset location associated with the dataset in the composed information handling system; identifying resources of the composed information handling system capable of performing the computational offload request; selecting a resource of the resources to perform the computational offload; and initiating performance of the computational offload request on the selected resource.

Abstract: A method for processing information includes: detecting whether an application is launched; in response to detecting that the application is launched, determining a source for launching the application and detecting action information of the application; and displaying the source and the action information of the application.

Abstract: An algorithm execution management system of a provider network may receive a request from a user for executing an algorithm using different types of computing resources, including classical computing resources and quantum computing resources. The request may indicate a container that includes the algorithm code and dependencies such as libraries for executing the algorithm. The algorithm execution management system may first determine that the quantum computing resources are available to execute the algorithm, and then cause the classical computing resources to be provisioned. The algorithm execution management system may cause at least one portion of the algorithm to be executed at the classical computing resources using the container indicated by the user, and at least another portion of the algorithm to be executed at the quantum computing resources. The quantum task of the algorithm may be provided a priority during execution of the algorithm for using the quantum computing resources.

Abstract: Disclosed are various examples of provisioning a data processing unit (DPU) management operating system using a capsule. A management hypervisor installer executed on a host device receives a listing DPU device from a baseboard management controller (BMC). A preinstalled DPU management operating system image is identified for a DPU device from the listing, and is wrapped with a capsule that specifies the capsule as a DPU management operating system image capsule. A server component provides the DPU management operating system image capsule at a particular URI, and the URI is transmitted to the BMC.

Abstract: A system includes a computing infrastructure and an application prioritization system. The computing infrastructure includes a plurality of computing devices configured to implement computing applications. The application prioritization system receives application data associated with the computing applications. A request is received for a priority of a first computing application of the computing applications compared to a second computing application of the computing applications. The application prioritization system determines, using a feedback-based machine learning model, a first priority of the first computing application and a second priority of the second computing application and an explanation of the first and second priorities. A response is provided with an indication of the larger of the first priority and second priority and the explanation.

Abstract: A method includes processing event data to detect a status of a network function. The event data is processed based on two or more conditions defined by a correlation policy. The correlation policy includes a non-deterministic finite automata tree (NFAT) structure correlation policy having a policy type and a logic-gate. The method additionally includes determining the policy type of the NFAT structure correlation policy. The method also includes determining whether a first value of the two or more conditions is indicative of whether a first condition is satisfied. The method further includes determining whether a second value of the two or more conditions is indicative of whether the second condition is satisfied. The method additionally includes determining whether the NFAT structure correlation policy is satisfied based on the first value, the second value, the logic-gate and the policy type.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.