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: 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 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 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: 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: A computer-implemented method according to one embodiment includes determining a classification associated with an instance of data, determining a vulnerability level of a first storage system at which the instance of data is currently located, and conditionally migrating the instance of data from the first storage system to a second storage system, based on the classification associated with the instance of data and the vulnerability level of the first storage system.

Abstract: The present invention provides a computer implemented method, system, and computer program product of assigning pools of internet protocols to file access protocols for network-attached storage (NAS) failover. In an exemplary embodiment, the present invention includes generating, by a computer system, a pool of internet protocol addresses for each of a plurality of computer file access protocols running on a plurality of protocol node computer systems, where the protocol nodes are configured to access a plurality of computer files stored on a NAS system via computer file access protocol services corresponding to the file access protocols, resulting in IP pools comprising IP addresses, and for each IP pool, among the IP pools, corresponding to a file access protocol among the file access protocols, assigning, by the computer system, the IP addresses in the IP pool to protocol nodes, among the protocol nodes, for which the file access protocol is operational.

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: 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: A method and system for determining implementing a bidding based product delivery determination process is provided. The method includes presenting a product for purchase via a bidding process. Packages including the product are pre-loaded on delivery vehicles for delivery within geographical zones including maximum travel distances. Monetary bids for the product are received from users with respect to the delivery vehicles and a user submitting a highest monetary bid is identified. In response, a first delivery vehicle is directed to a location of the user. A profit sharing process with respect to the users and an entity providing the product is enabled.

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