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: A hierarchal storage management method is provided. The method includes detecting a first portion of a first file being deleted from a hybrid storage device including a hard disk drive (HDD) memory device, a solid state drive (SSD) memory device, and an archival storage memory device. A first set of memory blocks associated with the first portion of the first file is identified. The first set of memory blocks are determined to reside on the SSD memory device. In response, the first set of memory blocks are transferred from the SSD memory device to a first portion of the hybrid storage device.

Abstract: Methods, systems, and computer program products are provided for performing a secure delete operation in a wide area network (WAN) including a cache site and a home site. A method includes identifying a file for deletion at the cache site, determining whether the file has a copy stored at the home site, detecting a location of the copy at the home site prior to a disconnection event of the cache site from the home site, deleting the file from the cache site during the disconnection event, and in response to the secure deletion of the file not being complete during the disconnection event, indicating on a table a remote inode number assigned to the copy associated with the file at the home site, a name under which the copy is saved, and a list of data chunk tuples specifying selected data of the copy to undergo secure deletion.

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 computing system includes a computer in communication with a tiered storage system. The computing system identifies a set of data transferring to a storage tier within the storage system. The computing system identifies a program to which the data set is allocated and determines to increase or reduce resources of the computer allocated to the program, based on the set of data transferring to the storage tier. The computing system discontinues transferring the set of data to the storage tier if a resource allocated to the program cannot be increased.

Abstract: Provided are a computer program product, system, and method for determining a storage pool in which to store a data object. Event messages are received. Each event message includes metadata on an object updated in a storage pool of a plurality of storage pools, at least two of the storage pools have different reliability ratings. The event messages are added to a message queue. Information is added to a database for the event messages in the message queue including the metadata in the event message. A determination is made of a data classification of a changed data object indicated in the database. The changed data object indicated in the database having the determined data classification is moved to a storage pool having a reliability rating satisfying a reliability rating associated with the data classification of the changed data object.

Abstract: Provided are a computer program product, system, and method for determining a storage pool in which to store a data object. Event messages are received. Each event message includes metadata on an object updated in a storage pool of a plurality of storage pools, at least two of the storage pools have different reliability ratings. The event messages are added to a message queue. A determination is made of a data classification of a changed data object indicated in an event message in the message queue. The changed data object is moved to a storage pool having a reliability rating satisfying a reliability rating associated with the data classification of the changed data object.

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: Methods and systems for selective encryption and secured extent quota management for storage servers in cloud computing are provided. A method includes associating at least one secure storage disk and at least one non-secure storage disk to a virtual disk, and associating the virtual disk to an application to allow access of the at least one secure storage disk and the at least one non-secure storage disk. The method further includes accessing the at least one secure storage disk and the at least one non-secure storage disk based on the associating of the virtual disk to the application, to write or read confidential and non-confidential data associated with the application into a respective one of the at least one secure storage disk and the at least one non-secure storage disk.

Abstract: A computing environment includes a home site and a cache site with nonhomogeneous thin-provisioned storage configurations. A file management system updates files stored at the cache site. Each updated file has an updated file size and a pre-update file size. When a resynchronization is needed between the cache site and the home site, for example due to an extended communication failure, the storage requirement changes for the updated files are calculated and a notification is sent to the home site. The notification identifies the updated files and the storage requirement changes. The home site sends a reply to the cache site. The reply identifies which files are approved for immediate processing. The cache site transfers resynchronization data for the approved files to the home site, and delays transferring resynchronization data for the unapproved files until subsequent replies from the home site indicate that the previously unapproved files are now approved.

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 computing system includes a computer in communication with a tiered storage system. The computing system identifies a set of data transferring to a storage tier within the storage system. The computing system identifies a program to which the data set is allocated and determines to increase or reduce resources of the computer allocated to the program, based on the set of data transferring to the storage tier. The computing system discontinues transferring the set of data to the storage tier if a resource allocated to the program cannot be increased.

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: 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 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.

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: Apparatuses, methods, and computer program products are provided for receiving a remote procedure call (RPC) processing request having a priority value from a client device and processing tasks from multiple clients according to the priority values. In certain embodiments, the apparatuses, methods, and computer program products receive a remote request, compare the priority value of the received RPC processing request with priority values of pending RPC processing requests, and assign the received RPC processing request to a queue of a plurality of queues in response to the comparing.

Abstract: Methods and systems for data relocation in global storage cloud environments are provided. A method includes locating a data server near a travel location of a user based on one or more travel plans of the user. The method further includes transferring data of the user from a home data server near a home location of the user to the data server near the travel location.