Abstract: A computer-implemented method, according to one embodiment, includes receiving, by a server from a client application, a read request for a data block. The method further includes, reading, by the server, data of the data block and checksums associated with the data block, from a data storage drive, and storing, by the server, the data of the data block and the associated checksums in a buffer. A client node is caused, by the server, to use the associated checksums to perform a validity check for the data of the data block and a transmission from the server to the client node. A computer program product, according to another embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a server to cause the server to perform the foregoing method.

Abstract: A computer-implemented method, according to one embodiment, includes receiving, by a server from a client application, a read request for a data block. The method further includes, reading, by the server, data of the data block and checksums associated with the data block, from a data storage drive, and storing, by the server, the data of the data block and the associated checksums in a buffer. A client node is caused, by the server, to use the associated checksums to perform a validity check for the data of the data block and a transmission from the server to the client node. A computer program product, according to another embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a server to cause the server to perform the foregoing method.

Abstract: A computer-implemented method comprises initializing a plurality of segment lists. Each segment list of the plurality of segment lists corresponds to a respective one of a plurality of disk drives. Each segment list divides storage space of the respective disk drive into a plurality of segments. The method further comprises, for each of the plurality of disk drives, identifying one or more candidate segments from the plurality of segments; calculating a respective segment distance variance for one or more combinations of identified candidate segments. Each combination of identified candidate segments includes one candidate segment for each of the plurality of disk drives. The method further comprises selecting a combination of the one or more combinations of identified candidate segments having the smallest respective segment distance variance; and storing data on the plurality of disk drives according to the selected combination of identified candidate segments.

Abstract: Method and apparatus for reducing resource consumption in container image management. Embodiments include receiving directory information and checksum information corresponding to a plurality of files of a container image. Embodiments include determining, based on the directory information and the checksum information, whether each file of the plurality of files is present in a repository. For each respective file of the plurality of files that is determined to be present in the repository, embodiments include updating a file list for the container image to indicate a respective location in the repository of the respective file. For each given file of the plurality of files that is determined not to be present in the repository, embodiments include storing the given file at a given location in the repository and updating the file list for the container image to indicate the given location in the repository of the given file.

Abstract: A computer-implemented method comprises initializing a plurality of segment lists. Each segment list of the plurality of segment lists corresponds to a respective one of a plurality of disk drives. Each segment list divides storage space of the respective disk drive into a plurality of segments. The method further comprises, for each of the plurality of disk drives, identifying one or more candidate segments from the plurality of segments; calculating a respective segment distance variance for one or more combinations of identified candidate segments. Each combination of identified candidate segments includes one candidate segment for each of the plurality of disk drives. The method further comprises selecting a combination of the one or more combinations of identified candidate segments having the smallest respective segment distance variance; and storing data on the plurality of disk drives according to the selected combination of identified candidate segments.

Abstract: Method and apparatus for reducing resource consumption in container image management. Embodiments include receiving directory information and checksum information corresponding to a plurality of files of a container image. Embodiments include determining, based on the directory information and the checksum information, whether each file of the plurality of files is present in a repository. For each respective file of the plurality of files that is determined to be present in the repository, embodiments include updating a file list for the container image to indicate a respective location in the repository of the respective file. For each given file of the plurality of files that is determined not to be present in the repository, embodiments include storing the given file at a given location in the repository and updating the file list for the container image to indicate the given location in the repository of the given file.

Abstract: Embodiments of the present invention relate to methods, systems, and computer program products for container image management. In a method, an image layer in a container image may be received by one or more processors, and the container image is to be stored in an image server comprising a group of image layers. A base portion may be selected by one or more processors from the group of image layers based on a similarity analysis between the image layer and the group of image layers. A patch portion may be generated by one or more processors based on a difference between the image layer and the selected base portion. With these embodiments, the container image may be stored based on multiple image layers, and thus the container image may be maintained in a much finer granularity so as to reduce requirements on the bandwidth and time cost for transmitting the container image.

Abstract: Embodiments of the present invention relate to methods, systems, and computer program products for container image management. In a method, an image layer in a container image may be received by one or more processors, and the container image is to be stored in an image server comprising a group of image layers. A base portion may be selected by one or more processors from the group of image layers based on a similarity analysis between the image layer and the group of image layers. A patch portion may be generated by one or more processors based on a difference between the image layer and the selected base portion. With these embodiments, the container image may be stored based on multiple image layers, and thus the container image may be maintained in a much finer granularity so as to reduce requirements on the bandwidth and time cost for transmitting the container image.

Abstract: Embodiments of the present invention relate to methods, systems, and computer program products for application migration management. In a method, an application that is to be migrated may be determined by one or more processors in response to detecting an event in a node in a plurality of nodes, the application and application data of the application being located in the node. A group of candidate nodes to which the application is to be migrated may be determined from the plurality of nodes by one or more processors. The application data of the application may be relocated by one or more processors from the node to the group of candidate nodes. With these embodiments, the application data may be copied to the candidate nodes in advance, and the migrated application may be directly run, such that a time cost of the migration may be greatly reduced.

Abstract: Embodiments of the present disclosure relate to IO initiator aware data migration. A set of statistical metrics for a replica of a data block on a first node of a plurality of nodes is obtained. The first set of statistical metrics is associated with read operations on the replica. The read operations are operations initiated by a second node of the plurality of nodes. If it is determined that a first statistical metric in the set of statistical metrics exceeds a predefined threshold, the replica is migrated from the first node to the second node.

Abstract: An approach, for fileset based data locality management in Distributed File Systems. A data locality manager receives fileset identifiers and associated block allocation information, for storing in data block locality tables. The data locality manager determines data block locality factors based on the fileset identifiers and the block allocation information, creating a collection of the data block locality factors. The data locality manager stores the collection of the data block locality factors in the data block locality tables. The data locality manager receives the fileset identifiers for determining the collection of the data block locality factors associated to the fileset identifiers and outputs the collection of the data block locality factors.

Abstract: Embodiments of the present disclosure relate to IO initiator aware data migration. A set of statistical metrics for a replica of a data block on a first node of a plurality of nodes is obtained. The first set of statistical metrics is associated with read operations on the replica. The read operations are operations initiated by a second node of the plurality of nodes. If it is determined that a first statistical metric in the set of statistical metrics exceeds a predefined threshold, the replica is migrated from the first node to the second node.

Abstract: An approach, for fileset based data locality management in Distributed File Systems. A data locality manager receives fileset identifiers and associated block allocation information, for storing in data block locality tables. The data locality manager determines data block locality factors based on the fileset identifiers and the block allocation information, creating a collection of the data block locality factors. The data locality manager stores the collection of the data block locality factors in the data block locality tables. The data locality manager receives the fileset identifiers for determining the collection of the data block locality factors associated to the fileset identifiers and outputs the collection of the data block locality factors.