Abstract: Techniques are disclosed for reallocating host resources in a virtualized computing environment when certain criteria have been met. In some embodiments, a system identifies a host disabling event. In view of the disabling event, the system identifies a resource for reallocation from a first host to a second host. Based on the identification, the computer system disassociates the identified resource's virtual identifier from the first host device and associates the virtual identifier with the second host device. Thus, the techniques disclosed significantly reduce a system's planned and unplanned downtime.

Abstract: Systems and methods for managing resources in a multi-tenancy grid computing environment are provided. The methods include an auxiliary service scheduler managing the lifecycle of auxiliary services by policies to optimize the resource allocation; coordinating with an application scheduler to dispatch tasks and an auxiliary service to the same set of servers; and using a multiple layer auxiliary service map to manage and record auxiliary service status. The methods optimize dynamical resource sharing between applications with a dependency on an auxiliary service running aside on the same server.

Abstract: Representative apparatus, method, and system embodiments are disclosed for a self-scheduling processor which also provides additional functionality. Representative embodiments include a self-scheduling processor, comprising: a processor core adapted to execute a received instruction; and a core control circuit adapted to automatically schedule an instruction for execution by the processor core in response to a received work descriptor data packet. In another embodiment, the core control circuit is also adapted to schedule a fiber create instruction for execution by the processor core, to reserve a predetermined amount of memory space in a thread control memory to store return arguments, and to generate one or more work descriptor data packets to another processor or hybrid threading fabric circuit for execution of a corresponding plurality of execution threads. Event processing, data path management, system calls, memory requests, and other new instructions are also disclosed.

Abstract: Disclosed is a system and method for management of a task across a plurality of processors, wherein the task processing of a plurality of records. The system includes a plurality of processors and an administrator module. Each of the plurality of processors processes a set of records added in a given time interval and the administrator module determines the time interval for a given processor. The administrator module is operable to receive a timestamp detailing a time when the given record was added to the database arrangement; determine a time period in which the plurality of records were added to the database arrangement; determine a time and record threshold for a given processor; and adjust the time interval allocated to each of the plurality of processors according to the time threshold and the record threshold, based on a time-based distribution of records in the database arrangement.

Abstract: Systems and methods are described for reducing cold starts code within a serverless code execution system by providing a set of environments reserved for the code. A frontend distribute calls for execution among a set of manager devices that manage environments in the system, distributed in a manner that groups calls together and attempts to distribute calls of the same group to a stable subset of the manager devices. In the case that a user reduces or eliminates the number of environments reserved for the code, a frontend continues to distribute calls for execution of the code to those environments while they continue to be used. This reduces cold starts that might otherwise occur during reduction or elimination of reserved environments.

Abstract: Dynamic deferral systems and methods providing a means to defer performance of a task for a distributed computing system entity both by the number of work cycles as well as in response to an occurrence of a triggering event. By deferring the scheduling in terms of the number of work-cycles, the memory footprint is reduced as the scheduling matrix uses only one byte to store the number. This approach also takes advantage of the most significant bit of a byte to indicate whether the scheduled job is to be evoked in response to a triggering event.

Abstract: A technique relates to moving a target logical partition. A software application receives a trigger to automatically move the target logical partition from a first system to a second system. The logical partition memory of the target logical partition is transferred from the first system to a coupling facility. In response to completion of transferring the logical partition memory of the target logical partition to the coupling facility, the logical partition memory of the target logical partition is transferred from the coupling facility to the second system.

Abstract: Dynamic generation and implementation of assignment mappings of data items in large data files to distributed processors to achieve objectives such as reduced overall processing time like. Any appropriate key (e.g., character string) can be identified or obtained for each data item in a data file and the file can be segmented into sequential data blocks, where each data block includes a set of data items. The data items in each of a first plurality of the blocks (e.g., sampled block set) may be initially sorted into one of a plurality of key ranges of a search space (each corresponding to a different respective processor) and analyses conducted on the data items totals in each key range. The key range boundaries can be adjusted by accounting for uncertainty in the sample estimates to more evenly distribute data items from all blocks sent to each processor and thereby achieve the objective.

Abstract: The present disclosure allows for more controlled modification of the input data to a Rapid Manufacturing Technologies (RMT) machinery to compensate for systematic error of the manufacturing process, such as directional build discrepancies, by performing the opposite effect to the input data. The modification is achieved with minimal unwanted distortions introduced to other portions of the structure to be built by decoupling the global scaling effects on the whole structure from the desired local effects on certain portions.

Abstract: A system for hierarchical cooperative computing is provided, comprising a vector definition service configured to receive a user-submitted request, and compile the request into a vector; a rules engine configured to retrieve the vector from the vector definition service, and evaluate the vector for appropriateness; a parametric evaluator configured to parameterize the vector, and generate at least a run from the parameterized vector; and an optimizer configured to retrieve the run from the parametric evaluator, and determine an optimal plan for executing the user-submitted request.

Abstract: This technology relates to transferring state information between processes or active software programs in a computing environment where the a new instance of a process or software program may receive such state information even after an original or old instance of the process or software program that owned the state information has terminated either naturally or unnaturally.

Abstract: System and methods for automatically scaling compute resources in a compute group. The method includes determining compute capacity required to complete job requests and determining allocable compute capacity available on the compute resources in the compute group. The method further includes calculating a utilization of the compute group based on the required compute capacity and allocable compute capacity and determining whether the calculated utilization is above a first threshold value or below a second threshold value; upon determining that the calculated utilization is above the first threshold value the method calculates a number of compute resources required to bring the utilization below the first threshold value and causes an increase in the number of compute resources in the compute group based on the calculated number. Upon determining that the calculated utilization falls below the second threshold value the method causes a reduction in the number of active compute resources.

Abstract: The present disclosure provides for predictively allocating computing resources based on movement of a simulation agent through a simulation environment, such as in a video game. In order to support the movement of the simulation agent, computing resources may be allocated in various ways. For example, one option may be to transfer data assets associated with the simulation agent from the first computing resource to the second computing resource. Another option may be leave the data assets at the first computing resource and transfer authority over at least a portion of the second region from the second computing resource to the first computing resource. In various embodiments, the way in which the computing resources are allocated may be determined based on various factors, such as resource costs, so that the movement of the simulation agent can be supported with optimal system efficiency.

Abstract: The invention relates to a control device suitable for suggesting control instructions to the patient in order to facilitate the use thereof.

Abstract: A system for resolving a resource deadlock between processes. A shared data structure is maintained that includes process records of the processes. Process states and process priorities are defined for each of the processes. A respective state of the process is determined for each process based on the process states and process priorities of the process records maintained in the shared data structure. The respective state is used to allocate and deallocate resources to the process to mitigate and resolve the resource deadlock between the processes.

Abstract: Provided is a method, system, and computer program product for managing tasks in a computing system using a virtual node. A processor may register a virtual node for handling tasks allocated by a scheduling node in a computing system, the computing system comprising the scheduling node and a group of actual computing nodes processing tasks allocated by the scheduling node, and the scheduling node takes the virtual node as an actual computing node. A performance level of the computing system is obtained. Capacity of the virtual node is set based on the obtained performance level, such that the scheduling node allocates tasks to the virtual node based on the capacity of the virtual node. In response to at least one task being allocated by the scheduling node to the virtual node, the at least one task is received by the virtual node.

Abstract: Example embodiments relate to executing services in containers. The examples disclosed herein include a computing device comprising instructions to load an inner portion of an operating system kernel in an inner region of a kernel space and an outer portion of the operating system kernel in an outer region of the kernel space. The example computing device may execute a service in a container in a user space. The container may be communicatively coupled with the outer region of the operating system kernel but divided from the inner portion of the operating system kernel.

Abstract: Disclosed herein is technology to store test data and associate the test data with a change set in a version control system. An example method may include: accessing a code object in a version data store, wherein the version data store comprises a change set applied to the code object; initiating a test of the code object; accessing test data for the code object, wherein the test data comprises output of the test; storing the test data in the version data store; and associating the change set with the test data in the version data store.

Abstract: Methods, systems and computer program products for an intelligent processor for user-provided routines (IPUR) in a transaction processing system are provided. An interface module, interposed between a transaction processing module and a user-provided routine intercepts a request for an operation. If the user-provided routine is supported for the request, the interface module asynchronously passes the request to the user-provided routine and synchronously passes the request to the IPUR. Thus, the IPUR learns the processing of the user-provided routine, which eventually can be removed from the transaction processing system.

Abstract: A robotic process automation (RPA) system receives task prioritization inputs that specify prioritization for processing of a set of RPA tasks. The tasks are performed in accordance with the specified priorities. The RPA system also receives queue orchestration commands that specify conditions under which tasks processed from a first queue are sent to another queue for subsequent processing. The RPA system also provides service level automation in accordance with specified parameters. Further task prioritization may be specified to provide quality of service performance.