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: The first computer receives a signal that a second computer is back online after being offline, wherein the second computer was offline because of a failure. The first computer takes a first snapshot of the storage, wherein data that has a higher access frequency is stored on a first drive and data that has a lower access frequency is stored on a second drive. The first computer determines a snapshot difference between the first snapshot and a second snapshot. The first computer transmits the snapshot difference to the second computer, and transmits the data stored on the first drive to the second computer. The first computer promotes the data stored on the second drive to be considered equivalent to data stored drive and transmits the promoted data stored on the second drive to the second computer at the same transmission rate as the data stored on the first drive.

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: The first computer receives a signal that a second computer is back online after being offline, wherein the second computer was offline because of a failure. The first computer takes a first snapshot of the storage, wherein data that has a higher access frequency is stored on a first drive and data that has a lower access frequency is stored on a second drive. The first computer determines a snapshot difference between the first snapshot and a second snapshot. The first computer transmits the snapshot difference to the second computer, and transmits the data stored on the first drive to the second computer. The first computer promotes the data stored on the second drive to be considered equivalent to data stored drive and transmits the promoted data stored on the second drive to the second computer at the same transmission rate as the data stored on the first drive.

Abstract: In an approach for determining printability of an electronic file, a computer electronically receives a file for printing. The computer parses the file for one or more of text, images, and formatting indicative of potential copyrighted material. The computer, in response to identifying any text, images, or formatting indicative of potential copyrighted material, identifies potential copyrighted material within the file. The computer determines whether the file may be printed based, at least in part, on the identified potential copyrighted material. In another approach for determining printability of an electronic document, a computer electronically receives a document for printing. The computer locates attributes associated with the document and stored in a separate database, which includes one or more of the following: ownership, licensing information, printability, and number of prints allowed. The computer determines the document is printable based on the attributes and prints the document.

Abstract: The first computer receives a signal that a second computer is back online after being offline, wherein the second computer was offline because of a failure. The first computer takes a first snapshot of the storage, wherein data that has a higher access frequency is stored on a first drive and data that has a lower access frequency is stored on a second drive. The first computer determines a snapshot difference between the first snapshot and a second snapshot. The first computer transmits the snapshot difference to the second computer, and transmits the data stored on the first drive to the second computer. The first computer promotes the data stored on the second drive to be considered equivalent to data stored drive and transmits the promoted data stored on the second drive to the second computer at the same transmission rate as the data stored on the first drive.

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: In an approach for determining printability of an electronic file, a computer electronically receives a file for printing. The computer parses the file for one or more of text, images, and formatting indicative of potential copyrighted material. The computer, in response to identifying any text, images, or formatting indicative of potential copyrighted material, identifies potential copyrighted material within the file. The computer determines whether the file may be printed based, at least in part, on the identified potential copyrighted material. In another approach for determining printability of an electronic document, a computer electronically receives a document for printing. The computer locates attributes associated with the document and stored in a separate database, which includes one or more of the following: ownership, licensing information, printability, and number of prints allowed. The computer determines the document is printable based on the attributes and prints the document.

Abstract: Methods, systems, and computer program products are provided for performing a secure delete operation in a wide area network (WAN) including a cache site and a home site. A method includes identifying a file for deletion at the cache site, determining whether the file has a copy stored at the home site, detecting a location of the copy at the home site prior to a disconnection event of the cache site from the home site, deleting the file from the cache site during the disconnection event, and in response to the secure deletion of the file not being complete during the disconnection event, indicating on a table a remote inode number assigned to the copy associated with the file at the home site, a name under which the copy is saved, and a list of data chunk tuples specifying selected data of the copy to undergo secure deletion.

Abstract: According to one exemplary embodiment, a method for embedded compute engine architecture optimization is provided. The method may include receiving an object. The method may also include determining a first category for the received object, whereby the determined first category is associated with a node. The method may then include storing the received object on the node associated with the determined first category. The method may further include receiving an algorithm. The method may also include determining a second category for the received algorithm, whereby the determined second category is associated with the node. The method may then include executing the received algorithm on the node, whereby the received algorithm uses the received object stored on the node.

Abstract: Methods, systems, and computer program products are provided for performing a secure delete operation in a wide area network (WAN) including a cache site and a home site. A method includes identifying a file for deletion at the cache site, determining whether the file has a copy stored at the home site, detecting a location of the copy at the home site prior to a disconnection event of the cache site from the home site, deleting the file from the cache site during the disconnection event, and in response to the secure deletion of the file not being complete during the disconnection event, indicating on a table a remote inode number assigned to the copy associated with the file at the home site, a name under which the copy is saved, and a list of data chunk tuples specifying selected data of the copy to undergo secure deletion.

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 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 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: A method for adjusting roles of nodes in a distributed clustered file system can include receiving a first computation operation. The method can also include profiling the first computation operation according to one or more metrics, including identifying and categorizing a first process performed by the first computation operation. The method can also include determining a first file system attribute of the first computation operation. The method can also include performing a lookup operation based on a first computation operation template and identifying that the first computation operation serves a first file system role. The method can also include receiving an identification, in response to the performing the lookup, that a first node of a plurality of nodes can utilize additional computation of the first file system role. The method can also include executing the first computation operation on the first node.

Abstract: A method for optimizing duplication of disk sector architecture in a heterogeneous cloud systems environment, is provided. The method includes identifying a file system platform and name space for tracking a plurality of disk, of the disk sector architecture. The method further includes configuring a systems framework, of the identified file system platform, for collecting information of the plurality of disk assigned to the file systems platform. The method further includes equipping the file system platform and a monitoring system with learning or knowledge based engines to identify workload types for utilizing the file system platform and the named space to identify health of multiple platters of the plurality of disk assigned to the file systems platform. The method further includes calculating duplication data of sectors of the plurality of disks of the identified workload types, based on the sectors of disks.

Abstract: A method for adjusting roles of nodes in a distributed clustered file system can include receiving a first computation operation. The method can also include profiling the first computation operation according to one or more metrics, including identifying and categorizing a first process performed by the first computation operation. The method can also include determining a first file system attribute of the first computation operation. The method can also include performing a lookup operation based on a first computation operation template and identifying that the first computation operation serves a first file system role. The method can also include receiving an identification, in response to the performing the lookup, that a first node of a plurality of nodes can utilize additional computation of the first file system role. The method can also include executing the first computation operation on the first node.