Abstract: A new workload is assigned to a subset of a plurality of processors, the subset of processors assigned a subset of a plurality of cache devices. A determination is made that the new workload is categorized as a cache-dependent workload which would be executed more efficiently were additional data elements associated with the new workload to be held in the subset of cache devices, and pursuant to determining the new workload is the cache-dependent workload, a determination is made as to whether the subset of cache devices is meeting the memory need of the new workload. Responsive to determining the subset of cache devices is not meeting the memory need of the new workload, a cache related action is performed.

Abstract: Embodiments for preemptive deep diagnostics of resources in a disaggregated computing environment. A set of new resources of a first type is provided to an available resource pool within the disaggregated computing environment. An estimate for an expected time to failure (ETTF) for each one of the set of new resources is computed, and respective ones of the new resources from the available resource pool are provisioned to respective workloads based on the ETTF.

Abstract: Embodiments are provided herein for facilitating high link bandwidth utilization in a disaggregated computing system. A plurality of general purpose links are used to connect respective pluralities of computing elements. A traffic pattern between respective ones of a first plurality of computing elements of a first type and respective ones of a second plurality of computing elements of a second type is detected. The first and second pluralities of computing elements are dynamically connected through the respective ones of the plurality of general purpose links according to the detected traffic pattern.

Abstract: Embodiments for efficient resource placement in a disaggregated computing environment. Responsive to receiving an alert of a threshold breach of one or more events associated with a suspicious resource of a first resource type while executing a workload, a known good resource is selected from an available resource pool of the first resource type, where the selecting is performed to optimize a usage of the first resource type. The known good resource from the available resource pool of the first resource type is assigned to the workload such that execution of the workload is transferred from being performed by the suspicious resource to the known good resource.

Abstract: Code generation relating to providing table of contents (TOC) pointer values. Code to be compiled is obtained by a processor. Based on obtaining the code, a determination is made as to whether the code is to access a reference data structure. Based on determining the code is to access the reference data structure, other code is included in the code to provide a pointer to the reference data structure. The other code includes an architectural definition to provide the pointer to the reference data structure.

Abstract: For measuring component utilization in a system having a plurality of subsystems, an energy consumption of each of the plurality of subsystems is monitored whether or not each subsystem performs at least a portion of an overall computation. Respective workloads are classified based upon an energy consumption pattern associated with the monitored energy consumption of each of the plurality of subsystems.

Abstract: Embodiments are provided herein for dynamic memory-based communication in a disaggregated computing system. A pool of similar computing elements is configured as a large address space, the large address space segmented by an identifier. Data travel distances are optimized depending on a historical or expected use of a data object by using a grouping and amortization algorithm to relocate the data object within the pool of similar computing elements at a particular address within the large address space according to the historical or expected use.

Abstract: Embodiments of the present invention are directed to a computer-implemented method for generating a configurable conversational agent. A non-limiting example of the computer-implemented method includes providing available conversational agents to a user's computing device. The user uses a graphical user interface to choose desired characteristics of a conversational agent. The conversational agent generating service receives the chosen characteristics to generate a customized conversational agent and integrate the conversational agent into the user's system.

Abstract: A meeting management method, system, and non-transitory computer readable medium, include a target determination circuit configured to determine a target of an agenda for a meeting, the target of the agenda including which users correspond to a topic, a behavior capturing circuit configured to capture behavior of the users during the meeting, a tracking and identifying circuit configured to track the behavior of the users during the meeting and identify a user of the users corresponding to the behavior, and a difference determination circuit configured to determine if a difference between the behavior of the users and the target of the agenda is greater than a threshold value.

Abstract: Generating secondary virtual machine seed image storage is provided. An input is received to deploy a primary virtual machine and a secondary virtual machine based on a golden virtual machine image. In response, the primary virtual machine from the golden virtual machine image on a primary data processing site and the secondary virtual machine from the golden virtual machine image on a secondary data processing site are deployed. Execution of the secondary virtual machine is suspended on the secondary data processing site. Using the golden virtual machine image, a seed image corresponding to the secondary virtual machine is generated that is up-to-date at that point in time in storage at the secondary data processing site to form the secondary virtual machine seed image storage. The secondary virtual machine seed image storage is enabled to receive state data updates from the primary virtual machine on the primary data processing site.

Abstract: Setting or updating of floating point controls is managed. Floating point controls include controls used for floating point operations, such as rounding mode and/or other controls. Further, floating point controls include status associated with floating point operations, such as floating point exceptions and/or others. The management of the floating point controls includes efficiently updating the controls, while reducing costs associated therewith.

Abstract: Configuration state registers grouped based on functional affinity. An identification of an in-memory configuration state register for which memory is assigned is obtained. Based on the identification, an offset into the memory at which the in-memory configuration state register is stored is determined. The offset is allocated to the in-memory configuration state register based on functional affinity of the in-memory configuration state register. The in-memory configuration state register is accessed using at least the offset.

Abstract: One or more configuration state registers are provided in-memory rather than in-processor. A request to access a configuration state register is obtained. A determination is made that the configuration state register is in-memory rather than in-processor. Based on determining that the configuration state register is in-memory, the access is converted from an in-processor access operation to an in-memory access operation.

Abstract: Embodiments for preemptive deep diagnostics of resources in a disaggregated computing environment. Responsive to detecting a threshold breach of a recurrent event associated with a first resource of a first resource type executing a workload, an alert is generated; and responsive to receiving the alert, the execution of the workload on the first resource is ceased. Health check diagnostics are identified and invoked on the first resource based on the alert and a server telemetry. Results of the health check diagnostics are mapped to a set of learned failure patterns; and a potential failure of the first resource is predicted based on the mapping.

Abstract: Autonomous recovery from a transient hardware failure by executing portions of a stream of program instructions as a transaction. A start of a transaction is created in a stream of executing program instructions. A snapshot of a system state information is saved when the transaction begins. When a predefined number of program instructions in the stream are executed, the transaction ends, and store data of the transaction is committed. A new transaction then begins. If a transient hardware failure occurs, the transaction is aborted without notifying the computer software application that initiated the stream of program instructions. The transaction is re-executed, based on the saved snapshot of the system state information.

Abstract: Embodiments for preemptive deep diagnostics of resources in a disaggregated computing environment. Respective resources from respective pools of resources of different types are assigned to compose a disaggregated server. A workload is executed by the respective resources within the disaggregated server while the respective resources of the disaggregated server are monitored by a monitoring task. Responsive to a first resource of the respective resources generating an alert from the monitoring task, the workload is instantiated to be concurrently performed by the first resource and a second resource of the respective resources while initiating a health check diagnostic operation on the first resource.

Abstract: A predicted value to be used in register-indirect branching is predicted. The predicted value is to be stored in one or more locations based on the prediction. An offset for a predicted derived value is obtained. The predicted derived value is to be used as a pointer to a reference data structure providing access to variables used in processing. The predicted derived value is generated using the predicted value and the offset. The predicted derived value is used to access the reference data structure during processing.

Abstract: Autonomous recovery from a transient hardware failure by executing portions of a stream of program instructions as a transaction. A start of a transaction is created in a stream of program instructions executing on a first processor of a multi-processor computer. A snapshot of a system state information is saved when the transaction begins. When the transaction ends, store data of the transaction is committed. If a transient hardware failure occurs, the transaction is aborted without notifying the computer software application that initiated the stream of program instructions. The transaction is re-executed on a second processor of the multi-processors, based on the saved snapshot of the system state information.

Abstract: A transactional memory system determines whether a hardware transaction can be salvaged. A processor of the transactional memory system begins execution of a transaction in a transactional memory environment. Based on detection that an amount of available resource for transactional execution is below a predetermined threshold level, the processor determines whether the transaction can be salvaged. Based on determining that the transaction can not be salvaged, the processor aborts the transaction. Based on determining the transaction can be salvaged, the processor performs a salvage operation, wherein the salvage operation comprises one or more of: determining that the transaction can be brought to a stable state without exceeding the amount of available resource for transactional execution, and bringing the transaction to a stable state; and determining that a resource can be made available, and making the resource available.

Abstract: Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computer program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.