Abstract: In one or more embodiments, one or more systems, one or more methods, and/or one or more processes may determine an identification of an application executing on an information handling system (IHS); determine a first performance profile based at least on a policy and based at least on the identification of the application; configure a processor to utilize power up to a first power level based at least on the first performance profile; determine that a user physically utilizes at least one human input device of the IHS within an amount of time transpiring; receive information indicating that the user is physically in contact with the IHS; determine a second performance profile based at least on the policy and based at least on the information; and configure the processor to utilize power up to a second power level based at least on the second performance profile.

Abstract: A plurality of low-performance locks within a computing environment are monitored. It is identified that, during a time window, threads of one of the plurality of low-performance locks are in a lock queue for an average time that exceeds a time threshold. It is further identified that, during that same time window, the average queue depth of the one of the plurality of low-performance locks exceeds a depth threshold. The one of the plurality of low-performance locks is converted from a low-performance lock into a high-performance lock.

Abstract: A modularized model interaction system and method of use, including an orchestrator, a set of hardware modules each including a standard set of hardware submodules with hardware-specific logic, and a set of model modules each including a standard set of model submodules with model-specific logic. In operation, the orchestrator determines a standard set of submodule calls to the standard submodules of a given hardware module and model module to implement model interaction on hardware associated with the hardware module.

Abstract: A parallel processing technique can be used to expedite reconciliation of a hierarchy of forecasts on a computer system. As one example, the computer system can receive forecasts that have a hierarchical relationship with respect to one another. The computer system can distribute the forecasts among a group of computing nodes by time point, so that all data points corresponding to the same time point in the forecasts are assigned to the same computing node. The computing nodes can receive the datasets corresponding to the time points, organize the data points in each of the datasets by forecast to generate ordered datasets, and assign the ordered datasets to processing threads. The processing threads (across the computing nodes) can then execute a reconciliation process in parallel to one another to generate reconciled values, which can be output by the computing nodes.

Abstract: Systems and methods for implementing robotic process automation (RPA) in the cloud are provided. An instruction for managing an RPA robot is received at an orchestrator in a cloud computing environment from a user in a local computing environment. In response to receiving the instruction, the instruction for managing the RPA robot is effectuated.

Abstract: The present invention relates to a method of contentions mitigation for an operational application implemented by an embedded platform comprising a plurality of cores and a plurality of shared resources. This method comprises the steps of executing the operational application by one of the cores of the embedded platform, executing a stressor application on at least some other cores of the embedded platform in parallel with the operational application, the stressor application being composed of a set of contention tasks generating a maximum contention on interference channels, and determining contentions generated by the stressor application on the operational application.

Abstract: A method of synchronizing tasks in a test and measurement system, includes receiving, at a client in the system, a task input, receiving, at a job manager running on a first device processor in the system, a call from the client to create a job associated with the task, returning to the client an action containing at least one job code block associated with the job, receiving a call for the action, executing the at least one job code block by at least one processor in the system, determining that the job has completed, and completing the task.

Abstract: A modular electronic warfare (EW) framework that is implemented into a first preexisting EW system with associated hardware and firmware to leverage the capabilities of the first preexisting EW system into a second, different preexisting EW system with associated hardware and firmware. The modular EW framework includes a tracking framework and a logic framework. The tracking framework is configured to receive a first set of objects from a preexisting EW system and augments the first set of objects with at least one parameter and outputs the second set of objects. The logic framework is configured to receive the set of second objects from the tracking framework and implements at least one process onto the second set of objects and outputs a third set of objects. A multi-core processor is used to operate the modular EW framework.

Abstract: Aspects of the disclosure relate to providing and maintaining efficient and effective processing of sets of work items in enterprise computing environments by optimizing distributed and parallelized batch data processing. A computing platform may initialize at least two processing workers. Subsequently, the computing platform may cause a first processing worker to perform a first query on a work queue database and initiate parallel processing of a first set of work items. Thereafter, the computing platform may cause the second processing worker to perform a second query on the work queue database and initiate parallel processing of a second set of work items. In some instances, performing the second query on the work queue database comprises reading at least one work item that was read and locked by the first processing worker.

Abstract: A processor may analyze, using an AI system, an application, where the application includes one or more application modules. The processor may determine, using the AI system, that an application module is critical based on a contextual scenario. The AI system may be trained utilizing data regarding heat generation of hardware on which the application module is operating. The processor may identify, using the AI system, required resources of the hardware for the application module to function during the contextual scenario. The processor may allocate an availability of the required resources for the application module.

Abstract: A method for executing applications in a system comprising general hardware and reconfigurable hardware includes accessing a first execution file comprising metadata storing a first priority indicator associated with a first application, and a second execution file comprising metadata storing a second priority indicator associated with a second application. In an example, use of the reconfigurable hardware is interleaved between the first application and the second application, and the interleaving is scheduled to take into account (i) workload of the reconfigurable hardware and (ii) the first priority indicator and the second priority indicator associated with the first application and the second application, respectively. In an example, when the reconfigurable hardware is used by one of the first and second applications, the general hardware is used by another of the first and second applications.

Abstract: Hardware semaphores are utilized to increase the speed with which preconditions are evaluated. On an individual basis, each hardware semaphore can implement a binary semaphore or a counting semaphore. Collections of hardware semaphores can be chained together to implement a chain semaphore that can support multiple conditionals. In addition, hardware semaphores can have the capability, not only of generating an interrupt, but, in addition, being able to generate commands, such as to other semaphores. The implementation of a chain semaphore spanning multiple hardware semaphores can be performed by a compiler at compile time or at run time. An integrated circuit chip can comprise multiple execution units, such as processing cores, and individual ones of the execution units can be associated with multiple hardware semaphores, such as in the form of hardware semaphore arrays. A dedicated network-on-chip enables hardware semaphore communication.

Abstract: Systems and methods for intelligently scheduling a pod in a cluster of worker nodes are described. A scheduling service may account for previous scheduling attempts by considering the time and node (scheduling data) on which a preceding attempt to schedule a node were made, and factoring this information into the scheduling decision. Upon making a determination of a node on which to attempt to schedule the pod, the scheduling data may be updated with the time and node ID of the determined node and the pod may be scheduled on the determined node. In response to determining that the pod has been evicted from the determined node, the above process may continue iteratively until the pod has been successfully scheduled.

Abstract: An information processing system includes: a storage device configured to store first clock time scheduled for execution of a task; and a processing device configured to: execute a task at second clock time earlier than first clock time scheduled for execution of the task; control the executing of the task not to execute the task at the first clock time when data used in the task is not updated in a period from the second clock time to the first clock time; and control the executing of the task to re-execute the task either at the first clock time or at third clock time earlier than the first clock time when the data is updated in the period from the second clock time to the first clock time.

Abstract: Methods, apparatus, computer program products for resource scheduling are provided. The method comprises: receiving a workload request; publishing the information of the workload to a workload billboard accessible to a plurality of computer hosts, each of the plurality of computer hosts being associated with a corresponding proxy configured to manage the resource scheduling of the computer host; receiving a request to schedule at least a portion of the workload from a proxy; and sending the portion of the workload to the computer host associated with the proxy.

Abstract: Provided is a hybrid near-memory processing system including a GPU, a PIM-HBM, a CPU, and a main memory. An embedding vector is loaded through the GPU and the PIM-HBM, an embedding table is divided and stored in the main memory and the HBM in a training process for inference of a recommendation system, an embedding lookup operation is performed in the main memory or the HBM according to a location of a necessary embedding vector in an inference process of the recommendation system, an additional embedding manipulation operation is performed in the CPU and the PIM with respect to the embedding vector of which the embedding lookup operation is completed, embedding vectors processed through embedding manipulation are finally concatenated in the PIM to generate an embedding result, and the embedding result is transmitted to the GPU to derive a final inference result through a top multiplayer perceptron (MLP) process.

Abstract: A computer-implemented method and system for resilient adaptive biased locking. The method includes adding, in a system including an adaptive lock reservation scheme having a learning state, a component comprising a per class counter that counts, collectively, a number of learning failures and a number of revocation failures. An embodiment includes initializing the per class counter upon loading a class with a predetermined value representing at least one of a maximum number of learning failures and cancellation instances associated with the class. An embodiment includes initializing, based on a determination of an operational state of the per class counter for an object transitioning from one of the learning state and a biased state to a flatlock state, a lock word of the object directly to the flatlock state while bypassing the biased state.

Abstract: Described are techniques for scheduling tasks on a heterogeneous system on a chip (SoC). The techniques including receiving a directed acyclic graph at a meta pre-processor associated with a heterogeneous system-on-chip and communicatively coupled to a scheduler, where the directed acyclic graph corresponds to a control flow graph of respective tasks associated with an application executed by the heterogeneous system-on-chip. The techniques further including determining, using a learning agent implementing machine learning algorithms, a rank for a respective task in the directed acyclic graph, wherein the learning agent receives as input the directed acyclic graph, constraints associated with the directed acyclic graph, and heuristics regarding previously completed tasks. The techniques further including providing the respective task to the scheduler for execution on the heterogeneous system-on-chip according to the rank.

Abstract: A processor includes a task scheduling unit and a compute unit coupled to the task scheduling unit. The task scheduling unit performs a task dependency assessment of a task dependency graph and task data requirements that correspond to each task of the plurality of tasks. Based on the task dependency assessment, the task scheduling unit schedules a first task of the plurality of tasks and a second proxy object of a plurality of proxy objects specified by the task data requirements such that a memory transfer of the second proxy object of the plurality of proxy objects occurs while the first task is being executed.

Abstract: The disclosed system and methods are directed to a data-driven choreography of microservices sagas that enable the composition of microservices without depriving each individual microservice of its independence.