Apple Inc.

Seagate Technology Incorporated

Intel Corporation

Maxtor Corporation

Other

Intel Corporations

Andrew W Vogan

Alexander Paley

Matthew John Byom

Bruce A Liikanen

Daniel Jeffrey Post

John W Vanlaanen

Eric D Mudama

Muhammad N Ashraf

Tudor Antoniu

John P Mead

Lance Flake

Roman Guy

Charan Srinivasan

Arash Esmailzadeh

Evgeny Televitckiy

Mike L Mallary

Erhard Theodor Schreck

Sanjeev N Trika

Jawad Basit Khan

Nir Jacob Wakrat

Xin Guo

Richard L Coulson

Kenneth Louis Herman

Mase J Taub

Don Brunnett

Paul D Ruby

Joseph Sokol, Jr

Russell Alexader Blaine

Donald Joseph Brunnett

Hanmant Pramod Belgal

Jeffrey L McVay

Bruce C Schardt

Sowmiya Jayachandran

Hung V Nguyen

Ning Wu

Stas Mouler

Kushal Dalmia

Eran Sandel

Elad Harush

Yuhua Liu

Liran Erez

Alexander C Sanks

Ivan Kalastirsky

Rick Mangold

David M Jones

Eran Roll

Jasbir Sidhu

Lior Mouler

Hari Hara Kumar Maharaj

Systems and methods for balancing multiple partitions of non-volatile memory devices are provided. Embodiments discussed herein execute a balance proportion scheme in connection with a NVM that is partitioned to have multiple partition types. Each partition type has an associated endurance that defines an average number of program/erase (P/E) cycles it can endure before it reaches failure. For example, a first partition type may have a substantially greater endurance than a second partition type. The balance proportion scheme ensures that, even though each partition type has a different associated endurance, all partition types are used proportionally with respect to each other to balance their respective P/E cycles. This way, both partition types will reach the upper limits of their respective endurance levels out at approximately the same time.

Systems and methods for balancing multiple partitions of non-volatile memory

A method of securely dispersing private user data may include operating a software application configured to utilize user data, receiving the user data, generating a sequence of random bits, and generating a plurality of secret shares from the user data. Generating the plurality of secret shares may include selecting a subset of the user data for each secret share and combining the subset of the user data with the sequence of random bits. The subset of the user data may be a first half of the user data for a first secret share, a second half of the user data for a second secret share, and the whole user data for a third secret share. The method may also include dispersing each of the secret shares.

Information dispersal for secure data storage

Disclosed herein are techniques for balancing write commands directed to a non-volatile memory. According to some embodiments, a method may include caching a plurality of write commands into a write cache, and, in response to determining that an available capacity of the write cache satisfies a first threshold value: performing at least one write operation by directing data associated with the write commands in the write cache to the first partition of the non-volatile memory in response to determining that an available capacity of a first partition of the non-volatile memory satisfies a second threshold value; and performing at least one write operation by directing data associated with the write commands in the write cache to a second partition of the non-volatile memory in response to determining that the available capacity of the first partition of the non-volatile memory does not satisfy the second threshold value.

Techniques for balancing write commands on solid state storage devices (SSDs)

Disclosed herein are techniques for managing context information for data stored within a non-volatile memory of a computing device. According to some embodiments, the method can include (1) loading, into a volatile memory of the computing device, the context information from the non-volatile memory, where the context information is separated into a plurality of silos, (2) writing transactions into a log stored within the non-volatile memory, and (3) each time a condition is satisfied: (i) identifying a next silo of the plurality of silos to be written into the non-volatile memory, (ii) updating the next silo to reflect the transactions that apply to the next silo, and (iii) writing the next silo into the non-volatile memory. In turn, when an inadvertent shutdown of the computing device occurs, the silos of which the context information is comprised can be sequentially accessed and restored in an efficient manner.

Techniques for managing context information for a storage device

Disclosed are techniques for managing context information for data stored within a computing device. According to some embodiments, the method can include the steps of (1) loading, into a volatile memory of the computing device, the context information from a non-volatile memory of the computing device, where the context information is separated into a plurality of portions, and each portion of the plurality of portions is separated into a plurality of sub-portions, (2) writing transactions into a log stored within the non-volatile memory, and (3) each time a condition is satisfied: identifying a next sub-portion to be processed, where the next sub-portion is included in the plurality of sub-portions of a current portion being processed, identifying a portion of the context information that corresponds to the next sub-portion, converting the portion from a first format to a second format, and writing the portion into the non-volatile memory.

Techniques for managing context information for a storage device while maintaining responsiveness

Disclosed herein are techniques for managing parity information for data stored on a storage device. A method includes (1) receiving a request to store data into the storage device, (2) storing portions of the data in data pages included in stripes in a band of the storage device, where a respective data page is stored on a respective different die of a respective stripe, (3) determining primary parity information for a first stripe including a subset of the data pages, (4) storing the primary parity information in a primary parity page included in a second stripe in the stripes in the band, where the primary parity page is disposed on a next available die relative to dies storing the data pages, (5) determining secondary parity information for the second stripe, and (6) storing the secondary parity information in a secondary parity page included in the stripes in the band.

Managing parity information for data stored on a storage device

Systems and methods for managing non-volatile memory devices are provided. Embodiments discussed herein define a native logical space to manage relatively high volume data write operations and define an artificially limited logical space to manage relatively low volume data write operations. The native logical space may include native logical bands that are mapped to a native number of physical blocks to enable high volume, high data transfer of data. The artificially limited logical space may include artificially limited logical bands that are mapped to an artificially limited number of available physical blocks. The artificially limited logical bands are better suited for low volume, low data transfer of data and do not unnecessarily tie up a native number of physical blocks.

Systems and methods for managing an artificially limited logical space of non-volatile memory

Disclosed herein are techniques for reducing write amplification when processing write commands directed to a non-volatile memory. According to some embodiments, the method can include the steps of (1) receiving a first plurality of write commands and a second plurality of write commands, where the first plurality of write commands and the second plurality of write commands are separated by a fence command (2) caching the first plurality of write commands, the second plurality of write commands, and the fence command, and (3) in accordance with the fence command, and in response to identifying that at least one condition is satisfied: (i) issuing the first plurality of write commands to the non-volatile memory, (ii) issuing the second plurality of write commands to the non-volatile memory, and (iii) updating log information to reflect that the first plurality of write commands precede the second plurality of write commands.

Techniques for reducing write amplification on solid state storage devices (SSDs)

Disclosed are techniques for managing parity information for data stored on a storage device. A method can be implemented at a computing device communicably coupled to the storage device, and include (1) receiving a request to write data into a data band of the storage device, (2) writing the data into stripes of the data band, comprising, for each stripe of the data band: (i) calculating first parity information for the data written into the stripe, (ii) writing the first parity information into a volatile memory, and (iii) in response to determining that a threshold number of stripes have been written: converting the first parity information into smaller second parity information, and (3) in response to determining that the data band is read-verified: (i) converting the second parity information into smaller third parity information, and (ii) storing the smaller third parity information into a parity band of the storage device.

Techniques for utilizing volatile memory buffers to reduce parity information stored on a storage device

A method of securely authorizing limited access by a software application to private user data may include operating a software application that can utilize user data, sending a request to a first server to authorize release of the user data, receiving an authorization from the first server to release the user data, and sending a request to retrieve the user data to a plurality of second servers. The method may also include receiving a portion of the user data from each of the plurality of second servers, assembling the user data from at least two of the portions of the user data, and providing the user data to the software application.

Secure and private data storage

Disclosed herein are techniques for managing partitions on a storage device. A method can include (1) identifying a storage capacity of the storage device, (2) generating a first data structure that defines a first partition on the storage device, where the first partition consumes a first amount of the storage capacity, and (3) generating a second data structure that defines a second partition on the storage device, where the second partition consumes at least a portion of a remaining amount of the storage capacity relative to the first amount. In response to receiving a shrink request directed to the first partition, the method can further include (4) identifying a first utilized area within the first partition that will no longer be utilized as a result of the shrink request, and (5) updating first information in the first data structure to indicate that the first utilized area is unutilized.

Techniques for managing partitions on a storage device

Disclosed herein are techniques for managing parity information for data stored on a storage device. According to some embodiments, the method includes the steps of (1) receiving a request to store data into the storage device, (2) writing respective portions of the data into a plurality of data pages included in a first stripe of the storage device, where each data page is stored on a respective different die of the storage device, (3) calculating primary parity information for the first stripe, (4) writing the primary parity information into a primary parity page included in a second stripe of the storage device, (5) calculating secondary parity information for the second stripe, and (6) writing the secondary parity information into a secondary parity page included in a third stripe of the storage device. Additionally, a copy of the secondary parity information can be established to further-enhance redundancy.

Techniques for managing parity information for data stored on a storage device

Growing community of inventors

Portland, OR, United States of America

Andrew W Vogan