Abstract: A data storage system has multiple tiers of data storage including an upper tier having a lower access latency and a lower tier having a higher access latency. A storage controller of the data storage system implements throttling limits regulating access to data in the data storage system for a plurality of throttling units sharing the data storage system. The storage controller also tracks access frequencies of extents in the data storage system. The storage controller migrates extents among the multiple tiers based on the access frequencies of the extents and the throttling limits implemented for the throttling units.

Abstract: Embodiments of the present invention disclose methods and systems for object storage. Migration policies and an algorithm applied by the module facilitates the migration of files (i.e., object replicas or erasure code fragments) from one storage to another storage. The FILE_HEAT is monitored over a period of time. If the FILE_HEAT of a file increases over a period of time relative to the other files, the file is migrated to a higher level storage. Files can be migrated to a higher level storage even if the FILE_HEAT of a file decreases over a period of time.

Abstract: Methods and systems for encrypting data for a multi-tenant filesystem environment are provided. A system for encrypting data for a multitenant filesystem environment includes a file characteristics module that determines file characteristics for a file. The system also includes a user identification module that collects user identification information for one or more file operations, where a file operation in the one or more file operations is performed on a portion of the file. The system further includes a portion information module that gathers portion information about the portion of the file. Additionally, the system includes an encryption module that associates the portion information with a subtenancy encryption key in one or more subtenancy encryption keys based on the user identification information, where the one or more subtenancy encryption keys are associated with the file.

Abstract: A computer includes a storage segment fully allocated to an application. The storage segment initially includes a repeating initialization data pattern there within. After the application begins its workload, the application writes application data to a portion of the storage segment. A snapshot application takes a snapshot of the storage segment. After the snapshot, the application generates a post-snapshot-write to the storage segment. The snapshot application determines whether the post-snapshot-write modifies application data or modifies the repeating initialization data pattern. If the post-snapshot-write modifies the repeating initialization data pattern within the storage segment, the snapshot application blocks the repeating initialization data pattern from being copied and moved which resultantly blocks modification of the snapshot.

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: An embodiment of the invention may include a method, computer program product and system for optimizing data defragmentation. The embodiment may include collecting details related to contiguous storage space available on a disk drive. The embodiment may include identifying a type of object storage implementation utilized on the disk drive. The type of object storage implementation is based on how an object is stored within the disk drive. The embodiment may include identifying an important component of the object. The important component of the object is determined by a frequency of access. The embodiment may include identifying a non-important component of the object. The non-important component of the object is determined by a frequency of access. The embodiment may include moving the important component to an outer sector of the disk drive. The embodiment may include moving the non-important component to an inner sector of the disk drive.

Abstract: A method for more efficiently storing genomic includes designating multiple different data storage techniques for storing genomic data generated by a genomic pipeline. The method further identifies a file, made up of multiple blocks, generated by the genomic pipeline. The method determines which data storage technique is most optimal to store each block of the file. In doing so, the method may consider the type of the file, the stage of the genomic pipeline that generated the file, the access frequency for blocks of the file, the most accessed blocks of the file, and the like. The method stores each block using the data storage technique determined to be most optimal after completion of a designated stage of the genomic pipeline, such that blocks of the file are stored using several different data storage techniques. A corresponding system and computer program product are also disclosed.

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 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: An embodiment of the invention may include a method, computer program product and system for optimizing data defragmentation. The embodiment may include collecting details related to contiguous storage space available on a disk drive. The embodiment may include identifying a type of object storage implementation utilized on the disk drive. The type of object storage implementation is based on how an object is stored within the disk drive. The embodiment may include identifying an important component of the object. The important component of the object is determined by a frequency of access. The embodiment may include identifying a non-important component of the object. The non-important component of the object is determined by a frequency of access. The embodiment may include moving the important component to an outer sector of the disk drive. The embodiment may include moving the non-important component to an inner sector of the disk drive.

Abstract: Systems for location selection based on erasure code techniques are provided. One system includes a monitor module that monitors data speed characteristics for one or more locations on a storage device. Additionally, the system includes a classification module that determines an erasure code technique for an application, wherein data associated with the application is stored on a storage device. Also, the system includes a selection module that selects a location in one or more locations for storing data based on monitored data speed characteristics and a determined erasure code technique.

Abstract: A computer-implemented method according to one embodiment includes identifying virtualization unit metadata for each of a plurality of nodes, the virtualization unit metadata including one or more guidelines for an application that is implemented by a virtualization unit, where the one or more guidelines include one or more benefits of a virtualization unit, one or more limitations of the virtualization unit, and one or more operating costs of the virtualization unit; determining, from the plurality of nodes, an optimal node for implementing a computation algorithm based on one or more required computation operations and the virtualization unit metadata for each of the plurality of nodes; and returning an identification of the optimal node.

Abstract: A microservice executing in a distributed computing system may receive a request to delete a target object stored in the distributed computing system. The microservice may identify dependent objects for the target object using information received in the request. The microservice may generate a new object that includes the data from the target object and the data from the one or more dependent objects. The new object may be stored in the distributed computing system, and the target object may be removed from the distributed computing system.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving a file operation, and determining a transaction identification which corresponds to the file operation. The transaction identification is used to create a unique queue which corresponds to the file operation. A number of fields included in the unique queue is equal to a number of sub-operations included in a predefined template associated with the file operation. Moreover, the number of fields included in the unique queue are populated as each of the respective number of sub-operations are performed. A determination is made as to whether each of the number of fields in the unique queue have been populated, and the unique queue is sent to a global queue in response to determining that each of the number of fields in the unique queue have been populated.

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 for managing an execution of a workload within a networked computing environment. The method includes at least one computer processor identifying a plurality of objects associated with a workload, the plurality of objects includes a first object. The method further includes identifying information corresponding to one or more one nodes that store an instance of the first object, where the information identifies features of a node. The method further includes identifying an embedded computing entity associated with processing at least the first object. The method further includes deploying an instance of the identified embedded computing entity to a first node that stores an instance of the first object based on information associated with features of the first node. The method further includes executing the workload utilizing the embedded computing entity.

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 proxy server for hybrid geo-dispersed erasure coding (EC). Responsive to receiving from an application server a request to write an object, the proxy server in a first storage site splits the object into a plurality of EC slices. The proxy server stores a first EC slice in a first storage device via a storage server local to the proxy server. The proxy server stores a plurality of remaining EC slices in a cache storage local to the proxy server. Responsive to determining that network access is available to disperse the plurality of slices among a plurality of geographically distributed storage sites, the proxy server copies the plurality of remaining EC slices to the plurality of geographically distributed storage sites using geo-dispersed erasure coding.

Abstract: A filesystem command is sent by a first processor, and for synchronization by a second processor. The filesystem command is directed to a second object of a second filesystem that is synchronized with a first object of a first filesystem. An expression is sent by the first processor to the second filesystem, and for authentication by the second processor. The expression is generated based on a third object of the first filesystems that is synchronized with a fourth object of the second filesystem.

Abstract: Embodiments for managing a wireless communication network by one or more processors are described. The presence of a plurality of mobile electronic devices within a wireless communication network is detected. A device-to-device (D2D) connectability score for each of the plurality of mobile electronic devices is calculated. The calculating of the D2D connectability score for each of the plurality of mobile electronic devices is based on a security posture of the respective mobile electronic device, a privacy posture of the respective mobile electronic device, or a combination thereof. A signal representative of the calculated D2D connectability score for each of the plurality of mobile electronic devices is generated.