Abstract: Computational methods and systems to reclaim capacity of a virtual infrastructure of distributed computing system are described. Methods and systems are directed to forecasting usage of resources that form a virtual infrastructure of a distributed computing system. Streams of metric data that represent usage of resources of the virtual infrastructure assigned to a virtual object are collected. A binary sequence of active status metric data is computed for the virtual object based on the streams of metric data. Forecasted active status metric data are computed in a forecast interval based on the sequence of active status metric data. Expected active or inactive status of virtual object over the forecast interval is determined from the forecasted active status metric data. If the virtual object is expected to inactive status over the forecast interval, resources assigned to the virtual object are reclaimed for use by active virtual objects.

Abstract: A set of computing nodes may receive a corresponding set of heartbeat messages that originated at the set of computing nodes. The set of heartbeat messages may relate to selecting, among the set of computing nodes, a leader computing node to process a set of jobs. State information included in the heartbeat messages may be provided to a leader election algorithm that outputs information indicating one or more computing nodes that are most qualified to process the set of jobs based on processing capabilities of the computing nodes and processing constraints associated with the set of jobs. The computing node may select itself as the leader computing node to process the set of jobs based on determining, from the information output by the leader election algorithm, that the computing node is most qualified to process the set of jobs and no other computing nodes are processing the set of jobs.

Abstract: A first feature (e.g., chart or table) includes a reference to a dynamic pointer. Independently, the pointer is defined to point to a second feature (e.g., a query). The first feature is automatically updated to reflect a current value of the second feature. The reference to the pointer and pointer definition are recorded in a central registry, and changes to the pointer or second feature automatically cause the first feature to be updated to reflect the change. A mapping between features can be generated using the registry and can identify interrelationships to a developer. Further, changes in the registry can be tracked, such that a developer can view changes pertaining to a particular time period and/or feature of interest (e.g., corresponding to an operation problem).

Abstract: A computer-controlled method of handling proprietary features in a messaging system includes receiving an object from a requesting application, determining that the object invokes proprietary features of a messaging system, accessing a wrapper library and wrapping the object in an appropriate wrapper for the messaging system to produce a wrapped object, the wrapper to preserve the proprietary feature, and transmitting the wrapped object to the messaging system.

Abstract: The invention realizes miniaturization, high performance, and informatization of a control device. Only an application not required to be repeatedly executed with respect to a control subject at an execution interval less than or equal to a prescribed time interval is assigned to a fourth core (114) of a PLC (10).

Abstract: A real-time feasibility device includes circuitry configured to sort tasks into a first scheduling priority order; split the sorted tasks into a first subset which can be scheduled using an inexact condition test and a second subset which cannot be scheduled using the inexact condition test; test the first subset using the inexact condition test; sort the tested first subset into a second scheduling priority order; sort the second subset into a third scheduling priority order; filter out one or more tasks of the second subset which cannot be scheduled using the inexact condition test or the exact condition test; test remaining tasks of the second subset using the exact condition test; sort the tested remaining tasks of the second subset into a fourth scheduling priority order; and execute the sorted and tested first subset and the sorted and tested remaining tasks of the second subset.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for registering subscribable sub-states in blockchain are provided. One of the methods includes: obtaining a request for registering one or more sub-states of a state, wherein a registered workflow comprises the state; generating a blockchain contract comprising the one or more sub-states; and deploying the blockchain contract in a blockchain. The deployed blockchain contract is executable to update a current sub-state of the state corresponding to the workflow among the one or more sub-states.

Abstract: Embodiments include method, systems and computer program products for operating a computer system using a workload manager to control a dynamic thread mode switch. The method includes receiving a plurality of workloads. A workload manager determines which of the plurality of workloads are eligible to use a processor core operating in a multi-threaded mode and which workloads are response sensitive and use a processor core operating in a single-thread mode. A hypervisor determines a state of operation for one or more cores of one or more processors and causes a core switch for at least one or more cores in response to a determination that workloads eligible to use a processor core operating in a multi-threaded mode exist or workloads that are response sensitive and a determination that the state of operation for one or more cores of one or more processors should change to facilitate handling the associated workloads.

Abstract: A compute device to manage workflow to disaggregated computing resources is provided. The compute device comprises a compute engine receive a workload processing request, the workload processing request defined by at least one request parameter, determine at least one accelerator device capable of processing a workload in accordance with the at least one request parameter, transmit a workload to the at least one accelerator device, receive a work product produced by the at least one accelerator device from the workload, and provide the work product to an application.

Abstract: Embodiments of the present disclosure relate to a method, apparatus and computer program product for scheduling dedicated processing resources. The method comprises: in response to receiving a scheduling request for a plurality of dedicated processing resources, obtaining a topology of the plurality of dedicated processing resources, the topology being determined based on connection attributes related to connections among the plurality of dedicated processing resources; and determining, based on the topology, a target dedicated processing resource satisfying the scheduling request from the plurality of dedicated processing resources. In this manner, the performance and the resource utilization rate of scheduling the dedicated processing resources are improved.

Abstract: The disclosed embodiments relate to a system that facilitates developing applications in a component-based software development environment. This system provides an execution environment comprising instances of application components and a registry that maps names to instances of application components. Upon receiving a call to register a mapping between a name and an instance of an application component, the system updates the registry to include an entry for the mapping. Moreover, upon receiving a call to be notified about registry changes for a name, the system updates the registry to send a notification to a caller when a registry change occurs for the name.

Abstract: Systems and methods for I/O acceleration in a virtualized system include receiving, at a hypervisor from an application executing under a guest OS, a request to write new data to a RAID system, redirecting the request to the VSA owning the RAID drives, moving the new data from guest OS physical address space to VSA physical address space, preparing, by a RAID driver in the VSA, the new data for writing according to a RAID redundancy policy, reading, by the RAID driver into a first buffer, old data and old parity information, performing, by an architectural data mover, inline XOR copy operations to compute a difference between the old and new data, compute new parity information, and write the difference and new parity information into the second buffer, and writing, by the RAID driver, the difference and new parity information to the RAID system using the redundancy policy.

Abstract: A computer-implemented method, system, and computer program product are provided to reduce stealing in a processor. The method includes allocating a private space for a first thread in a memory. The method also includes generating a plurality of child tasks by the first thread responsive to processing a first task. The method additionally includes storing a portion of the plurality of child tasks in the private space removing the ability of other threads from popping the portion of the plurality of child tasks, with a remainder of the plurality of child tasks being stored in a public space. The method further includes popping the portion of the plurality of child tasks from the private space by the first thread.

Abstract: Systems, apparatuses, and methods for sharing an field programmable gate array compute engine are disclosed. A system includes one or more processors and one or more FPGAs. The system receives a request, generated by a first user process, to allocate a portion of processing resources on a first FPGA. The system maps the portion of processing resources of the first FPGA into an address space of the first user process. The system prevents other user processes from accessing the portion of processing resources of the first FPGA. Later, the system detects a release of the portion of the processing resources on the first FPGA by the first user process. Then, the system receives a second request to allocate the first FPGA from a second user process. In response to the second request, the system maps the first FPGA into an address space of the second user process.

Abstract: In accordance with embodiments of the present disclosure, an information handling system may include a processor, a power supply unit for supplying electrical energy to information handling resources of the information handling system, a battery backup unit for supplying electrical energy to the information handling resources responsive to a power event associated with the power supply unit, and a non-transitory computer-readable readable medium having embodied thereon a program of instructions configured to, when executed, in response to the power event, gracefully terminate one or more applications executing on the processor in accordance with a desired priority ranking.

Abstract: According to one or more embodiments of the present invention, a computer implemented method includes executing, by a virtual machine that is executing on a host server, a stream of instructions, wherein an instruction from the stream of instructions is to be intercepted to a hypervisor. The method further includes, based on a determination that the virtual machine is a secure virtual machine, preventing the hypervisor from directly accessing any data of the secure virtual machine. The method further includes performing by a secure interface control of the host server, based on a determination that the instruction is not interpretable by the secure interface control itself, extracting one or more parameter data associated with the instruction from the secure virtual machine, and storing the parameter data into a buffer that is accessible by the hypervisor. The instruction is subsequently intercepted into the hypervisor.

Abstract: A method for resource allocation and related products are provided. The method includes the following. A selection operation performed on a target widget of an operation interface of a target application of a terminal device is received by an operating system of the terminal device. A resource adjustment strategy corresponding to the selection operation performed on the target widget is obtained by the operating system, and allocation of at least one system resource for the target application is adjusted by the operating system within a time interval associated with the selection operation performed on the target widget according to the resource adjustment strategy.

Abstract: Embodiments of a system and method for dynamic hardware acceleration are generally described herein. A method may include identifying a candidate task from a plurality of tasks executing in an operating environment, the operating environment within a hardware enclosure, the candidate task amenable to hardware optimization, instantiating, in response to identifying the candidate task, a hardware component in the operating environment to perform hardware optimization for the task, the hardware component being previously inaccessible to the operating environment, and executing, by the operating environment, a class of tasks amenable to the hardware optimization on the hardware component.

Abstract: In one embodiment, tasks executing on a data processing system can be associated with a Quality of Service (QoS) classification that is used to determine the priority values for multiple subsystems of the data processing system. The QoS classifications are propagated when tasks interact and the QoS classes are interpreted a multiple levels of the system to determine the priority values to set for the tasks. In one embodiment, one or more sensors coupled with the data processing system monitor a set of system conditions that are used in part to determine the priority values to set for a QoS class.

Abstract: Techniques for allocating resources including receiving a first sub-stream of a data stream associated with a job and determining a dependency of a plurality of stages of the job. The techniques further include determining a metric for a second sub-stream of the data stream, where processing of the second sub-stream is completed and the metric indicates information associated with the processing of the second sub-stream. The techniques further include allocating resources for processing the first sub-stream based at least in part on the metric and the dependency.