International Business Machines Corporation

Skhynix Inc.

Globalfoundries Inc.

Intellectual Business Machines Corporation

Robert Haas

Evangelos Stavros Eleftheriou

Roman Alexander Pletka

Ioannis Koltsidas

Xiao-Yu Hu

Lokesh M Gupta

Michael T Benhase

Ilias Iliadis

Xiao-yu Hu

Stephen LaRoux Blinick

Matthew J Kalos

Xiaoyu Hu

Nils Haustein

Roy Daron Cideciyan

Karl Allen Nielsen

Peter Mueller

Patrick Droz

Werner K Bux

Xiao Y Hu

Daniel James Winarski

Craig Anthony Klein

Ulf Troppens

Slavisa Sarafijanovic

Christian Cachin

Harald Seipp

Kevin J Ash

Nikolas Ioannou

Jens Jelitto

Adrian Cuenin Gerhard

Robert Edward Galbraith

Yu-Cheng Hsu

Michael Charles Osborne

Thomas D Weigold

James Steven Luke

John Arthur Ricketts

Murali N Iyer

Laurent Frelechoux

Steven Paul Norgaard

Timothy James Larson

John W Bell

Alexander Saupp

Charalampos Pozidis

Thomas Mittelholzer

Andrew Dale Walls

Michael Edward Factor

Robert Beverley Basham

Ajay Dholakia

Thomas P Parnell

Joseph S Hyde, Ii

Lawrence Yiumchee Chiu

Paul Henri Muench

Timothy James Hahn

Alessandro Sorniotti

Andreas Kind

William W Owen

Alfred Emilio Sanchez

Vinodh Venkatesan

Simon Lorenz

Dung B Nguyen

John Thomas Peck

Theodore Antonakopoulos

Anil Kurmus

Rene Pawlitzek

René A Pawlitzek

Ceki Gulcu

Ilias Iliadas

Xiaoyu-Yu Hu

Marko Vukolic

Rene A Pawlitzek

Alexis Hafner

The invention relates to a storage system comprising one or more storage controllers, two or more storage devices and two or more storage clients, the storage controllers, the storage devices and the storage clients being coupled via a network in order to exchange information between the storage controllers, said storage devices and said storage clients, wherein each storage client is adapted to provide data-path-storage commands to the storage devices via the network bypassing the storage controllers, wherein the storage system is adapted to provide data redundancy using a data redundancy scheme higher than RAID 1.

Storage array comprising a host-offloaded storage function

Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation.

Selective space reclamation of data storage memory employing heat and relocation metrics

An object-based data storage system includes a memory and a processor for executing machine executable instructions configured for implementing logical containers for data objects each having a global identifier. The containers are configured for storing metadata including a first parameterization value descriptive of a number of storage nodes and a second parameterization value descriptive of a classification of the data objects. The machine executable instructions are further configured for implementing a first object storage ring for addressing storage locations across the multiple storage nodes using a surjective function. Execution of the instructions causes the processor to: instantiate the first object storage ring, receive the global identifier and the metadata by the first object storage ring, and generate a storage address by the first object storage ring for the data object using the global identifier, the first parameterization value and the second parameterization value as input to the surjective function.

Data object storage across multiple storage nodes

A computing device may determine that a policy event to initiate data destruction for a first set of data has been triggered. The first set of data may be located on a first file. The computing device may delete, in response to the determining, a first security key used for decrypting the first set of data. The computing device may delete, in response to the determining, one or more transaction log entries associated with the first set of data. The one or more transaction log entries may include a copy of the first set of data. The one or more transaction log entries may be a part of a transaction log. The transaction log may be a second file that stores a history of each data change within the database.

Verifiable data destruction in a database

The population of data to be admitted into secondary data storage cache of a data storage system is controlled by determining heat metrics of data of the data storage system. If candidate data is submitted for admission into the secondary cache, data is selected to tentatively be evicted from the secondary cache; candidate data provided to the secondary data storage cache is rejected if its heat metric is less than the heat metric of the tentatively evicted data; and candidate data submitted for admission to the secondary data storage cache is admitted if its heat metric is equal to or greater than the heat metric of the tentatively evicted data.

Selective population of secondary cache employing heat metrics

In one embodiment, a method of managing data includes storing a first copy of data in a solid state memory using a controller of the solid state memory, and storing a second copy of the data in a hard disk drive memory using the controller. Write requests are served substantially simultaneously at both the solid state memory and the hard disk drive memory under control of the controller. In another embodiment, a system for storing data includes a solid state memory, at least one hard disk drive memory, and a controller for controlling storage of data in both the solid state memory and the hard disk drive memory. Other methods, systems, and computer program products are also described according to various embodiments.

Reliability scheme using hybrid SSD/HDD replication with log structured management

A tape drive system server includes a non-volatile memory used as a cache memory for storing data files, at least part of the cache memory comprising a first region managed using a First In First Out policy management and a second region managed using a Least Recently Used policy management; a file system interface for interacting with data files stored on a tape drive system; an interface for allowing one or more remote systems reading and writing data stored on the cache memory; the server configured to: receive from the one or more remote systems one or more write requests for writing one or more data files; interpret attributes associated to data files instructed to be written by the one or more remote systems; and store data files instructed to be written by the remote systems according to the interpreted attributes.

Tape drive system server

An I/O enclosure module is provided with one or more I/O enclosures having a plurality of slots for receiving electronic devices. A host adapter is connected a first slot of the I/O enclosure module and is configured to connect a host to the I/O enclosure. A device adapter is connected to a second slot of the I/O enclosure module and is configured to connect a storage device to the I/O enclosure module. A flash cache is connected to a third slot of the I/O enclosure module and includes a flash-based memory configured to cache data associated with data requests handled through the I/O enclosure module. A primary processor complex manages data requests handled through the I/O enclosure module by communicating with the host adapter, device adapter, and flash cache to manage to the data requests.

Integrating a flash cache into large storage systems

A memory management system and method for managing memory blocks of a memory device of a computer. The system includes a free block data structure including free memory blocks for writing, and sorting the free memory blocks in a predetermined order based on block write-erase endurance cycle count and receiving new user-write requests to update existing data and relocation write requests to relocate existing data separately, a user-write block pool for receiving youngest blocks holding user-write data (i.e., any page being updated frequently) from the free block data structure, a relocation block pool for receiving oldest blocks holding relocation data (i.e., any page being updated infrequently) from the free block data structure, and a garbage collection pool structure for selecting at least one of user-write blocks and relocation blocks for garbage collection, wherein the selected block is moved back to the free block data structure upon being relocated and erased.

Write-erase endurance lifetime of memory storage devices

A mechanism is provided for coordinated garbage collection in an array controller of a two-level hierarchical log structured array architecture for a non-volatile memory array. The two-level hierarchical log structured array (LSA) architecture comprises an array-level LSA in the array controller and a node-level LSA in each node of the non-volatile memory array. The array controller writes logical pages of data to containers in memory of the array-level storage controller at node logical block addresses in an array-level LSA. The array-level LSA maps the host logical block addresses to node logical block addresses in a node-level LSA in a plurality of nodes. Responsive to initiating array-level garbage collection in the array controller, the mechanism identifies a first container to reclaim according to a predetermined garbage collection policy. Responsive to determining the first container has at least a first valid logical page of data, the mechanism moves the first valid logical page of data to a location assigned to the same node in a target container in the memory of the array-level storage controller, remaps the first valid logical page of data in a corresponding node, and reclaims the first container.

Two-level hierarchical log structured array architecture with minimized write amplification

Embodiments include methods, computer systems and computer program products for selecting a new redundancy scheme for data relocation in computer system having multiple data storage tiers and multiple redundancy schemes. Aspects include: receiving, at a processor of computer system, a request to relocate a data object to a destination data storage tier, retrieving a first and a second data reliability thresholds, redundancy scheme and data access pattern information of the data object, generating a set of available redundancy schemes for the data object with at least one copy on the destination data storage tier, calculating total cost for each of available redundancy schemes using performance cost, re-encoding cost, and storage cost for each of available redundancy schemes generated, selecting a redundancy scheme, and relocating data object to selected destination data storage tier by re-encoding the data object using the selected redundancy scheme.

Methods and computer program products of selecting a new redundancy scheme for data relocation

It is provided a method for decoding a sequence of bits encoded by a LPDC code. The method comprises providing a set of bit states, including a first state and a second state, and a set of conditions to change a bit state including a first condition 5 and a second condition. The first condition and the second condition are different. The method comprises reading the value of each bit of the sequence, associating each bit to a respective state of the set according to the values as read, determining that an evaluated condition is met and changing the state of the target bit as a result of the condition being met. The method may then set the value of the target bit of the 10 sequence according to the state thereof. Such a method provides a solution for decoding a sequence of bits encoded by a LDPC code with better performance than the classic bit-flipping algorithm with only a slight increase in complexity.

Decoding of LDPC code

Growing community of inventors

Adliswil, Switzerland

Robert Haas