Abstract: A system and method dynamically transitions the file system role of compute nodes in a distributed clustered file system for an object that includes an embedded compute engine (a storlet). Embodiments of the invention overcome prior art problems of a storlet in a distributed storage system with a storlet engine having a dynamic role module which dynamically assigns or changes a file system role served by the node to a role which is more optimally suited for a computation operation in the storlet. The role assignment is made based on a classification of the computation operation and the appropriate filesystem role that matches computation operation. For example, a role could be assigned which helps reduce storage needs, communication resources, etc.

Abstract: A computer-implemented method, according to one embodiment, includes: selecting two previously captured snapshots and calculating a checksum for each file in each of the two snapshots. The checksums are used to determine whether the two snapshots are sufficiently similar to each other. In response to determining that the two snapshots are sufficiently similar to each other, important ones of the files in each of the two snapshots are identified. The identified important files which are located in a lower performance tier of a multi-tier data storage system are transitioned to a higher performance tier of the multi-tier data storage system. Moreover, a merged snapshot is created by merging the two snapshots, and the merged snapshot is provided for additional operations. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: Methods and systems for an enhanced restripe mechanism are provided. A system for an enhanced restriping mechanism includes a data storage module that stripes data across a plurality of storage devices, wherein the plurality of storage devices are arranged into a plurality of storage pools and the data is distributed across the plurality of storage pools. Also, the system may include a movement detection module that detects changes in the arrangement of the plurality of storage devices that would cause the data on a storage device in the plurality of storage devices to be moved onto other storage devices in the plurality of storage devices. Further, the system may include a restriping module that restripes disk data from the storage device in the plurality of storage devices onto the other storage devices in response to the detected change based on access characteristics of the data.

Abstract: A computer-implemented method, according to one embodiment, includes: identifying block addresses which are associated with a given object, and combining the 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 is transitioned to a second set, where the first portion includes ones of the block addresses determined as having a token currently issued thereon. Moreover, a second portion of the block addresses is divided into equal chunks, where the second portion includes the block addresses remaining in the first set. The chunks in the first set are allocated across two or more parallelization units. Furthermore, the block addresses in the second set are divided into equal chunks, and the chunks in the second set are allocated to at least one dedicated parallelization unit.

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: capturing a snapshot of data stored at a primary storage location, and determining a transaction identification which corresponds to each file operation included in the snapshot, where each file operation includes a respective number of sub-operations. Data included in the snapshot which corresponds to completed ones of the sub-operations is identified, and the determined transaction identifications as well as the identified data is used to populate entries in a data structure. The snapshot is sent to a secondary storage location, and an acknowledgement is received from the secondary storage location for each of the completed sub-operations that are successfully performed at the secondary storage location. Furthermore, the data structure is updated based on the received acknowledgements.

Abstract: Methods and systems for an enhanced restripe mechanism are provided. A system for an enhanced restriping mechanism includes a data storage module that stripes data across a plurality of storage devices, wherein the plurality of storage devices are arranged into a plurality of storage pools and the data is distributed across the plurality of storage pools. Also, the system may include a movement detection module that detects changes in the arrangement of the plurality of storage devices that would cause the data on a storage device in the plurality of storage devices to be moved onto other storage devices in the plurality of storage devices. Further, the system may include a restriping module that restripes disk data from the storage device in the plurality of storage devices onto the other storage devices in response to the detected change based on access characteristics of the data.

Abstract: An embodiment of the invention may include a method, computer program product and system for optimizing a wide area network caching infrastructure in a file based object storage architecture. The embodiment may include creating, by a parent partition, a heat map. The embodiment may include prioritizing prefetching by multiple dependent partitions based on the heat map. In response to prioritized prefetching by the multiple dependent partitions, the embodiment may include allocating wide area network caching threads. The embodiment may include providing, by the parent partition, objects for prefetching by the multiple dependent partitions utilizing the allocated wide area network caching threads.

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 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 method, computer system, and a computer program product for dynamic IO throttling in a storlet environment is provided. The present invention may include receiving, from a user, a computational algorithm. The present invention may also include deploying the received computational algorithm. The present invention may then include determining the user has not engaged throttling based on the deployed computational algorithm. The present invention may further include parsing the computational algorithm based on the engaged throttling. The present invention may include identifying a pipeline operation based on the parsed computational algorithm. The present invention may also include building a timing relation between the identified pipeline operation and an IO operation. The present invention may then include translating a timing lag to a storage IO operation based on the built timing relation.

Abstract: A cognitive psychology authentication in a multi-factor authentication system. A request is received to access a secure resource associated with a user. A set of cognitive psychology questions are selected from a plurality of cognitive psychology questions for transmission to a client device associated with the request. A set of responses corresponding to the set of cognitive psychology questions are received and cognitive psychology data is generated based on the set of responses. A cognitive psychology profile associated with the user is retrieved from a database. An authentication score is calculated based on comparing the cognitive psychology data to the cognitive psychology profile. An authentication success notification is transmitted when the authentication score compares favorably to an authentication threshold. An authentication failure notification is transmitted when the authentication score compares unfavorably to the authentication threshold.

Abstract: Methods that can provide multi-layered data security in mobile personal computing devices are provided. One method includes assigning, by a processor, one of a plurality of security levels to applications of a mobile personal computing device, assigning one of the plurality of security levels to storage partitions of a storage device of the mobile personal computing device, and providing the applications access to data stored on the storage partitions based on a nexus of a first assigned security level for each application and a second assigned security level for each storage partition. Systems and apparatus that can include, perform, and/or implement the methods are also provided.

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: Embodiments for managing photographic capture by one or more processors are described. An image is received. The image includes at least one individual and is associated with a location. A signal indicative of a recommendation with respect to a posture of the at least one individual in the image is generated based on information associated with the at least one individual, the location, or a combination thereof.

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