Abstract: Computer implemented methods for concurrent processing of operations on a tree-based data structure include: receiving input at a storage system managing a storage device in which the tree-based data structure is stored, the input identifying a set of heterogeneous operations to be applied to the tree-based data structure; determining one or more nodes of the tree-based data structure to which one or more of the set of heterogeneous operations are to be applied; and performing one or more of the set of heterogeneous operations concurrently and in bulk. Systems and methods for accomplishing the same are also disclosed.

Abstract: A method for controlling dispatching work tasks in a multi-tier storage environment. A computer system receives storage demands of work tasks. The computer system determines placement and migration policies for data in storage tiers in a storage system. The computer system prepares the storage tiers for meeting the storage demands of work tasks, based on the placement and migration policies. The computer system determines a state of preparation of the storage tiers for meeting the storage demands of work tasks. The computer system determines a list including work tasks that can proceed and work tasks that cannot proceed, based on the state of the preparation. The computer system modifies a schedule of the work tasks, based on the list.

Abstract: Caching extracted information from application containers by one or more processors. Upon extracting relevant information from a temporary container, the relevant information is cached at a container template level. A space guard is applied controlling an amount of storage consumed by the cached relevant information, and a time guard is applied controlling an expiration of the cached relevant information. The cached relevant information is maintained for injection into a working container. Applying the space guard includes defining a purge process for pruning or removing cached relevant information stored in the cache, and candidate files for the purge process may be identified using a predetermined criterion. Applying the time guard includes using a time metric defined in a profile of an information injection agent, where the time metric is based on one of a creation time, a last access time or a last modified time of the cached relevant information.

Abstract: Embodiments for managing data stored in a tiered data storage system, by a processor device. Upon submission of a workload to a queue of a workload manager, a set of storage demands included in metadata associated with the workload is received by an optimization policy generator. The set of storage demands is translated, by the optimization policy generator, into data placement, migration, and deletion policies to be executed by the storage system. At least one of a plurality of storage tiers within the storage system is prepared for the workload in the queue by using current storage tier allocations and the data placement, migration, and deletion policies to restructure content in the storage tiers according to the set of storage demands prior to performing the workload.

Abstract: Systems and methods include: receiving input at a storage system managing a storage device in which a tree-based data structure is stored, the input identifying a set of heterogeneous operations to be applied to the tree-based data structure; determining one or more nodes of the tree-based data structure to which one or more of the set of heterogeneous operations are to be applied; determining one or more groups of the set of heterogeneous operations, the determining being based at least in part on the one or more nodes to which the heterogeneous operations are to be applied; isolating processing of each node from processing of other nodes; and processing each of the one or more nodes to which one or more of the set of heterogeneous operations are to be applied with one of the groups of the set of heterogeneous operations.

Abstract: For adaptive similarity search resolution in a data deduplication system using a processor device in a computing environment, multiple resolution levels are configured for a similarity search. Input similarity elements are calculated in one resolution level for a chunk of input data. The input similarity elements of the one resolution level are used to find similar data in a repository of data where similarity elements of the stored similar repository data are of the multiple resolution levels.

Abstract: Computer implemented methods for concurrent processing of operations on a tree-based data structure include: receiving input at a storage system managing a storage device in which the tree-based data structure is stored, the input identifying a set of heterogeneous operations to be applied to the tree-based data structure; determining one or more nodes of the tree-based data structure to which one or more of the set of heterogeneous operations are to be applied; determining one or more groups of the set of heterogeneous operations according to the one or more nodes to which the set of heterogeneous operations are to be applied; and applying, for each of the one or more groups, the set of heterogeneous operations according to a predefined order. Systems and methods for accomplishing the same are also disclosed.

Abstract: For adaptive similarity search resolution in a data deduplication system using a processor device in a computing environment, input data is partitioned into data chunks. Input similarity elements are calculated for an input chunk. The input similarity elements are used to find similar data in a repository of data using a similarity search structure. A resolution level is calculated for storing the input similarity elements. The input similarity elements are stored in the calculated resolution level in the similarity search structure.

Abstract: Embodiments for caching extracted information from application containers by one or more processors. Upon extracting relevant information from a temporary container, the relevant information is cached at a container template level. A space guard is applied controlling an amount of storage consumed by the cached relevant information, and a time guard is applied controlling an expiration of the cached relevant information. The cached relevant information is maintained for injection into a working container.

Abstract: Embodiments for applying host access control rules for application containers by one or more processors. A first set of user identifiers and permissions is extracted from a temporary container and a second set of user identifiers and permissions is extracted from a host on which a working container will reside. The first set and the second set of user identifiers and permissions are combined into an aggregate set of user identifiers and permissions and injected into the working container.

Abstract: Embodiments for aggregated information calculation and injection for application containers by one or more processors. Prior to commencing execution of an application inside a working container, a temporary container having an equivalent application template or container template as the working container is started. Relevant information from inside the temporary container and relevant information from a host associated with the application is extracted. Aggregated information is calculated based on the extracted relevant information from inside the temporary container and from the host.

Abstract: Embodiments for reducing resource consumption of a similarity index in data deduplication by a processor. Only a latest generation of repository data is represented in the similarity index. Implicit deletion is applied in the similarity index. A subset of bytes of a full representative value is maintained in a similarity index entry. A respective one of a plurality of similarity units is deduplicated with a corresponding similarity unit of a previous snapshot, and a deduplication coverage thereof is examined. If a deduplication coverage threshold is not met, a similarity search is conducted and the respective one of the similarity units is deduplicated with a found similarity unit residing in the similarity index.

Abstract: Various embodiments for managing data in a data storage having data deduplication. In response to a portion of the data storage determined to be inaccessible, an identifier of a user data segment is queried by examining a corresponding back reference data structure, the back reference data structure implemented as an approximation of a relationship between the user data segment and a particular storage block in the data storage. If the outcome of the query is negative, the user data segment is determined not associated with the particular storage block. If the outcome of the query is positive, the user data segment is warranted be examined further to determine if the user data segment is associated with the particular storage block.

Abstract: Embodiments for managing resources in a tiered data storage system, by a processor device. In response to differing business priorities for executing workloads by a workload manager, a resource plan is generated by an administrator of the workload manager. The resource plan defines what resources of the storage system are allocated to a particular group of tenants and at what time the workloads of the particular group are executed, thereby optimizing utilization of the resources of the storage system.

Abstract: Embodiments for managing data stored in a tiered data storage system, by a processor device. Upon submission of a workload to a queue of workloads of a workload manager, a set of storage demands included in metadata associated with the workload is received by an optimization policy generator. A current state of each one of a plurality of storage tiers within the storage system is combined with information comprising the set of storage demands to create data scheduling and placement policies such that the optimization policy generator controls which storage tier in the tiered data storage system incoming data is written to while a scheduling logic determines at what time to dispatch at least a portion of the workload.

Abstract: Embodiments for data deduplication of an initial snapshot of a data set in a storage system by a processor. An intra-snapshot similarity index, inclusive of representations of the data inside the initial snapshot, is built. The intra-snapshot similarity index is used for deduplication of the initial snapshot. The intra-snapshot similarity index is merged with a global similarity index.

Abstract: Embodiments for managing data stored in a tiered data storage system, by a processor device. Upon submission of a workload to a queue of a workload manager, a set of storage demands included in metadata associated with the workload is received by an optimization policy generator. The set of storage demands is translated, by the optimization policy generator, into data placement, migration, and deletion policies to be executed by the storage system. At least one of a plurality of storage tiers within the storage system is prepared for the workload in the queue by using current storage tier allocations and the data placement, migration, and deletion policies to restructure content in the storage tiers according to the set of storage demands prior to performing the workload.

Abstract: A computer-implemented method according to one embodiment includes identifying a request to create a consumer within a converged system. Additionally, the method includes defining the consumer within a hierarchy of consumers, where the consumer represents a function in an organization. Further, the method includes associating the consumer with a plurality of storage resources and a plurality of computing resources. Further still, the method includes setting a storage capacity attribute for the consumer.

Abstract: A computer-implemented method according to one embodiment includes identifying a plurality of storage resources. Additionally, the method includes creating a storage capacity, where the storage capacity has a first plurality of associated attributes. Further, the method includes defining one or more data volumes for the storage capacity, where each of the one or more data volumes has a second plurality of associated attributes and inherits the first plurality of associated attributes. Further still, the method includes configuring one or more volume shares for each data volume, where each of the volume shares has a third plurality of associated attributes and inherits the first plurality of associated attributes as well as the second plurality of associated attributes.

Abstract: A computer-implemented method according to one embodiment includes identifying a request to create a consumer within a converged system, defining the consumer within a hierarchy of consumers, where the consumer represents a function in an organization, setting a storage capacity attribute for the consumer, and conditionally defining a data volume for the consumer, based at least in part on the storage capacity attribute.