Abstract: Creating a summary of a plurality of texts includes tokenizing each of a plurality of texts to obtain tokens; generating a vector space using a first set of vectors having one or more obtained feature scores equal to or larger than a predefined value; executing non-hierarchical clustering using the vector space to generate a first plurality of clusters; choosing a first representative text in each of the plurality of clusters; generating a second set of vectors from each of the arrays generated based on a number of characters included in tokens of the representative texts; executing hierarchical clustering using the second set of vectors to generate a second plurality of clusters; and in response to a determining a number of clusters included in the second plurality of clusters, determining a second representative text for each of the clusters included in the second plurality of clusters.

Abstract: Performing an operation comprising transforming an input dataset to a predefined format, extracting, from the transformed dataset, a plurality of features describing the transformed dataset, and generating, by a machine learning (ML) algorithm executing on a processor and based on an ML model, a plurality of rules for modifying the transformed dataset to conform with a first data model.

Abstract: An actuator to execute on a server may be automatically selected based on risk of failure and damage to the server. Requirement specification and environment parameters may be received. A subset of actuators may be selected based on a risk threshold from an actuator catalog database storing actuator information and actuator risk metadata associated with a plurality of actuators. The actuator risk metadata may be augmented with risk information. A ranked list of the subset of actuators may be generated based on the actuator risk metadata associated with each actuator in the subset. An actuator in the ranked list may be executed on the server.

Abstract: Various embodiments for optimizing memory bandwidth in a disaggregated computing system, by a processor device, are provided. Respective memory devices are assigned to respective processor devices in the disaggregated computing system, the disaggregated computing system having at least a pool of the memory devices and a pool of the processor devices. An analytic function is performed on data resident in the pool of the memory devices using memory bandwidth not currently committed to a primary compute task.

Abstract: Creating a summary of a plurality of texts includes tokenizing each of a plurality of texts to obtain tokens; generating a vector space using a first set of vectors having one or more obtained feature scores equal to or larger than a predefined value; executing non-hierarchical clustering using the vector space to generate a first plurality of clusters; choosing a first representative text in each of the plurality of clusters; generating a second set of vectors from each of the arrays generated based on a number of characters included in tokens of the representative texts; executing hierarchical clustering using the second set of vectors to generate a second plurality of clusters; and in response to a determining a number of clusters included in the second plurality of clusters, determining a second representative text for each of the clusters included in the second plurality of clusters.

Abstract: Respective memory devices are assigned to respective processor devices in a disaggregated computing system, the disaggregated computing system having at least a pool of the memory devices and a pool of the processor devices. An iterative learning algorithm is used to define data boundaries of a dataset for performing an analytic function on the dataset simultaneous to a primary compute task, unrelated to the analytic function, being performed on the dataset in the pool of memory devices using memory bandwidth not currently committed to the primary compute task, thereby efficiently employing the unused memory bandwidth to prevent underutilization of the pool of memory devices.

Abstract: Server resources in a data center are disaggregated into shared server resource pools, including an accelerator (e.g., FPGA) pool. Servers are constructed dynamically, on-demand and based on workload requirements, by allocating from these resource pools. According to this disclosure, accelerator utilization in the data center is managed proactively by assigning accelerators to workloads in a fine granularity and agile way, and de-provisioning them when no longer needed. In this manner, the approach is especially advantageous to automatically provision accelerators for data analytic workloads. The approach thus provides for a “micro-service” enabling data analytic workloads to automatically and transparently use FPGA resources without providing (e.g., to the data center customer) the underlying provisioning details. Preferably, the approach dynamically determines the number and the type of FPGAs to use, and then during runtime auto-scales the FPGAs based on workload.

Abstract: Embodiments generally relate transforming data for a target schema. In some embodiments, a method includes receiving input data, where the input data includes a plurality of segments, and where the segments include a plurality of source fields containing target data. The method further includes characterizing the input data based at least in part on a plurality of predetermined metrics, where the predetermined metrics determine a structure of the input data. The method further includes mapping the target data in the source fields of the segments to a plurality of target fields of a target schema based at least in part on the characterizing. The method further includes populating the target fields of the target schema with the target data from the source fields based at least in part on the mapping.

Abstract: Creating a summary of a plurality of texts includes tokenizing each of a plurality of texts to obtain tokens; generating a vector space using a first set of vectors having one or more obtained feature scores equal to or larger than a predefined value; executing non-hierarchical clustering using the vector space to generate a first plurality of clusters; choosing a first representative text in each of the plurality of clusters; generating a second set of vectors from each of the arrays generated based on a number of characters included in tokens of the representative texts; executing hierarchical clustering using the second set of vectors to generate a second plurality of clusters; and in response to a determining a number of clusters included in the second plurality of clusters, determining a second representative text for each of the clusters included in the second plurality of clusters.

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: 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: 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: 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: A method is provided for data matching between a set of source data structures and a set of target data structures. The method includes obtaining, using a processor device configured to perform machine learning, source to target matching results with matching scores, based on the sets of source and target data structures. The method further includes calculating, by the processor device, context information for data structure pairs based on a structure similarity and an ontology similarity between constituent data structures thereof. Each of data structure pairs include as the constituent data structures a respective source data structure and a respective target data structure from the sets of source and target data structures. The method also includes updating, by the processor device, the matching scores based on the context information. The method additionally includes controlling, by the processor device, a hardware device responsive to at least one updated matching score.

Abstract: A group of processors in a processor pool comprise a secure “enclave” in which user code is executable and user data is readable solely with the enclave. This is facilitated through the key management scheme described that includes two sets of key-pairs, namely: a processor group key-pair, and a separate user key-pair (typically one per-user, although a user may have multiple such key-pairs). The processor group key-pair is associated with all (or some define subset of) the processors in the group. This key-pair is used to securely communicate a user private key among the processors. The user private key, however, is not transmitted to non-members of the group. Further, preferably the user private key is refreshed periodically or upon any membership change (in the group) to ensure that non-members or ex-members cannot decipher the encrypted user key.

Abstract: Embodiments for performing rolling software upgrades in a disaggregated computing environment. A rolling upgrade manager is provided for upgrading one or more disaggregated servers. A designated memory area is used for storing an updated software component, and a disaggregated server is switched to the designated memory area from a currently assigned memory area when performing the software upgrade. A process state and program data is maintained in the currently assigned memory area while maintaining the updated software component in the designated memory area such that the process state and program data are read from the currently assigned memory area and the updated software component is read from the designated memory area during currently executing operations of the disaggregated server.

Abstract: Direct inter-processor communication is enabled with respect to data in a memory location without having to switch specific circuits through a switching element (e.g., an optical switch). Rather, in this approach a memory pool is augmented to include a dedicated portion that serves as a disaggregated memory common space for communicating processors. The approach obviates the requirement of switching of physical memory modules through the optical switch to enable the processor-to-processor communication. Rather, processors (communicating with another) have an overlapping ability to access the same memory module in the pool; thus, there is no longer a need to change physical optical switch circuits to facilitate the inter-processor communication. The disaggregated memory common space is shared among the processors, which can access the common space for reads and writes, although particular locations in the memory common space for reads and writes are different.

Abstract: MapReduce processing is carried out in a disaggregated compute environment comprising a set of resource pools that comprise a processor pool, and a memory pool. Upon receipt of a MapReduce job, a task scheduler allocates resources from the set of resource pools, the resources including one or more processors drawn from the processor pool, and one or more memory modules drawn from the memory pool. The task scheduler then schedules a set of tasks required by the MapReduce job. At least one particular task in the set is scheduled irrespective of a location of data required for the particular task. In association with a shuffle phase of the MapReduce job, and in connection with the particular task, at least one connection between a processor and at least one memory module is dynamically rewired based on the location of the data required for the particular task, thereby obviating network transfer of that data.

Abstract: Server resources in a data center are disaggregated into shared server resource pools, which include a pool of secure processors. Advantageously, servers are constructed dynamically, on-demand and based on a tenant's workload requirements, by allocating from these resource pools. According to this disclosure, secure processor modules for new servers are allocated to provide security for data-in-use (and data-at-rest) in a dynamic fashion so that virtual and non-virtual capacity can be adjusted in the disaggregate compute system without any downtime, e.g., based on workload security requirements and data sensitivity characteristics. The approach herein optimizes an overall utilization of an available secure processors resource pool in the disaggregated environment. The resulting disaggregate compute system that is configured according to the approach cryptographically-protects workload data whenever it is outside the CPU chip.

Abstract: For measuring component utilization in a computing system, a server energy utilization reading of a statistical significant number of servers out of a total number of servers located in the datacenter is obtained by measuring, at predetermined intervals, a collective energy consumed by all processing components within each server. The collective energy is measured by virtually probing thereby monitoring an energy consumption of individual ones of all the processing components to each collect an individual energy utilization reading, where the individual energy utilization reading is aggregated over a predetermined time period to collect an energy consumption pattern associated with the server utilization reading.