Abstract: A method, computer system, and a computer program product for designing and executing at least one storlet is provided. The present invention may include receiving a plurality of restore operations based on a plurality of data. The present invention may also include identifying a plurality of blocks corresponding to the received plurality of restore operations from the plurality of data. The present invention may then include identifying a plurality of grain packs corresponding with the identified plurality of blocks. The present invention may further include generating a plurality of grain pack index identifications corresponding with the identified plurality of grain packs. The present invention may also include generating at least one storlet based on the generated plurality of grain pack index identifications. The present invention may then include returning a plurality of consolidated objects by executing the generated storlet.

Abstract: A method, computer program product and/or system saves an original logical block in a file system and generates a first heatmap reflecting access operations on the original logical block. After taking of a file system snapshot, and receiving information that the original logical block is going to be revised, a second heatmap is generated, reflecting predicted access operations on the revised logical block. The second heatmap is based, at least in part, on the first heatmap. Selecting a physical storage location for the revised logical block is based on the second heatmap.

Abstract: A mechanism is provided for optimizing object storage workflow. A category of a computational algorithm received from a user of a client device is identified, the category identifying a set of storage area network (SAN) features that are optimal for executing the computational algorithm. Features associated with a plurality of nodes in a plurality of infrastructures in an object storage architecture are searched for at least one node that has the set of features identified by the category of the computational algorithm. Responsive to identifying a node that has the set of features identified by the category of the computational algorithm, a determination is made as to whether resources associated with the node are immediately available. Responsive to the resources associated with the node being immediately available, the computational algorithm is issued to the node for execution.

Abstract: A mechanism is provided for optimizing object storage workflow. A category of a computational algorithm received from a user of a client device is identified, the category identifying a set of features that are optimal for executing the computational algorithm and comprising hardware, operating system type, operating system version, and virtualization technology. Features associated with a plurality of nodes in a plurality of infrastructures in an object storage architecture are searched for at least one node that has the set of features identified by the category of the computational algorithm. Responsive to identifying a node that has the set of features identified by the category of the computational algorithm, a determination is made as to whether resources associated with the node are immediately available. Responsive to the resources associated with the node being immediately available, the computational algorithm is issued to the node for execution.

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 computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, identifying object classification data for objects stored within the plurality of nodes, identifying capability data for each of the plurality of nodes, determining an optimal node for implementing the computation algorithm from the plurality of nodes, based on the object classification data and the capability data, and returning an identification of the optimal node.

Abstract: A computer-implemented method according to one embodiment includes identifying an erasure code storage policy for an unified file and object storage system, determining a plurality of storage disks associated with the erasure code storage policy, retrieving disk health parameters for each of the plurality of storage disks, identifying a number of available outer partition storage blocks for each of the plurality of storage disks, and determining a number of erasure code fragments to be stored for a file within the unified file and object storage system before initiating an objectization process on the file, utilizing the disk health parameters for each of the plurality of storage disks and the number of available outer partition storage blocks for each of the plurality of storage disks.

Abstract: A computer-implemented method according to one embodiment includes identifying at a pre-allocation module a size of object data to be stored within a storage node, identifying at the pre-allocation module file system parameters associated with the storage node, calculating at the pre-allocation module pre-allocated details needed for storing the object data within the storage node, utilizing the size of the object data and the file system parameters associated with the storage node, and sending the object data and the pre-allocated details from the pre-allocation module to the storage node.

Abstract: Aspects of the present invention disclose a method for optimizing shared services orchestration. The method includes one or more computer processors receiving resource requirements from a client. The method further includes one or more computer processors determining a list of rules. The method further includes one or more computer processors determining at least one resource based on the resource requirements and the list of rules. The method further includes one or more computer processors deploying at least one resource from the determined at least one resource.

Abstract: An integrated controller for implementing a quality of service when storing input/output data across an array is provided. The integrated controller receives the input/output data from at least one of a file system and an upper layer application. The input/output data can be associated with a quality of service classification. The integrated controller also splits the input/output data into data chunks and determines whether the quality of service classification indicates a first priority or a second priority for each of the data chunks. Then, if the quality of service classification indicates the first priority, the integrated controller proceeds to place the data chunks across a first partition of a disk of the array.

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 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 file system consistency check utility on an erasure coded object storage architecture. Responsive to the file system consistency check utility determining a directory entry does not exist for a given file inode, the mechanism determines whether the given file is part of an erasure code schema of an object storage architecture. Responsive to the file system consistency check utility determining the given file/fragment is part of the erasure code schema, the mechanism determines a container (parent directory) for the given erasure code fragment, wherein the given fragment is a given error code fragment of an object, based on other erasure code fragments corresponding to the object and their placement schematics in the erasure code schema.

Abstract: A first storlet engine is monitored for a first computational algorithm. The storlet engine includes a lookup table including a first characteristic of one or more nodes, a parser unit, and a resource availability monitor. The first computational algorithm is parsed into an abstract syntax tree using a parser unit. A first category of the first computational algorithm is determined by analyzing the abstract syntax tree. A first node of the lookup table with the first characteristic matching the first category for processing the first computational algorithm is identified based on the first category of the computational algorithm. The first computational algorithm is sent to the first node for processing.

Abstract: Embodiments for medical condition communication management by one or more processors. A maturity score and medical condition acceptance score relating to a medical condition of a user may be estimated according to data collected from one or more devices associated with the user. The maturity score may represent a measure of an emotional state, age, and cognitive reasoning ability. The medical condition acceptance score may represent a measure of understanding and acceptance capability of the medical condition. One or more search results responsive to a search query related to the medical condition submitted by the user may be adjusted according to the maturity score, the medical condition acceptance score, and an appropriateness of communications for the one or more search results based on a plurality of identified contextual factors.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for leveraging checkpoint restart. The method includes determining a first set of work stages within a first computation algorithm. A set of permissions associated with the first set of work stages are identified, and the work stages are stored as checkpoints in either a public location or a private location. Upon deployment of a second computation algorithm, a second set of work stages within the second computation algorithm is compared to the first set of work stages. If the second set of work stages match with the first set of work stages, the second computation algorithm is executed using the checkpoint associated with the matching work stages.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for leveraging checkpoint restart. The method includes determining a first set of work stages within a first computation algorithm. A set of permissions associated with the first set of work stages are identified, and the work stages are stored as checkpoints in either a public location or a private location. Upon deployment of a second computation algorithm, a second set of work stages within the second computation algorithm is compared to the first set of work stages. If the second set of work stages match with the first set of work stages, the second computation algorithm is executed using the checkpoint associated with the matching work stages.

Abstract: A computer-implemented method according to one embodiment includes receiving a request to share predetermined data with a device, identifying the predetermined data as sensitive, calculating a current security level for the device, and conditionally sharing the predetermined data with the device, based on the current security level for the device.

Abstract: Accessing objects in an erasure code supported object storage environment including receiving, from a requesting entity, a read request for an object stored in the object storage environment; identifying, using a placement data structure, an object fragment location of a first object fragment of the object; calculating, based on a filesystem root inode number and the object fragment location, a first inode address for the first object fragment of the object, wherein the first inode address identifies a location on a first storage node; reading, using the first inode address, the first object fragment and an inode structure, wherein the inode structure for the first inode address comprises a second inode address for a second object fragment of the object; reading the second object fragment using the second inode address, wherein the second inode address identifies a location on a second storage node; and providing, to the requesting entity, a reconstructed object comprising the first object fragment and the se

Abstract: A method, computer program product and/or system saves an original logical block in a file system and generates a first heatmap reflecting access operations on the original logical block. After taking of a file system snapshot, and receiving information that the original logical block is going to be revised, a second heatmap is generated, reflecting predicted access operations on the revised logical block. The second heatmap is based, at least in part, on the first heatmap. Selecting a physical storage location for the revised logical block is based on the second heatmap.

Abstract: A computer-implemented method, according to one embodiment, includes: creating a namespace in a central storage location, and dividing the namespace into more than one cell. A first cell is a common cell 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. The computer-implemented method further includes: receiving management data from the remote storage locations, storing the received management data in the common cell of the central storage location, receiving object data corresponding to the management data received from the remote storage locations, and storing the received object data in the respective cells of the central storage location. The management data corresponds to object data stored in the remote storage locations.