An information processing system for a multitenant service is proposed. The system includes memory queues and a processor. Processing requests issued from tenants are received through a network, where the number of the memory queues is smaller than the number of the tenants, and a priority is given to each of the memory queues. A priority of the processing request issued from each of the tenants is specified, based on a rank set with respect to each of the tenants and the amount of a used calculation resource for a predetermined period of time for each of the tenants, and the processing requests are retained in the memory queues according to the priorities. The retained processing requests are extracted from the memory queues in an order specified based on the priorities to execute processing corresponding to the processing requests.

Systems and methods are provided for a context-aware scheduler. In one example embodiment, the context-aware scheduler accesses a stored application context to determine that the stored application context corresponds to a change in application context from a first application context according to which a queue of jobs for execution for an application is currently prioritized, to a second application context. The context-aware scheduler determines a list of attributions comprising assigned priority categories for the second application context and uses the list of attributions for the second application context to re-prioritize the plurality of jobs in the queue based on a job attribution tag for each job in the queue. The context-aware scheduler sets a first job in the re-prioritized queue as the next job for execution for the application.

Aspects of the disclosure relate to message processing. A computing platform may intercept an application message, which may be directed to a message bus. The computing platform may input the application message into a model, which may output a message priority score for the application message. The computing platform may compare, using the model, the message priority score to a message priority threshold. Based on identifying that the message priority score does not exceed the message priority threshold, the computing platform may route the application message to a message storage system rather than the message bus. The computing platform may monitor the message bus to detect available processing capacity. Based on identifying that the available processing capacity meets or exceeds a message processing threshold, route the application message to the message bus.

Methods for adjusting a resource response in a resource system are provided including capturing and storing current performance data associated with the resource system; performing a regression analysis on the captured and stores current performance data to provide a best linear regression fit; developing a compensation equation based on the best linear regression fit; programming the compensation equation into a compensation module at resource controller at the resource system; and adjusting, at the resource controller, incoming signals from a control center to compensate for system non-idealities to provide an adjusted system. Related systems are also provided.

A method for managing resources by using a processor that includes a first queue and a second queue includes receiving, by the processor, input/output commands from a virtual device, generating, by the processor, interrupts that each includes a process address space identifier (PASID) that corresponds to each of the input/output commands, storing, by the processor, the interrupts in the first queue, storing, by the processor, in a memory device, data that respectively corresponds to each of the interrupts, and storing, by the processor, in the second queue, location information indicating a storage location of the data stored in the memory device and size information indicating a size of the data.

Embodiments of the present invention provide a computer system, a computer program product, and a method that comprises receiving data associated with an initiation of a process; dynamically determining a sequence of a plurality of sub-processes associated with the received data based the initiated process; dynamically prioritizing the determined sequence of the plurality of sub-processes associated with the received data based on an analysis of eligible variations and a pre-stored database of variations associated with each respective sub-process; dynamically performing the process based the prioritized sequence of the plurality of sub-processes associated with the received data; and transmitting a result of the dynamic prioritization of the determined sequence of a plurality of variations to a user interface of another computing device.

A method is implemented by an event collector to utilize feedback from an event handler to prioritize event forwarding to the event handler. The method includes receiving feedback from the event handler in response to a successful match-action in a rules engine, the feedback including a derived condition which is a generalized version of a condition stored in the match part of a rule, determining whether the derived condition is stored in an event prioritizer, and storing the derived condition in the event prioritizer with initial expiration timer and hit counter, in response to the derived condition not being present in the event prioritizer, and updating a hit counter and expiration timer of the derived condition in the event prioritizer, in response to the derived condition being present in the event prioritizer.

The present disclosure relates to methods and apparatuses for execution of a neural network. An exemplary method can be implemented by a processing unit. The processing unit can include a command parser configured to dispatch commands and computing tasks and at least one core communicatively coupled with the command parser and configured to process the dispatched computing task. Each core can include a convolution unit, a pooling unit, at least one operation unit and a sequencer communicatively coupled with the convolution unit, the pooling unit, and the at least one operation unit and configured to distribute instructions of the dispatched computing task to the convolution unit, the pooling unit, and the at least one operation unit for execution. The method can include: reading, by the convolution unit, data from a local memory of the at least one operation unit; performing, by the convolution unit, a convolution operation on the data to generate a feature map; and performing, by the pooling unit, a pooling operation on the feature map.

The machine implemented method for operating at least one electronic system comprises detecting a pattern of use of plural control parameters in a path through a graph of operational context switches to reach a target operational context; storing a representation of the pattern in association with an indicator identifying the target operational context; responsive to detecting at least one of a request for a switch of operation from a source operational context to the target operational context, a trapping on a resource access, and a detection of a breakpoint, retrieving the representation in accordance with the indicator identifying the target operational context; and responsive to the retrieving, applying at least one control parameter to said at least one electronic system to match the pattern.

A method for preventing a task-signal deadlock arising due to contention for a mutex in a real-time operating system (RTOS) includes detecting, by a processing unit, a signal notification sent to a task for execution of a signal handler; identifying, by the processing unit, a mutex to be acquired by the signal handler, when the signal notification is detected; determining whether the identified mutex has been acquired by the task; and utilizing, by the processing unit, an alternative stack for execution of the signal handler, in response to determining that the mutex has been acquired by the task, for preventing a task-signal deadlock during the execution.