International Business Machines Corporation

Harry R McGregor

Christopher B Moore

Itzhack Goldberg

Shaun E Harrington

Emmanuel Barajas Gonzalez

Neil Sondhi

Yossi Mesika

Shawn Patrick Mullen

Jose Roberto Mosqueda Mejia

Deborah A Messing

Gerhard H Pieper

Jonathan Amit

Oded Margalit

Olympia Gluck

Gary Anna

Emmanuel B Gonzalez

Michael Green

Tomer Goldberg

Shazad Naviwala

Charles B Theis

Dessa Simpson

Avi Liani

Moshe Kalish

Embodiments of the present disclosure include a computer-implemented method, a computer program product, and a system for storing data based, at least partially, on the deduplication rates of a storage system within a storage environment. The computer-implemented method includes receiving data to be stored in a storage environment, computing a hash for the received data, and querying storage deduplication agents for statuses of storage systems within the storage environment. The computer-implemented method also includes receiving deduplication rates and hash tables relating to the storage systems from the storage deduplication agents. The computer-implemented method further includes analyzing stored data stored on the storage systems using the deduplication rates and the hash tables and comparing the stored data to the received data. The computer-implemented method further includes allocating the received data to a storage system within the storage environment based on the comparison of the stored data to the received data.

Storage tiering for deduplicated storage environments

Embodiments for, in an object storage environment, managing data replication between first and second sites of a distributed computing environment by one or more processors. A first pass metadata hash is calculated for each of the objects in an object-set that is subsequently transferred from the first to the second site. Responsive to the second site, a second pass metadata hash is calculated for remaining objects of the object-set that are identified by the second site at a sub-object level using a predetermined size.

Advanced object replication using reduced metadata in object storage environments

Embodiments for, in a shared storage environment, managing data replication between first and second sites of a distributed computing environment by one or more processors. Metadata is pre-seeded from the first to the second site as an assembled metadata map. Data blocks corresponding to the pre-seeded metadata not currently stored at the second site are determined by the second site using the metadata map within a deduplication environment. A transfer request for the data blocks is returned by the second site to the first site.

Accelerated deduplication block replication

Embodiments for integration of social interactions in shared media by a processor. The social interactions are mapped in real time according to a predetermined preference. Duplicate ones of the social interactions are managed according to a data deduplication operation. The shared media is analyzed in view of the mapped social interactions to generate placement or duration display attributes for the social interactions such that the mapped social interactions and the shared media may be concurrently viewed on a particular display without obfuscating content of the shared media at a particular time.

Integration of social interactions into media sharing

In an approach to securing data using alternative value identification schemes, one or more computer processors receive user registration data, wherein the user registration data includes one or more authentication parameters, wherein the one or more authentication parameters includes one or more physical pressure-based inputs by a user. The one or more computer processors receive an access request requiring an authentication from the user, wherein the access request includes the one or more physical pressure-based inputs by the user associated with the one or more authentication parameters. The one or more computer processors determine whether the one or more authentication parameters match the user registration data. Responsive to determining that the authentication data matches the registration data, the one or more computer processors authenticate access for the user.

Pressure-based authentication

An embodiment of the invention may include a method, computer program product and computer system for optimizing course understanding. The method, computer program product and computer system may include a computing device to receive fueling location data and vehicle identification data of a vehicle from a radio frequency identification (RFID) transceiver from a plurality of fueling stations. The RFID transceiver may receive the vehicle identification data at the RFID transceiver from a cryptographic RFID transponder as part of the vehicle. The computing device may receive user authentication signals authorizing a plurality of fueling stations from an authorized user of the vehicle. The computing device may determine from the fueling location data, the vehicle identification data, and the user authentication signals one or more fueling patterns. The computing device may detect a fueling location deviating from the one or more fueling patterns send an alert to an authorized device.

Vehicle theft prevention based on fueling pattern

A method for defending a computing system against ransomware attacks is disclosed. In one embodiment, such a method includes identifying, on a computing system, files to be protected against ransomware attacks. The method appends a public key to each of the files. Upon receiving a request to modify a specific file, the method reads the public key appended to the file, requests an authentication token from a user, and computes a private key associated with the files. The method combines the public key, authentication token, and private key to generate an unlock key. This unlock key is compared to a validation key. The method authorizes modification of the file in the event the unlock key matches the validation key. A corresponding system and computer program product are also disclosed.

Proactive ransomware defense

Embodiments of the present invention provides methods, computer program products, and a system for improving serial performance of a computer system storage volume. Embodiments of the present invention can be used to reduce a partition scheme of a storage volume to allow for a computer system to read the storage volume using additional system resources that were previously idle during a serial read operation. Embodiments of the present invention can be used to reserve random-access memory (RAM) to store metadata describing data stored on a storage volume that utilizes a reduced partition scheme. Once the serial read of the storage volume is complete, the embodiments of the present invention can revert the partition scheme back to the original partition scheme for normal, non-serial read operations.

Increasing serial read performance

A technique for operating a data storage system includes generating information that identifies data that is currently stored in a write cache of the data storage system. The information is stored in a data structure associated with the data storage system. In response to a failure of the data storage system, the information in the data structure is accessed to identify the data that was lost in the failure.

Techniques for determining the extent of data loss as a result of a data storage system failure

Embodiments for, in a shared storage environment, managing data replication between first and second sites of a distributed computing environment by one or more processors. Based on an identified data block-set for replication, a unique metadata map is generated as a computed snapshot of the identified data block-set, the metadata map accounting for a predetermined block-size for transfer. The unique metadata map is transferred to the second site. The second site adds the unique metadata map to a global metadata repository.

Various embodiments for data management across a network by a processor. Data characteristics are analyzed through the network, incorporating an analysis of traffic and utilization of the data in the network, and inclusive of data operations resulting in at least a portion of the data reaching an endpoint in a network topology. Based on the analysis of the data characteristics, the portion of the data is pre-seeded forward to a location closer to the endpoint in the network topology than a previously stored location, such that when the portion of the data is requested through the endpoint, movement of the portion of the data to the endpoint encumbers fewer resources of the network.

Storage enhanced intelligent pre-seeding of information

A computer-implemented method, according to one embodiment, is for performing internal striping within a subset of slices. The computer-implemented method includes: receiving, by a computer, a logical unit; splitting, by the computer, the logical unit into a plurality of data chunks; and distributing, by the computer, the plurality of data chunks across the subset of slices such that the plurality of data chunks are striped across the subset of slices, and striped across a plurality of physical partitions in each of the subset of slices. Moreover, each of the subset of slices correspond to a different physical storage module in a single storage device. Other systems, methods, and computer program products are described in additional embodiments.

Internal striping inside a single device

Various embodiments for enhancing storage of deduplicated data in a computing storage environment. Analytics are applied to at least one data storage characteristic observed in the computing storage environment to restructure the deduplicated data in a more sequential manner so as to enhance performance of the computing storage environment. A type of storage device associated with the deduplicated data is monitored, and the analytics are withheld from application when the type of storage device is determined to be a solid-state device. The restructuring of the deduplicated data in the sequential manner is performed by comparing the at least one data storage characteristic against at least one predetermined thresholds, one of the at least one predetermined thresholds prohibiting a particular block of the deduplicated data from being restructured when the particular block of deduplicated data has been previously moved in the computing storage environment within a predefined timeframe.

Data restructuring of deduplicated data

Embodiments for, in an object storage environment, deduplicating data within and between distributed computing components by a processor. A deduplication operation is paired with metadata associated with a data object to determine data necessitating deduplication before the data object is transferred and written to a local node.

Growing community of inventors

Tucscon, AZ, United States of America

Harry R McGregor