Abstract: A method, system, and computer program product to plan and schedule executions of various utility tasks of a utility command during a maintain window, the method including receiving a utility command. The method may also include identifying possible utility tasks used to execute the utility command. The method may also include determining preferred utility tasks. The method may also include calculating a degree of parallelism for the preferred utility tasks. The method may also include generating a utility execution plan for the utility command. The method may also include analyzing the utility execution plan against resource constraints of a time window and sub time windows of the time window. The method may also include generating a time window execution plan for each sub time window of the sub time windows. The method may also include updating the utility execution plan with the time window execution plans.

Abstract: An example operation may include a method comprising one or more of receiving a VNFC module LCM request where the LCM request specifies a VNFC instance (VNFCI), a target VNFC module, and an LCM operation to be performed, comprising retrieving a VNFCI data entry, determining a target OS installation of the VNFCI, establishing a secure connection to a target OS on a VNFCI hosting VM/container, determining a default command for the LCM operation, adapting the default command to the target OS, executing the adapted command, normalizing a response code, and sending a response to the VNFC module LCM request.

Abstract: Systems and methods are disclosed to implement a thread sensor generation system to generate thread sensors for extracting side channel information about other executing threads on a multithreading CPU. In embodiments, the system generates a set of sensors for evaluation. Each sensor may include a sequence of arithmetic or logic operations between variables or constants, which will cause a particular resource usage pattern by the CPU. The sensors are executed on the CPU in parallel with instances of a victim thread to measure an execution slowdown profile of the sensor thread caused by CPU resource conflicts with the victim thread. Based on the execution slowdown profiles, a sensitivity metric is calculated for each sensor, which is used to select the best sensor(s) for the victim thread. Sensors generated using the disclosed techniques can be used to extract secret information via side-channel attacks on currently available multithreaded processors.

Abstract: A computational storage processor (CSP) is provided that includes the CSP comprising a plurality of submission queues (SQs), a plurality of computational storage functions (CSFs), a CSF controller, and a CSP controller, and a method of controlling the CSP is provided that includes directing a first submission queue entry (SQE) that is written to a first one of the plurality of SQs to the CSF controller, generating, by the CSF controller, one or more secondary SQEs based on the first SQE, each of the one or more secondary SQEs is directed to a respective one of the CSFs, writing, by the CSF controller, the one or more secondary SQEs to a second one of the plurality of SQs, directing each of the one or more secondary SQEs to an associated respective one of the CSFs, and for each of the one or more secondary SQEs, performing, by the associated respective one of the CSFs, an operation associated with the secondary SQE.

Abstract: Systems and methods for threaded computing systems using allocated command identifier pools for command management are described. Command requests for different processing threads are received. Based on the thread assigned to process the command request, command identifiers are assigned from different pools of command identifiers for each thread, where each pool contains non-overlapping sets of command identifiers. The command identifiers are returned to the same pool that the command identifier came from upon completion of each command.

Abstract: A system and method for providing dynamic information virtualization (DIV) is disclosed. According to one embodiment, a device includes a dynamic optimization manager (DOM), a process and memory manager (PMM), a memory, and a host device driver. The device starts virtual functions after booting to allow a virtual machine (VM) running a guest operating system to identify the virtual functions and load virtual drivers of the virtual functions. The PMM allocates a unified cache from the memory to facilitate coherent access to information from storage and network resources by the VM. The host device driver enables a guest process in the VM to access the information stored in the unified cache in a secure and isolated manner.

Abstract: Systems and methods for transaction/file-based management of a plurality of processes associated with various jobs are provided. Through the management of discrete applications, a file distribution manager/scheduler orchestrates automated execution of different types of jobs. The processes executed for the various processes can vary based on job type, or other parameters.

Abstract: Embodiments identify heap-hoarding stack traces to optimize memory efficiency. Some embodiments can determine a length of time when heap usage by processes exceeds a threshold. Some embodiments may then determine heap information of the processes for the length of time, where the heap information comprise heap usage information for each interval in the length of time. Next, some embodiments can determine thread information of the one or more processes for the length of time, wherein determining the thread information comprises determining classes of threads and wherein the thread information comprises, for each of the classes of threads, thread intensity information for each of the intervals. Some embodiments may then correlate the heap information with the thread information to identify code that correspond to the heap usage exceeding the threshold. Some embodiments may then initiate actions associated with the code.

Abstract: Systems and techniques for adaptive limited-duration edge resource management are described herein. Available capacity may be calculated for a resource for a node of the edge computing network based on workloads executing on the node. Available set-aside resources may be determined based on the available capacity. A service request may be received from an application executing on the edge computing node. A priority category may be determined for the service request. Set-aside resources from the available set-aside resources may be assigned to a workload associated with the service request based on the priority category.

Abstract: A fog service layer architecture is disclosed using hierarchical fog node deployment including the co-existence and interactions of the fog node with a cloud node. The architecture also includes a list of functions, capabilities or services that are hosted in each fog node. One or more fog management procedures may be run between fog nodes (or between fogs and the cloud) and may comprise a fog capability discovery procedure, a fog connection verification procedure, and a fog capability status report procedure. In addition, fog nodes may be configured to interact with each other to get particular services using one or more fog service procedures described herein.

Abstract: A method of generating a user interface for presentation to a user. The method comprises executing a first application computer program to provide a user interface, executing agent computer program code to interrogate and modify said user interface during execution of said first application computer program, and presenting said modified user interface. The first application computer program may be run on a server, while the modified user interface may be presented to a user at a client connected to said server.

Abstract: A method of memory deallocation across a trust boundary between a first software component and a second software component is described. Some memory is shared between the first and second software components. An in-memory message passing facility is implemented using the shared memory. The first software component is used to deallocate memory from the shared memory which has been allocated by the second software component. The deallocation is done by: taking at least one allocation to be freed from the message passing facility; and freeing the at least one allocation using a local deallocation mechanism while validating that memory access to memory owned by data structures related to memory allocation within the shared memory are within the shared memory.

Abstract: Techniques for providing a framework for handling execution of HA flows in an active-active storage node configuration. The techniques include receiving notifications of functional statuses of processes and/or equipment associated with storage nodes in the active-active configuration, making determinations regarding how to address HA events occurring on the processes and/or equipment associated with the storage nodes based on the received notifications, and, in response to a request to execute an HA flow for a respective HA event, determining whether to refuse the request to execute the HA flow, service the request to execute the HA flow, abort one or more HA flows in execution, and/or postpone execution of the HA flow to a later time based on one or more dependencies defining conditions for the HA flow. In this way, mutual interference of HA flows or other process threads in the active-active configuration can be reduced or eliminated.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method, and/or computer program product embodiments for monitoring long-standing computing resources. An apparatus may operate by receiving a cloud monitoring notification, where the cloud monitoring notification may indicate an occurrence of a monitored condition. The apparatus may then operate by scanning a cluster computing system for resource having a client assigned resource identifier and a computing resource attribute based on a resource identifier scan parameter and a resource attribute scan parameter. The apparatus may further operate by generating a resource notification request based on the scanning of the cluster computing system and transmitting the resource notification request to a communications system to notify a user that the resource has a computing resource attribute that match the resource attribute scan parameter.

Abstract: Techniques for operating a computing system to perform neural network operations are disclosed. In one example, a method comprises receiving a neural network model, determining a sequence of neural network operations based on data dependency in the neural network model, and determining a set of instructions to map the sequence of neural network operations to the processing resources of the neural network processor. The method further comprises determining, based on a set of memory access operations included in the set of instructions, a first set of memory references associated with a first location of an external memory to store the input data and a second set of memory references associated with a second location of the external memory to store the output data, and generating an instruction file including the set of instructions, the first set of memory references and the second set of memory references.

Abstract: A request to perform a compute task is received. A plurality of compute processor resources eligible to perform the compute task is identified, wherein the plurality of compute processor resources includes two or more of the following: a field-programmable gate array, an application-specific integrated circuit, a graphics processing unit, or a central processing unit. Based on an optimization metric, one of the compute processor resources is dynamically selected to perform the compute task.

Abstract: To more properly size resources in a destination to which IT resources will be migrated, a system for appraising a resource configuration estimates a source's load model representing a load of first resources in a first computer system which is the source of migration and estimates a destination's load model representing a load of second resources to be built by migrating the first resources to a second computer system based on the source's load model. The system compares performance requirements of the first resources against the destination's load model and finds the destination's load model that is conformable to the performance requirements. When determining design values of the second resources' configuration, the system corrects those design values based on the destination's load model estimated conformable to the performance requirements to decrease design margins of the resource configuration using a design correction value defined to meet a service level requested.

Abstract: A method of generating a user interface for presentation to a user. The method comprises executing a first application computer program to provide a user interface, executing agent computer program code to interrogate and modify said user interface during execution of said first application computer program, and presenting said modified user interface. The first application computer program may be run on a server, while the modified user interface may be presented to a user at a client connected to said server.

Abstract: An automated improving of quality of service of a data center. Transients of a power grid fed to a power supply unit are monitored by a probe. Information on transients is provided across an interface to a server of the data center. Based on characteristics of the transients, a reliability of the data center is subjected to automated updating. A request for migration of workload requiring a higher reliability than the updated reliability can be sent to a central management. When the central management has identified another data center that can meet the required reliability, the central management migrates or relocates the workload to the another data center.

Abstract: A method for executing a task by a scheduling device, belonging to the technical field of electronics. The method includes: acquiring a target algorithm corresponding to a target task to be executed; acquiring an execution environment condition for a target algorithm, and current execution environment information of various execution devices; in the execution devices, determining a target execution device of which the execution environment information satisfies the execution environment condition; and sending a control message for executing the target task to the target execution device.