Virident Systems, Inc.

Western Digital Technologies, Inc.

Microsoft Technology Licensing, LLC

Hgst Netherlands, B.v.

Sandisk Technologies Inc.

Ashish Singhai

Vijay Karamcheti

Kenneth Alan Okin

Ashwin Narasimha

Kumar Ganapathy

Rajesh Parekh

Shibabrata Mondal

Ajith Kumar

Sandeep Sharma

Krishanth Skandakumaran

Ajith Kumar Battaje

Saurabh Manchanda

Swamy Gowda

Tanay Goel

George Moussa

Rajendra Prasad Mishra

Sriram Rupanagunta

Srikant Sadasivam

Ming Xia

Xun Yin

Kiran Shivanagoudar

Muthugopalkrishnan Adiseshan

Viswesh Sankaran

Sivabalan Narayanan

Systems and methods for increasing the endurance of a solid state drive are disclosed. The disclosed systems and methods can assign different levels of error protection to a plurality of blocks of the solid state drive. The disclosed methods can provide a plurality of error correction mechanisms, each having a plurality of corresponding error correction levels and associate a first plurality of blocks of the solid state drive with a first zone and a second plurality of blocks of the solid state drive with a second zone. The disclosed methods can assign a first error correction mechanism and a first corresponding error correction level to the first zone and can assign a second error correction mechanism and a second corresponding error correction level to the second zone.

Systems and methods for allocating blocks of memory to multiple zones associated with corresponding error correction mechanisms

By way of example, a data storage system may comprise, a non-transitory storage device storing data blocks in chunks, and a storage logic coupled to the non-transitory storage device that manages storage of data on the storage device. The storage logic is executable to receive a data stream for storage in a non-transitory storage device, the data stream including one or more data blocks, analyze the data stream to determine a domain, retrieve a pre-configured reference set based on the domain, and deduplicate the one or more data blocks of the data stream using the pre-configured reference set.

Reference set construction for data deduplication

The present disclosure relates to methods and systems for implementing redundancy in memory controllers. The disclosed systems and methods utilize a row of memory blocks, such that each memory block in the row is associated with an independent media unit. Failures of the media units are not correlated, and therefore, a failure in one unit does not affect the data stored in the other units. Parity information associated with the data stored in the memory blocks is stored in a separate memory block. If the data in a single memory block has been corrupted, the data stored in the remaining memory blocks and the parity information is used to retrieve the corrupted data.

Methods and systems for implementing redundancy in memory controllers

Systems and methods for multi-zone data tiering for endurance extension in solid state drives

A system and method for efficiently managing data through compression interfaces may include receiving, by a controller, data, generating, by the controller, a compressed payload based on the data, generating, by the controller, metadata describing the compressed payload, the metadata including fixed size metadata and variable size metadata, generating, by the controller, a data container comprising the uncompressed payload and the metadata, and transmitting, by the controller, the data container to an application. Some implementations of the system may include a storage media, and a storage controller executable by a processor that may include an interface processor, a controller logic, and a media processor configured to communicate with an application and the storage media to perform aspects of the method.

Efficient data management through compressed data interfaces

Various aspects for data deduplication in a storage system are provided. For instance, a storage controller may perform operations including receiving a data chunk including a set of data blocks, determining a signature for the data chunk, and comparing the signature and a set of reference signatures to determine a match. Responsive to a match, the operations may further include identifying a reference data chunk including a set of comparison blocks associated with the matched reference signature, performing a deduplication technique on the set of data blocks based on the set of comparison blocks, and identifying a subsequent reference data chunk for an estimated next data chunk based on identification of the reference data chunk and prior to receipt of the next data chunk.

Efficient data deduplication leveraging sequential chunks or auxiliary databases

A data storage system comprises, a storage device having segments that are configured to store data, and storage logic coupled to the storage device that manages storage of data on the storage device using a translation table. The storage logic is executable to receive a first marker as part of a backup request, generate a second marker encapsulating a state of the storage device at a second time, calculate a difference between the first marker and the second marker, and generate a backup of data stored in the storage device based on the calculated difference between the first marker and the second marker. A garbage collection (GC) barrier may be set based on serial numbers associated with backup segments, and the garbage collection barrier may be incrementally released by releasing the garbage collection barrier for each segment after the segment has been backed up. The storage logic may also record the deletion of a storage unit from the storage device in a deletion table, and retire deleted storage mappings in the deletion table responsive to generating the backup.

Indirection-based storage system backups using markers including sets of serial numbers associated with segments

The disclosed embodiments provide a system for monitoring resource usage statistics. During operation, the system obtains a set of expiration times associated with usage of the resource. Next, the system selects a first limit to a number of time slots for use in calculating usage statistics for the resource based on a memory efficiency associated with calculating the usage statistics for the resource. The system then populates, up to the first limit, a set of time slots after a current time with the expiration times. When a time slot in the set of time slots includes the current time, the system uses a subset of the expiration times in the time slot to update one or more usage statistics for the resource. Finally, the system outputs the one or more usage statistics for use in managing the usage of the resource.

Tunable, efficient monitoring of capacity usage in distributed storage systems

A system comprising a processor and a memory storing instructions that, when executed, cause the system to determine a first value of a first checkpoint associated with a first snapshot, receive a second value of a second checkpoint associated with a translation table entry from an additional source, determine whether the second value of the second checkpoint is after the first value of the first checkpoint, in response to determining that the second value of the second checkpoint is after the first value of the first checkpoint, retrieve the translation table entry associated with the second checkpoint from the additional source, and reconstruct the translation table using the translation table entry associated with the second checkpoint.

Checkpoint based technique for bootstrapping forward map under constrained memory for flash devices

A method for implementing cross device redundancy schemes with a single commit by receiving, by a write page allocation unit, a request to allocate data grains; responsive to receiving the request, performing, by the write page allocation unit, an analysis of a predetermined data layout map associated with a grain memory to identify a memory segment; allocating, by the write page allocation unit, a number of data grains to the memory segment, while computing redundancy data associated with the number of data grains; storing the number of data grains and the redundancy data to the memory segment of the grain memory; determining, by the write page allocation unit, whether a storage threshold associated with the grain memory has been satisfied; and responsive to the storage threshold associated with the grain memory being satisfied, transmitting data grains and redundancy data stored in the memory segment to one or more storage devices.

Efficient cross device redundancy implementation on high performance direct attached non-volatile storage with data reduction

An apparatus for inline compression and deduplication includes a memory unit and a processor coupled to the memory unit. The processor is configured to receive a subset of data from a data stream and select a reference data block corresponding to the subset of data, in which the reference data block is stored in a memory buffer resident in the memory unit. The processor is also configured to compare a first hash value computed for the subset of data to a second hash value computed for the reference data block, in which the first hash value and the second hash value are stored in separate hash tables and generate a compressed representation of the subset of data by modifying header data corresponding to the subset of data responsive to a detected match between the first hash value and the second hash value in one of the separate hash tables.

Apparatus and method for inline compression and deduplication

Growing community of inventors

Cupertino, CA, United States of America

Ashish Singhai