Abstract: Data storage using application storage analytics that: (i) runs a set of application(s) that use a thin provision data storage device for data storage; (ii) determines a set of runtime behavior(s) of the set of applications(s) with respect to use of the thin provisioning data storage device for data storage; and (iii) calculates a runtime representation capacity based on a predetermined over-provisioning ratio and the set of runtime behavior(s).

Abstract: Service agreement performance validation includes receiving a request for access to an application from a client system. The application is hosted by a data center in a network-hosted computing environment. The service agreement performance validation also includes querying a global positioning system receiver for geographic location information of the data center, receiving the geographic location information from the global positioning system receiver, transmitting the geographic location information to the client system, and providing access to the application.

Abstract: A method for adjusting roles of nodes in a distributed clustered file system can include receiving a first computation operation and profiling the first computation operation according to one or more metrics. The method can also include determining, based on the profiling of the first computation operation, a first file system attribute of the first computation operation. The method can also include identifying that the first computation operation serves a first file system role and identifying a first hardware characteristic of hardware on which a first node of a plurality of nodes is hosted. The method can also include receiving an identification that the first node can utilize additional computation of the first file system role and instantiating a virtualization unit on the first node.

Abstract: A request to monitor a data packet to be transmitted from a first location to a second location over a first network is received. A projected time for the transmission of the data packet from the first location to the second location is determined. Responsive to determining the projected time, whether the data packet arrived at the second location after the projected time plus a variance is determined.

Abstract: A method, computer system, and computer program product for managing copies of data objects in a network data processing system. The computer system identifies copies of a data object stored on storage devices. The computer system places the storage devices into groups. Each storage device in a group has a smallest distance from the storage device to a center location for the group as compared to distances to center locations for other groups within the groups. The computer system selects a portion of the copies of the data object for removal from the storage devices based on a management of power for the storage devices such that remaining set of storage devices in each group is capable of handling concurrent requests that have been made historically for the copies of the data object. The computer system removes the portion of the copies of the data object from the storage devices.

Abstract: A mechanism is provided in a data processing system for data replication. The mechanism divides a set of data to be replicated into a plurality of slices. Each slice of the plurality of slices is to be copied from a primary site to a master secondary site within a plurality of secondary sites. The plurality of secondary sites comprises the master secondary site and at least one subsidiary peer site. The mechanism copies the plurality of slices from the primary site to the plurality of secondary sites such that the master secondary site stores a first slice of the set of data and each of the at least one subsidiary peer site stores a corresponding slice of the set of data. Responsive to completion of copying the plurality of slices to the plurality of secondary sites, for each of the at least one subsidiary peer site, the mechanism initiates copying of the corresponding slice of the set of data to the master secondary site.

Abstract: A computer determines a degree of information duplication between at least two files included in an original pre-fetch list. The computer generates a re-ordered pre-fetch list by re-ordering the files included in the original pre-fetch list. The re-ordering is based, at least in part, on the degree of information duplication between the two files included in the original pre-fetch list. The files included in the original pre-fetch list are re-ordered by grouping files containing higher degrees of duplicate information closer together in the re-ordered pre-fetch list.

Abstract: Embodiments of the present invention provide a method and system for dynamically controlling an appliance based on information received from a wearable device, to regulate the user's health. A wearable device is identified and configured to monitor at least one physiological aspect of the user. A controllable appliance with at least one sensor and at least one controllable setting is also identified. Health information of the user is received and utilized in generating, a user profile which comprises parameters related to the health of the user. Data from the wearable device and data from the controllable appliance is analyzed and it is determined whether the data matches the parameters related to the health of the user. If the data does not match the parameters related to the health of the user, then at least one controllable setting of the at least one controllable appliance is adjusted.

Abstract: A mechanism is provided in a data processing system for replicating writing of a file with striping. The mechanism writes a file at an owner node within a plurality of nodes in a data processing system. The mechanism divides the file into a plurality of file chunks. The mechanism identifies at least one replication node within the plurality of nodes having a duplicate copy of a respective file chunk within the plurality of file chunks. The mechanism selects a plurality of replication nodes for the plurality of file chunks based on identification at least one replication node within the plurality of nodes having a duplicate copy of a respective file chunk and replicates the file at the plurality of replication nodes based on the selection of the plurality of replication nodes.

Abstract: The present invention relates to a method, system, and computer program product for determining storage device weight values to use to select one of the storage devices to use as a target storage to which data from a source storage is migrated. A determination is made, for each of the storage devices, of static parameter values for static parameters comprising attributes of the storage device and dynamic parameter values for dynamic parameters providing device health information determined by accessing the storage device to determine operational conditions at the storage device. Storage device weight values are determined as a function of the static parameter values and the dynamic parameter values of the device. The determined storage device weight values are used to select one of the storage devices as the target storage to which data from the source storage is migrated.

Abstract: Data storage using application storage analytics that: (i) runs a set of application(s) that use a thin provision data storage device for data storage; (ii) determines a set of runtime behavior(s) of the set of applications(s) with respect to use of the thin provisioning data storage device for data storage; and (iii) calculates a runtime representation capacity based on a predetermined over-provisioning ratio and the set of runtime behavior(s).

Abstract: Embodiments of the disclosure can include a method, system, and computer program product for using a secure delete operation within one or more storage devices using a parity-based storage scheme. The method can include receiving the location of an application block that includes one or more data blocks and one or more parity blocks stored within the one or more storage devices using the parity-based storage scheme. The method can also include determining a number of parity blocks to delete, wherein the number of parity blocks to delete is less than the total number of parity blocks. The method can also include performing a secure delete operation on the determined number of parity blocks. The method can also include performing a secure delete operation on the one or more data blocks.

Abstract: For autonomous data evacuation, a storage device is motivated by a propulsion device. A navigation module guides the storage device to a disaster recovery target using the propulsion device in response to an evacuation signal. At least a portion of the navigation module comprises one or more of hardware and executable code, the executable code stored on one or more computer readable storage media.

Abstract: Embodiments of the present invention may relate generally to the field of computing, and more particularly to estimating an answering time by a user of a communication on a communication device. A user may receive a communication on a first communication device from a second communication device. A distance of the user from the first communication device may be determined. A time may be estimated for the user to reach the first communication device based on the distance determination. The time estimation may be communicated to the second communication device.

Abstract: Service agreement performance validation includes receiving a request for access to an application from a client system. The application is hosted by a data center in a network-hosted computing environment. The service agreement performance validation also includes querying a global positioning system receiver for geographic location information of the data center, receiving the geographic location information from the global positioning system receiver, transmitting the geographic location information to the client system, and providing access to the application.

Abstract: Provided are a computer program product, system, and method for allocating network bandwidth to prefetch requests to prefetch data from a remote storage to cache in a local storage. A determination is made of access rates for applications accessing a plurality of files, wherein the access rate is based on a rate of application access of the file over a period of time. A determination is made of an access rate weight for each of the files based on the access rates of the plurality of files. The determined access rate weight for each of the files is used to determine network bandwidth to assign to access the files from the remote storage to store in the local storage.

Abstract: An approach is provided for protecting data owned by an operating system on a mobile computing device having multiple operating systems. A map specifying protected data regions for the operating systems is generated. The map is secured with a shared key retrieved from a data structure. Based on the shared key, a tuple specifying the data region is retrieved from the data structure. Based on the map, the shared key, and the tuple, and responsive to a data cleanup activity being performed by a software utility being executed on another, currently running operating system included in the multiple operating systems, a data region included in the protected data regions is determined to be owned by the operating system. Based on the data region being owned by the operating system and specified by the map, the data cleanup activity is blocked from being performed on the data region.

Abstract: According to one exemplary embodiment, a method for automatic network reconfiguration associated with a failover event is provided. The method may include instructing a file system to capture a plurality of attributes associated with a plurality of data following the failover event, whereby the plurality of attributes comprises a fileset identifier, a first gateway node identifier, and a second gateway node identifier. The method may include determining, based on the captured fileset identifier, a virtual local area network associated with the fileset, whereby the determined virtual area network includes at least one software defined network switch. The method may include reconfiguring the at least one software defined network switch to stop sending a plurality of network traffic to the first gateway node and to start sending the plurality of network traffic to the second gateway node, whereby the plurality of network traffic is associated with the fileset.

Abstract: A mechanism is provided for enabling separation of compute infrastructure built within a geographically located storage device. A determination is made as to whether a compute request originates from a geographical location that is the same as a geographical location of the geographically located storage device. Responsive to the compute request originating from a geographical location different from the geographical location of the geographically located storage device, a determination is made as to whether the compute request complies with governing requirements that govern the geographically located storage device. Responsive to the compute request complying with the requirements that govern the geographically located storage device, a determination is made as to whether the compute request is for data retrieval only. Responsive to the compute request being for data retrieval only, the requested data is gathered from data storage of the geographically located storage device and sent to a requesting client.

Abstract: A mechanism is provided for optimizing and enhancing performance for parity based storage, particularly redundant array of independent disk (RAID) storage. The mechanism optimizes a repetitive pattern write command for performance for storage configurations that require parity calculations. The mechanism eliminates the need for laborious parity calculations that are resource intensive and add to IO latency. For repetitive write commands that span across the full stripe of a RAID5 or similar volume, the mechanism calculates parity by looking at the pattern and the number of columns in the volume. The mechanism may avoid the XOR operation altogether for repetitive pattern write commands. The mechanism may enhance secure delete operations that use repetitive pattern write commands by eliminating data reliability operations like parity generation and writing altogether.