Abstract: Provided are a computer program product, system, and method for classifying a digital speech sample of a call to determine routing for the call. A digital speech sample of a call agent is processed to categorize speech as having an agent speech attribute. Information is received on a caller speech attribute initiating a call to the call center. The caller speech attribute results from categorizing a caller digital speech sample of the caller as having the caller speech attribute. A call agent of call agents having a call agent speech attribute that matches the caller speech attribute is selected and the call is routed to the selected call agent to process the call.

Abstract: A computer-implemented method, according to one embodiment, includes: dividing a namespace in a central storage location into more than one cell. A first of the more than one cell is a common cell, which is configured to store management data received from remote storage locations coupled to the central storage location. Each of the remaining cells are configured to store object data received from a respective one of the remote storage locations. Management data received from the remote storage locations is stored in the common cell of the central storage location. Object data is also received, where the object data corresponds to the management data received from the remote storage locations. Furthermore, the received object data is stored in the respective cells of the central storage location. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A system and method dynamically transitions the file system role of compute nodes in a distributed clustered file system for an object that includes an embedded compute engine (a storlet). Embodiments of the invention overcome prior art problems of a storlet in a distributed storage system with a storlet engine having a dynamic role module which dynamically assigns or changes a file system role served by the node to a role which is more optimally suited for a computation operation in the storlet. The role assignment is made based on a classification of the computation operation and the appropriate filesystem role that matches computation operation. For example, a role could be assigned which helps reduce storage needs, communication resources, etc.

Abstract: For migrating data to a remote data repository based on the security protocol capabilities of the remote data repository, a storage module identifies a security profile of a file residing in an on-premise data repository, where the security profile comprises security protocol requirements, matches the identified security profile with an entry in a list of one or more remote data repository providers, each entry comprising a security protocol capability of a corresponding remote data repository provider, and migrates, in response to finding a match of the identified security profile and the identified security protocol capability, the file to the matched remote data repository provider.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving one or more suggestions which correspond to placement of data in storage, where the one or more suggestions are based on data workload characteristics. The one or more suggestions are used to identify portions of actual data stored in actual storage which correspond to the one or more suggestions. For each of the identified portions of the actual data stored in the first tier, the one or more suggestions is further used to determine whether to transfer the given identified portion of the actual data to the second tier. Moreover, in response to determining to transfer at least one of the identified portions of the actual data to the second tier, one or more instructions are sent to transfer the at least one of the identified portions of the actual data from the first tier to the second tier.

Abstract: Embodiments for managing data transfers by one or more processors are described. A signal is caused to be sent between a first computing system and a second computing system. Data is stored on at least one of the first computing system and the second computing system. During at least one first portion of the signal, information associated with the storage of the data on the at least one of the first computing system and the second computing system is transferred between the first computing system and the second computing system. During at least one second portion of the signal, at least some of the data is transferred between the first computing system and the second computing system.

Abstract: A mechanism is provided in a data processing system comprising at least one processor and at least one memory, the at least one memory comprising instructions which are executed by the at least one processor and configure the processor to implement a snapshot utility for generating a snapshot of an erasure coded object in an object storage environment. Responsive to receiving a request to generate a snapshot of an erasure coded (EC) object in a filesystem in the object storage environment, the snapshot utility obtains a list of EC fragments from a proxy layer of the object storage environment. The snapshot utility copies a number of the EC fragments to generate the snapshot of the EC object.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving, by the computer, information. The information that is received includes: an expiry time which corresponds to a communication request, and communication resources associated with the communication request. The communication resources further include a channel and/or a spectrum band which correspond to the communication request. The expiry time is packaged with the communication resources by the computer. Furthermore, the packaged expiry time and communication resources is passed, by the computer, to devices which correspond to each of one or more identities associated with the communication request. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A computer-implemented method according to one embodiment includes classifying an image stored on a device as a type of image. A user's access pattern of other images also classified as the type of image is analyzed. The method further includes analyzing at least one sharing medium that the user has previously used to share the image and/or other images. The analyzing the at least one medium is at least in part based on the classified type of the image. A previously recorded delete pattern of the user is analyzed. The analyzing the previously recorded delete pattern of the user is at least in part based on the classified type of the image. Based on the classified type of the image and/or based on results of the analyses, the image is categorized to one of a plurality of image compression categories. Each category corresponds to a degree of image compression.

Abstract: A system and method dynamically transitions the file system role of compute nodes in a distributed clustered file system for an object that includes an embedded compute engine (a storlet). Embodiments of the invention overcome prior art problems of a storlet in a distributed storage system with a storlet engine having a dynamic role module which dynamically assigns or changes a file system role served by the node to a role which is more optimally suited for a computation operation in the storlet. The role assignment is made based on a classification of the computation operation and the appropriate filesystem role that matches computation operation. For example, a role could be assigned which helps reduce storage needs, communication resources, etc.

Abstract: A computer-implemented method, according to one embodiment, includes: selecting two previously captured snapshots and calculating a checksum for each file in each of the two snapshots. The checksums are used to determine whether the two snapshots are sufficiently similar to each other. In response to determining that the two snapshots are sufficiently similar to each other, important ones of the files in each of the two snapshots are identified. The identified important files which are located in a lower performance tier of a multi-tier data storage system are transitioned to a higher performance tier of the multi-tier data storage system. Moreover, a merged snapshot is created by merging the two snapshots, and the merged snapshot is provided for additional operations. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: Methods and systems for an enhanced restripe mechanism are provided. A system for an enhanced restriping mechanism includes a data storage module that stripes data across a plurality of storage devices, wherein the plurality of storage devices are arranged into a plurality of storage pools and the data is distributed across the plurality of storage pools. Also, the system may include a movement detection module that detects changes in the arrangement of the plurality of storage devices that would cause the data on a storage device in the plurality of storage devices to be moved onto other storage devices in the plurality of storage devices. Further, the system may include a restriping module that restripes disk data from the storage device in the plurality of storage devices onto the other storage devices in response to the detected change based on access characteristics of the data.

Abstract: A computer-implemented method, according to one embodiment, includes: identifying block addresses which are associated with a given object, and combining the block addresses to a first set in response to determining that at least one token is currently issued on one or more of the identified block addresses. A first portion of the block addresses is transitioned to a second set, where the first portion includes ones of the block addresses determined as having a token currently issued thereon. Moreover, a second portion of the block addresses is divided into equal chunks, where the second portion includes the block addresses remaining in the first set. The chunks in the first set are allocated across two or more parallelization units. Furthermore, the block addresses in the second set are divided into equal chunks, and the chunks in the second set are allocated to at least one dedicated parallelization unit.

Abstract: A present invention embodiment manages resources of a distributed system to perform computational tasks within a specified time interval. A received object is classified into a type of computational processing, and a quantity of objects is maintained for each type. An execution time for processing a single object is estimated based on a corresponding computation resource template. A total execution time for the quantity of objects of a type of computational processing is determined based on the estimated execution time. In response to the total execution time exceeding a user-specified time interval, an amount of resources of the distributed system is determined to process the quantity of objects of the type within the user-specified time interval. Nodes of the distributed system with objects classified in the type use the determined amount of resources to process the quantity of objects for the type within the user-specified time interval.

Abstract: A computer-implemented method, according to one embodiment, includes: capturing a snapshot of data stored at a primary storage location, and determining a transaction identification which corresponds to each file operation included in the snapshot, where each file operation includes a respective number of sub-operations. Data included in the snapshot which corresponds to completed ones of the sub-operations is identified, and the determined transaction identifications as well as the identified data is used to populate entries in a data structure. The snapshot is sent to a secondary storage location, and an acknowledgement is received from the secondary storage location for each of the completed sub-operations that are successfully performed at the secondary storage location. Furthermore, the data structure is updated based on the received acknowledgements.

Abstract: An embodiment of the invention may include a method, computer program product and system for optimizing a wide area network caching infrastructure in a file based object storage architecture. The embodiment may include creating, by a parent partition, a heat map. The embodiment may include prioritizing prefetching by multiple dependent partitions based on the heat map. In response to prioritized prefetching by the multiple dependent partitions, the embodiment may include allocating wide area network caching threads. The embodiment may include providing, by the parent partition, objects for prefetching by the multiple dependent partitions utilizing the allocated wide area network caching threads.

Abstract: Methods and systems for an enhanced restripe mechanism are provided. A system for an enhanced restriping mechanism includes a data storage module that stripes data across a plurality of storage devices, wherein the plurality of storage devices are arranged into a plurality of storage pools and the data is distributed across the plurality of storage pools. Also, the system may include a movement detection module that detects changes in the arrangement of the plurality of storage devices that would cause the data on a storage device in the plurality of storage devices to be moved onto other storage devices in the plurality of storage devices. Further, the system may include a restriping module that restripes disk data from the storage device in the plurality of storage devices onto the other storage devices in response to the detected change based on access characteristics of the data.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving an operation request which corresponds to a given object, identifying multiple block addresses which are associated with the given object, determining whether any one or more of the identified block addresses have a token currently issued thereon, and combining the multiple block addresses to a first set in response to determining that at least one token is currently issued on one or more of the identified block addresses. A first portion of the block addresses determined as having a token currently issued thereon is transitioned to a second set. A remaining portion of the block addresses is also divided into equal chunks. The chunks are allocated in the first set across parallelization units, and the block addresses in the second set are divided into equal chunk. Furthermore, the chunks in the second set are allocated to a dedicated parallelization unit.

Abstract: A method, computer system, and a computer program product for dynamic IO throttling in a storlet environment is provided. The present invention may include receiving, from a user, a computational algorithm. The present invention may also include deploying the received computational algorithm. The present invention may then include determining the user has not engaged throttling based on the deployed computational algorithm. The present invention may further include parsing the computational algorithm based on the engaged throttling. The present invention may include identifying a pipeline operation based on the parsed computational algorithm. The present invention may also include building a timing relation between the identified pipeline operation and an IO operation. The present invention may then include translating a timing lag to a storage IO operation based on the built timing relation.

Abstract: A computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, determining one or more computation operations required by the computation algorithm, identifying virtualization unit metadata for each of the plurality of nodes, determining, from the plurality of nodes, an optimal node for implementing the computation algorithm based on the one or more computation operations and the virtualization unit metadata for each of the plurality of nodes, and returning an identification of the optimal node.