Abstract: Embodiments for optimizing dynamic resource allocations in a disaggregated computing environment. 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-friendly workload having a memory need which can be met primarily by the subset of cache devices by identifying that underlying data necessitated by the new workload resides primarily within the subset of cache devices. Pursuant to determining the new workload is the cache-friendly workload, a cache related action is performed to increase performance of the new workload executed by the subset of processors and commensurately executes additional workloads performed by other ones of the plurality of processors within the disaggregated computing environment.

Abstract: Processing of an instruction fetch from an instruction cache is provided, which includes: determining whether the next instruction fetch is from a same address page as a last instruction fetch from the instruction cache; and based, at least in part, on determining that the next instruction fetch is from the same address page, suppressing for the next instruction fetch an instruction address translation table access, and comparing for an address match results of an instruction directory access for the next instruction fetch with buffered results of a most-recent, instruction address translation table access for a prior instruction fetch from the instruction cache.

Abstract: A new approach to resiliency management is provided in a data center wherein servers are constructed dynamically, on-demand and based on workload requirements and a tenant's resiliency requirements by allocating resources from these pools. In this approach, a set of functionally-equivalent “interchangeable compute units” (ICUs) are composed of resources from resource pools that have been extended to include not only different resource types (CPU, memory, accelerators), but also resources of different specifications (specs) and flavors. As a workload is being processed, the health or status of the resources are monitored. Upon a performance issue or failure event, a resiliency manager can swap out a current ICU and replace it with a functionally-equivalent ICU. Preferably, individual ICUs are hosted on one of: resources of a same type each with different specifications, and resources of a same type and specification and different flavors.

Abstract: Embodiments for preemptive substitution of resources in a disaggregated computing environment. Failure patterns and mitigation actions are analyzed for specific failures of respective resources within the disaggregated computing environment. Responsive to determining a failure threshold has been reached for a first resource of a first type of the respective resources, a mitigation action is performed according to the analyzed failure patterns. A result of the mitigation action is determined and the result is used to improve the failure pattern analyzation.

Abstract: Embodiments are provided herein for efficient component communication and resource optimization in a disaggregated computing system. A general purpose link is provided between a plurality of devices in the disaggregated computing system. The general purpose link is used to connect the plurality of devices which respectively comprise different types of devices. A first data object is stored within one of the plurality of devices according to a past use or an expected use of the data object by at least a respective one of a set of processors within the disaggregated computing system, and the general purpose link is dynamically rewired according to a location of the first data object and a location of the at least one of the respective set of processors.

Abstract: A method, system, and computer program product are provided for prioritizing transactions. A processor in a computing environment initiates the execution of a transaction. The processor includes a transactional core, and the execution of the transaction is performed by the transactional core. The processor obtains concurrent with the execution of the transaction by the transactional core, an indication of a conflict between the transaction and at least one other transaction being executed by an additional core in the computing environment. The processor determines if the transactional core includes an indicator and based on determining that the transactional core includes an indicator, the processor ignores the conflict and utilizing the transactional core to complete executing the transaction.

Abstract: A processor may record a first location at an event with at least one person. The processor may monitor a plurality of actions of that at least one person at the first location. The processor may interpret at least one action of the at least one person that indicates a change of interest to a second location at the event. Based on the at least one action, the processor may determine the second location at the event. The processor may record the second location at the event.

Abstract: Data is obtained specifying a measure of a data set to be analyzed by human experts and allotted time for analysis completion. Based on same, a schedule is created for a primary meeting of human experts, whose aim is to analyze the data. The meeting is evaluated to create rate estimates for hypothetical meeting partitions; and, if the primary meeting is not adhering to schedule and/or can be speeded up, the meeting partitions are simulated until a partitioning scheme is determined that can restore the meeting to schedule and/or speed it up. In another aspect, a model of focus of attention of each member of a group of individuals engaged in an activity requiring cooperation is dynamically updated, and a cooperation index is determined based on the model of focus of attention, an interaction graph, and at least one physiological parameter of at least one of the members.

Abstract: A method of organizing computer resources includes receiving a specification defining a plurality of quiescence groups of independent component instances for each of at least two services, and performing a first load balancing of the quiescence groups across a plurality of physical servers to define a plurality of supergroups while assigning each of the physical servers across the supergroups.

Abstract: For power management in a disaggregated computing system, upon detecting an electrical power reduction to the disaggregated computing system, respective workloads being performed by respective processors within a set of processors are prioritized according to a service level agreement (SLA) of the respective workloads. Backup electrical power is dynamically allocated to the respective processors performing the respective workloads based upon a priority of the SLA of the respective workloads.

Abstract: Embodiments are provided herein for efficient component communication and resource optimization in a disaggregated computing system. A general purpose link is provided to connect a computing element to a plurality of other computing elements of the disaggregated computing system. The general purpose link is dynamically switched between a plurality of different hardware protocols to communicate with the other computing elements, where respective ones of the other computing elements comprise different types of hardware elements.

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: Various embodiments for performing hardware upgrades in a disaggregated computing environment. A workload is run on a disaggregated computing system while providing a new component to at least one of a plurality of component pools used by the disaggregated computing system. Point-to-point circuit wire level switching is used to switch the disaggregated system from an assigned component residing in a first of the plurality of component pools to the new component residing in a second of the plurality of component pools without interrupting the running workload.

Abstract: A fusion opportunity is detected for a sequence of instructions. The sequence of instructions include an indication of an affiliated location and an indication of an affiliated derived location. Based on the detecting, a value to be stored in the affiliated derived location is generated. The value is a predicted value. The value is stored in the affiliated derived location, and the affiliated derived location is accessed to use the value by one or more instructions executing within the computing environment.

Abstract: A value to be used in register-indirect branching is predicted and concurrently stored in a selected location accessible to one or more instructions. The value may be a target address used by an indirect branch and the selected location may be a hardware register, providing concurrent prediction of branch addresses and the update of register contents.

Abstract: Server resources in a data center are disaggregated into shared server resource pools. Servers are constructed dynamically, on-demand and based on workload requirements, by allocating from these resource pools. A disaggregated compute system of this type keeps track of resources that are available in the shared server resource pools, and it manages those resources based on that information. Each server entity built is assigned with a unique server ID, and each resource that comprises a component thereof is tagged with the identifier. As a workload is processed by the server entity, its composition may change, e.g. by allocating more resources to the server entity, or by de-allocating resources from the server entity. Workload requests are associated with the unique server ID for the server entity. When a workload request is received at a resource, it matches its unique server ID to that of the request before servicing the request.

Abstract: Processing of an instruction fetch from an instruction cache is provided, which includes: determining whether the next instruction fetch is in a same cache line of the instruction cache as a last instruction fetch; and based, at least in part, on determining that the next instruction fetch is in the same cache line, suppressing for the next instruction fetch one or more instruction cache-related directory accesses, and forcing for the next instruction an address match signal for the same cache line. The suppressing may include generating a known-to-hit signal where the next fetch is in the same cache line, and the last fetch is not a branch instruction, and issuing an instruction cache hit where a cache line segment of the same cache line having the next instruction has a valid validity bit, the valid validity bit having been retrieved and maintained based on a most-recent, instruction cache-directory-accessed fetch.

Abstract: Initializing a data structure for use in predicting table of contents (TOC) pointer values. A request to load a module is obtained. Based on the loaded module, a pointer value for a reference data structure is determined. The pointer value is stored in a reference data structure tracking structure, and used to access a variable value for a variable of the module.

Abstract: A Set Table of Contents (TOC) Register instruction. An instruction to provide a pointer to a reference data structure, such as a TOC, is obtained by a processor and executed. The executing includes determining a value for the pointer to the reference data structure, and storing the value in a location (e.g., a register) specified by the instruction.

Abstract: In a branch predictor in a processor capable of executing transactional memory transactions, the branch predictor speculatively predicts the outcome of branch instructions, such as taken/not-taken, the target address and the target instruction. Branch prediction information is buffered during a transaction and is only loaded into the branch predictor when the transaction is completed. The branch prediction information is discarded if the transaction aborts.