Abstract: Tasks of directed acyclic graphs (DAGs) may be dynamically scheduled based on a plurality of constraints and conditions, task prioritization policies, task execution estimates, and configurations of a heterogenous system. A machine learning component may be initialized to dynamically schedule the tasks of the DAGs.

Abstract: A method for resource management includes: providing a representation of a set of resources; obtaining a set of use requests, wherein a use request can be fulfilled by allocating a resource to the use request; wherein the resources are categorized into resource classes, so that resources in a resource class are interchangeable with respect to fulfilling a use request; wherein a use request can be fulfilled for a specific use period requested by the use request, by allocating a resource to a resource class requested by the use request; wherein a target distribution of resources for use requests is determined on the basis of an optimization parameterization; wherein the optimization parameterization is based on weightings of allocations of resources to use requests; wherein, further, to determine the target distribution, a starting solution is created that represents a distribution of resources for use requests, is provided.

Abstract: The subject matter described herein provides systems and techniques to address the challenges of growing hardware and workload heterogeneity using a Warehouse-Scale Computer (WSC) design that improves the efficiency and utilization of WSCs. The WSC design may include an abstraction layer and an efficiency layer in the software stack of the WSC. The abstraction layer and the efficiency layer may be designed to improve job scheduling, simplify resource management, and drive hardware-software co-optimization using machine learning techniques and automation in order to customize the WSC for applications at scale. The abstraction layer may embrace platform/hardware and workload diversity through greater coordination between hardware and higher layers of the WSC software stack in the WSC design. The efficiency layer may employ machine learning techniques at scale to realize hardware/software co-optimizations as a part of the autonomous WSC design.

Abstract: An event monitoring system includes a processor and a storage unit. The storage unit holds an event message including a character string related to an event occurring in an information system and guide information including one or more guides. The guide includes a guide message including a predetermined character string, notified in response to the event, and information regarding a coping method for the event. The processor compares the event message and the guide, associates the guide with the event in a case where the guide further includes information for identifying a variable portion of the guide message and a portion other than the variable portion of the guide message coincides with a portion other than a portion corresponding to the variable portion in the event message, and receives an input of information indicating a correct answer of a guide to be associated with the event in a case where the guide does not include the information for identifying the variable portion.

Abstract: For a first server virtual machine (VM) virtualizing a logical volume in a read/write mode for a client VM, a second server VM virtualizing the logical volume in an off mode is instantiated. The logical volume comprises a virtualization of a portion of physical storage. At the first server VM, the logical volume is deactivated, the deactivating disallowing the first server VM from performing a storage request from the client VM. At the second server VM, the logical volume is activated, the activating performed by causing the second VM to virtualize the logical volume in the read/write mode, the activating allowing the second server VM to perform the storage request.

Abstract: Message passing circuitry comprises lookup circuitry responsive to a producer request indicating message data provided on a target message channel by a producer node of a system-on-chip, to obtain, from a channel consumer information structure, selected channel consumer information associated with a given consumer node subscribing to the target message channel. Control circuitry writes the message data to a location associated with an address in a consumer-defined region of address space determined based on the selected channel consumer information. When an event notification condition is satisfied for the target message channel and the given consumer node, and an event notification channel is to be used, event notification data is written to a location associated with an address in a consumer-defined region of address space determined based on event notification channel consumer information associated with the event notification channel.

Abstract: Various approaches for exposing a virtual Non-Uniform Memory Access (NUMA) locality table to the guest OS of a VM running on NUMA system are provided. These approaches provide different tradeoffs between the accuracy of the virtual NUMA locality table and the ability of the system's hypervisor to migrate virtual NUMA nodes, with the general goal of enabling the guest OS to make more informed task placement/memory allocation decisions.

Abstract: Embodiments of the present disclosure provide a method, an electronic device, and a computer program product for using a virtual desktop. A method in one embodiment includes receiving, at a first edge node in a plurality of edge nodes, an instruction from a first set of input devices in a plurality of peripheral devices. The instruction is for use of a first virtual desktop deployed on the first edge node. The method further includes: using the first virtual desktop based on the instruction by using resources at the first edge node. The method further includes: sending data to an output device in the plurality of peripheral devices, wherein the data is associated with the use of the first virtual desktop. The solution for using a virtual desktop of the present application enables the use of a virtual desktop using resources at an edge node without requiring a client.

Abstract: A method includes: dequeuing a signal primitive from a signaling command queue in the set of command queues, the signal primitive pointing to a waiting command queue; in response to the signal primitive pointing to the waiting command queue, incrementing a number of pending signal primitives in the signal-wait counter matrix; dequeuing a wait primitive from the waiting command queue, the wait primitive pointing to the signaling command queue; in response to the wait primitive pointing to the signaling command queue, accessing the register to read the number of pending signal primitives; in response to the number of pending signal primitives indicating at least one pending signal primitive: decrementing the number of pending signal primitives; and dequeuing an instruction from the waiting command queue; and dispatching a control signal representing the instruction to a resource.

Abstract: A serverless query processing system receives a query and determines whether the query is a recurring query or a non-recurring query. The system may predict, in response to determining that the query is the recurring query, a peak resource requirement during an execution of the query. The system may compute, in response to determining that the query is the non-recurring query, a tight resource requirement corresponding to an amount of resources that satisfy a performance requirement over the execution of the query, where the tight resource requirement is less than the peak resource requirement. The system allocates resources to the query based on an applicable one of the peak resource requirement or the tight resource requirement. The system then starts the execution of the query using the resources.

Abstract: An example method of managing exclusive affinity for threads executing in a virtualized computing system includes: determining, by an exclusive affinity monitor executing in a hypervisor of the virtualized computing system, a set of threads eligible for exclusive affinity; determining, by the exclusive affinity monitor, for each thread in the set of threads, impact on performance of the threads for granting each thread exclusive affinity; and granting, for each thread of the set of threads having an impact on performance of the threads less than a threshold, exclusive affinity to respective physical central processing units (PCPUs) of the virtualized computing system.

Abstract: A method and apparatus are provided for allocating memory for geometry processing in a 3-D graphics rendering system comprising multiple cores. Geometry processing work is divided up into discrete work-packages, which form an ordered sequence. Cores are assigned different work-packages to process, and make memory allocation requests to enable them to store the results of the processing. Memory allocation requests relating to the current earliest uncompleted work-package in the sequence are treated differently to other requests, and may be prioritised.

Abstract: Methods, computer program products, and/or systems are provided that perform the following operations: determining a pacing requirement for host requests based on one or more thresholds; setting a pacing delay level based on the one or more thresholds in response to the determination of the pacing requirement; and implementing a memory request flow for a host request based on the pacing requirement and the pacing delay level.

Abstract: A method for managing information handling systems includes initiating, by a stackable system role (SSR) manager of an information handling system of the set of information handling systems, a boot sequence, making a first determination that the boot sequence does not specify a SSR of the information handling system, and based on the first determination: performing a hardware evaluation to determine a SSR for the information handling system, broadcasting the SSR to the set of information handling systems, obtaining, in response to the broadcasting, SSR responses from each information handling system in the set of information handling systems, making a second determination, based on the SSR responses, that an SSR agreement between the set of information handling systems is obtained, based on the second determination, determining a final SSR, and continuing the boot sequence using the final SSR.

Abstract: Improved systems and devices for medical imaging distribution are provided. A medical imaging order may be received from a medical facility that includes medical imaging. A configuration may be selected and applied based on a body site and an urgency field associated with the order that defines queueing rules for the medical imaging order. Utilization factors for queues associated with radiologists may also be determined. The configuration and the utilization factors may be used to determine a subset of queues associated with a subset of radiologists. The subset of queues may be prioritized based on certain requirements, such as how many medical imaging reports a particular radiologist is required to review, how many medical imaging reports are required to be allocated to a particular radiologist, and the like. The highest prioritized queue may be selected and the medical imaging order may be transmitted to the radiologist associated with that queue.

Abstract: Techniques and solutions are described for implementing virtual domains. Computing resources in a computing environment are determined and assigned to one or more virtual domains. One or more data structures can be located in a given virtual domain. The computing resources assigned to a virtual domain can be dynamically reconfigured without affecting processes that submit tasks to be performed on data structures in the virtual domains. Tasks can be submitted to a dispatcher, which can determine the appropriate virtual domain for the task and forward the task to the determined virtual domain. Tasks are received by virtual domains and assigned to worker threads, which can access a data structure specified for a given task.

Abstract: A function processing service may receive a request to execute source code. The source code may include instructions to perform a function. The function processing service may determine whether at least one hardware acceleration condition has been satisfied for the function. If at least one hardware acceleration condition has been satisfied, the instructions in the source code may be translated into hardware-specific code corresponding to a hardware circuit. The hardware circuit may be configured based on the hardware-specific code, and the hardware circuit may perform the function. The function processing service may then provide the result obtained from the hardware circuit to the requesting entity.

Abstract: Provided herein are an electronic apparatus and a controlling method thereof. An electronic apparatus according to the disclosure includes a communicator, a memory storing information on a recipe wherein a plurality of unit functions for provision of a service are combined, and a processor configured to, based on receiving information for a unit function that can be performed at each electronic apparatus from each of a plurality of electronic apparatuses through the communicator, identify a plurality of electronic apparatuses matched to the plurality of unit functions included in the recipe based on the received information, and control the communicator to transmit a signal for performing each matched unit function to each of the plurality of identified electronic apparatuses.

Abstract: A processing request management apparatus includes: an estimation unit which estimates a time required for processing for each of a plurality of processing requests for which desired processing completion times are designated; and a determination unit which determines an execution order of processing for the plurality of processing requests such that a sum of delays of estimated processing completion times based on the required time with respect to the desired processing completion times for the respective processing requests in the plurality of processing requests is minimized, to increase a likelihood of restrictions with respect to processing requests being satisfied.

Abstract: An example apparatus includes a dependency graph generator to generate a dependency graph based on a resource request file specifying a first resource and a second resource to deploy to a resource-based service, the dependency graph representative of the first resource being dependent on a second resource, a verification controller to generate a status indicator after a determination that a time-based ordering of a first request relative to a second request satisfies the dependency graph, and a resource controller to cause transmission of the first request and the second request to the resource-based service based on the dependency graph, and, after determining that the time-based ordering of the first request relative to the second request satisfies the dependency graph, cause transmission of the status indicator to a user device.